Common invariant subspaces of two matrices

DOI10.1016/S0024-3795(98)10150-7MaRDI QIDQ1301299zbMATH OpenFDO

Authors Alan George, Kh. D. Ikramov

Publication date 2 September 1999

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0024-3795(98)10150-7

zbMATH Keywords

algorithmcommon eigenvectorcommon invariant subspacefinite rational computation

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Review text

A finite rational procedure of Shemesh type is proposed to check whether given complex \(n\times n\) matrices \(A\) and \(B\) have a common invariant subspace of dimension \(k\), \(2\leq k<n\). The only restriction is that at least one of \(A\) and \(B\) must have distinct eigenvalues. This fact can also be verified by a finite rational computation. The main theorem is in Section 3; Section 4 contains the algorithm with remarks.

Recommendations

• On a rational procedure for verifying the existence of a two-dimensional common invariant subspace for a given pair of matrices.
• Rational procedures in the problem of common invariant subspaces of two matrices
• On computer-algebra procedures that check for common eigenvectors or invariant subspaces
• On rational criteria for the existence of common eigenvectors or invariant subspaces

Cites work

• Common eigenvectors of two matrices
• scientific article; zbMATH DE number 3204642 (Why is no real title available?)
• Simultaneous triangularization of matrices—low rank cases and the nonderogatory case

Cited in

(24)

• On two approaches to the common invariant subspace problem for a pair of matrices
• Rational procedures in the problem of common invariant subspaces of two matrices
• On a rational procedure for verifying the existence of a two-dimensional common invariant subspace for a given pair of matrices.
• The sum of proper subspaces of a matrix can be obtained by a rational computation.
• Solving the two-dimensional CIS problem by a rational algorithm
• A criterion for the existence of common invariant subspaces of matrices
• On rational calculation of the invariant subspaces of a complex matrix
• Quantum compression relative to a set of measurements
• The common invariant subspace problem: an approach via Gröbner bases
• Common invariant subspace and commuting matrices
• Quantifier elimination theory and maps which preserve semipositivity
• Generalized Shemesh criterion, common invariant subspaces and irreducible completely positive superoperators
• On generalized common quasi-eigenvector problems
• Intersection of Two Invariant Subspaces
• Diagonalization of matrices over the domain of principal ideals with minimal polynomial m( )=( - )( -),
• On the existence of a common eigenvector for all matrices in the commutant of a single matrix
• The common invariant subspace problem and Tarski's theorem
• Common eigenvalues of two matrices
• On maps which preserve semipositivity and quantifier elimination theory for real numbers
• Ascending chains of ideals in the polynomial ring
• Burnside graphs, algebras generated by sets of matrices, and the Kippenhahn conjecture
• On rational criteria for the existence of common eigenvectors or invariant subspaces
• Random repeated quantum interactions and random invariant states
• Common eigenvectors of two matrices

This page was built for publication: Common invariant subspaces of two matrices

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