Homotopy method for the large, sparse, real nonsymmetric eigenvalue problem

Abstract

A homotopy method to compute the eigenpairs, i.e.,the eigenvectors and eigenvalues, of a given real matrix A(1) is presented. From the eigenpairs of some real matrix A(0), the eigenpairs of A(t) equivalent to (1 - t)A(0) + tA(1) are followed at successive `'times'' from t = 0 to t = 1 using continuation. At t = 1, the eigenpairs of the desired matrix Al are found. The following phenomena are present when following the eigenpairs of a general nonsymmetric matrix: . bifurcation, . ill conditioning due to nonorthogonal eigenvectors, . jumping of eigenpaths. These can present considerable computational difficulties. Since each eigenpair can be followed independently, this algorithm is ideal for concurrent computers. The homotopy method has the potential to compete with other algorithms for computing a few eigenvalues of large, sparse matrices. It may be a useful tool for determining the stability of a solution of a PDE. Some numerical results will be presented