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

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.