On rational calculation of the invariant subspaces of a complex matrix

MaRDI QIDQ1608263zbMATH OpenFDO

Authors Kh. D. Ikramov

Publication date 16 October 2002

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

complex matrixeigenvectorsinvariant subspacerational algorithm

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Review text

An elementary linear-algebraic explanation is proposed for the recently discovered fact that the sum of the eigenspaces of a nondiagonalizable complex matrix can be determined by a rational algorithm, i.e., by a procedure involving only a finite number of arithmetic operations. This assertion turns out to be a special case of a more general fact that also makes it possible to calculate other invariant subspaces of a matrix.

Recommendations

• The sum of proper subspaces of a matrix can be obtained by a rational computation.
• Enumerating invariant subspaces of \(\mathbb R^{n}\)
• On rational criteria for the existence of common eigenvectors or invariant subspaces
• Common invariant subspaces of two matrices
• scientific article; zbMATH DE number 4151736

Cited in

(2)

• The sum of proper subspaces of a matrix can be obtained by a rational computation.
• Enumerating invariant subspaces of \(\mathbb R^{n}\)

This page was built for publication: On rational calculation of the invariant subspaces of a complex matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1608263)