An Arnoldi-based iterative scheme for nonsymmetric matrix pencils arising in finite element stability problems (Q1195466): Difference between revisions

There are three algorithms which are used for the computation of several eigenpairs: a) the subspace iteration, b) the unsymmetric Lanczos procedure, and c) the Arnoldi iteration. The latter which is described in an unpublished paper by Y. Saad, is the favorite candidate in this paper. An implementation with appropriate restarts and shifts is presented. The application to the following two real life problems is discussed: the Orr-Sommerfeld equation and a chemical reactor equation. The discussion contains the following remark: `The finite element discretization of continuous eigenvalue problems often leads to the appearance of a large number of ``spurious'' eigenmodes in the discrete problem with corresponding eigenvalues having very large modulus. These spurious eigenmodes have no counterpart in the original continuous problem and are therefore extremely sensitive and ill-conditioned with respect to the discretization'.