A finite rational algorithm that verifies the diagonalizability of a square matrix by congruence
- Authors: Ikramov K.D.1
-
Affiliations:
- Faculty of Computational Mathematics and Cybernetics
- Issue: Vol 40, No 2 (2016)
- Pages: 53-56
- Section: Article
- URL: https://journals.rcsi.science/0278-6419/article/view/176122
- DOI: https://doi.org/10.3103/S0278641916020059
- ID: 176122
Cite item
Abstract
Let A be a square matrix of order n whose entries are rational or rational Gaussian numbers. A method is described that verifies the possibility of diagonalizing A by means of congruence and uses a finite number of arithmetic (and, in the complex case, conjugation) operations.
Keywords
About the authors
Kh. D. Ikramov
Faculty of Computational Mathematics and Cybernetics
Author for correspondence.
Email: ikramov@cs.msu.su
Russian Federation, Moscow, 119991
Supplementary files
