On computer-algebra procedures that check for common eigenvectors or invariant subspaces

DOI10.1007/BF02409860zbMath0940.65041OpenAlexW2012327764MaRDI QIDQ1975005

N. V. Savel'eva, Vadim N. Chugunov, Khakim D. Ikramov

Publication date: 27 March 2000

Published in: Computational Mathematics and Modeling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02409860

zbMATH Keywords

numerical experimentsinvariant subspacesmatrices of integersalgebraic computationtest matricescommon eigenvectorsfinite algorithmcomputer-algebra system MAPLEmatrices of rationals

Mathematics Subject Classification ID

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

Uses Software

• Maple

Cites Work

• Common eigenvectors of two matrices
• Doubly stochastic matrices with prescribed positive spectrum
• A ring of Brownian matrices
• Generalized inverses of circulant and generalized circulant matrices
• Simultaneous quasi-diagonalization of normal matrices
• Simultaneous quasidiagonalization of complex matrices
• A non-commutative spectral theorem
• The Moore-Penrose inverse of a retrocirculant
• The canonical Schur form of a unitarily quasidiagonalizable matrix
• On a type of circulants
• Two Notes on Matrices
• Simultaneous triangularization of matrices—low rank cases and the nonderogatory case
• On Quasi-Commutative Matrices
• A Generalization of a Class of Test Matrices
• A Theorem of Polynomial Identities
• Minimal Identities for Algebras
• On rational criteria for the existence of common eigenvectors or invariant subspaces

This page was built for publication: On computer-algebra procedures that check for common eigenvectors or invariant subspaces