Computing a common eigenvector of two matrices in a finite number of arithmetic operations

MaRDI QIDQ5954763zbMATH OpenFDO

Authors Kh. D. Ikramov

Publication date 6 February 2002

Published in Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

common eigenvectorfinite number of arithmetic operationstwo matrices

Mathematics Subject Classification ID

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

Recommendations

• Common eigenvalues of two matrices
• On rational criteria for the existence of common eigenvectors or invariant subspaces
• Newton's method for the common eigenvector problem
• The common invariant subspace problem: an approach via Gröbner bases
• On computer-algebra procedures that check for common eigenvectors or invariant subspaces

Cited in

(6)

• On computer-algebra procedures that check for common eigenvectors or invariant subspaces
• Complexity results for some eigenvector problems
• Common eigenvalues of two matrices
• Two Eigenvectors for the Price of One
• On rational criteria for the existence of common eigenvectors or invariant subspaces
• Newton's method for the common eigenvector problem

This page was built for publication: Computing a common eigenvector of two matrices in a finite number of arithmetic operations

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