On computer-algebra procedures that check for common eigenvectors or invariant subspaces
From MaRDI portal
Publication:1975005
Recommendations
- Computing a common eigenvector of two matrices in a finite number of arithmetic operations
- On rational criteria for the existence of common eigenvectors or invariant subspaces
- Computer algebra procedures for verifying the definiteness of a matrix on a subspace
- Rational procedures in the problem of common invariant subspaces of two matrices
- On computing the eigenvectors of a class of structured matrices
- On two approaches to the common invariant subspace problem for a pair of matrices
- scientific article; zbMATH DE number 4151736
- On the Orthogonality of Eigenvectors Computed by Divide-and-Conquer Techniques
- scientific article; zbMATH DE number 4121301
- Computing invariant subspaces of a regular linear pencil of matrices
Cites work
- A Generalization of a Class of Test Matrices
- A Theorem of Polynomial Identities
- A non-commutative spectral theorem
- A ring of Brownian matrices
- Common eigenvectors of two matrices
- Doubly stochastic matrices with prescribed positive spectrum
- Generalized inverses of circulant and generalized circulant matrices
- Minimal Identities for Algebras
- On Quasi-Commutative Matrices
- On a type of circulants
- On rational criteria for the existence of common eigenvectors or invariant subspaces
- Simultaneous quasi-diagonalization of normal matrices
- Simultaneous quasidiagonalization of complex matrices
- Simultaneous triangularization of matrices—low rank cases and the nonderogatory case
- The Moore-Penrose inverse of a retrocirculant
- The canonical Schur form of a unitarily quasidiagonalizable matrix
- Two Notes on Matrices
Cited in
(8)- The common invariant subspace problem: an approach via Gröbner bases
- The sum of proper subspaces of a matrix can be obtained by a rational computation.
- Common eigenvectors of two matrices
- A criterion for the existence of common invariant subspaces of matrices
- Computer algebra procedures for verifying the definiteness of a matrix on a subspace
- On rational criteria for the existence of common eigenvectors or invariant subspaces
- Generalized Shemesh criterion, common invariant subspaces and irreducible completely positive superoperators
- Computing a common eigenvector of two matrices in a finite number of arithmetic operations
This page was built for publication: On computer-algebra procedures that check for common eigenvectors or invariant subspaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1975005)