Computing a common eigenvector of two matrices in a finite number of arithmetic operations
From MaRDI portal
Publication:5954763
zbMATH Open0986.15009MaRDI QIDQ5954763FDOQ5954763
Authors: Kh. D. Ikramov
Publication date: 6 February 2002
Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)
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
Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cited In (6)
- Common eigenvalues of two matrices
- Complexity results for some eigenvector problems
- On rational criteria for the existence of common eigenvectors or invariant subspaces
- Newton's method for the common eigenvector problem
- On computer-algebra procedures that check for common eigenvectors or invariant subspaces
- Two Eigenvectors for the Price of One
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)