On parallelizable eigensolvers
It is shown that, if one has a polynomial that is close to zero on a subset of the eigenvalues of a matrix, one can approximatively divide its eigenvalue problem into two. It is proposed that such a division should be the basis of a divide and conquer strategy for eigenvalue computation, but no way is devised to find such an annihilating polynomial.
scientific article; zbMATH DE number 98830