A finite rational algorithm that verifies the diagonalizability of a square matrix by congruence


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

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.

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

Supplementary Files
Action
1. JATS XML

Copyright (c) 2016 Allerton Press, Inc.