Computing a common eigenvector of two matrices in a finite number of arithmetic operations
It is known that the problem of eigenvalues of a complex \(n\times n\) matrix \(A\) is not solvable in radicals for \(n \geq 5\). This is true both in relation to the calculation of all the eigenvalues and only one of them. It is supposed that the matrix \(A\) has the only eigenvalue which is common with an eigenvalue of another matrix \(B\). In this case the eigenvalue can be found by a finite number of arithmetic operations. The goal of the article is to find an analogical algorithm for the calculation of a common eigenvector of two matrices.
- 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
- 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)
