Many methods for the computation of selected eigenpairs of generalized eigenproblems for
matrix pairs use a shift-and-invert technique. When applied to large-scale problems, this …

As is well known, solving matrix multiple eigenvalue problems is a very difficult topic. In this
paper, Arnoldi type algorithms are proposed for large unsymmetric multiple eigenvalue …

Arnoldi's method has been popular for computing the small number of selected eigenvalues
and the associated eigenvectors of large unsymmetric matrices. However, the approximate …

The shift-and-invert Arnoldi method has been popularly used for computing a number of
eigenvalues close to a given shift and/or the associated eigenvectors of a large unsymmetric …

This paper describes a method for computing the dominant/right-most eigenvalues of large
matrices. The method consists of refining the approximate eigenelements of a large matrix …

A general discussion of applications, where numerical solution of large scale matrix
eigenvalue problems occur, is given and the most common solution methods are classi ed …

In Chapter 1, we present some sources of large unsymmetric eigenproblems arising in
applications and overview the state of research of three existing basic projection methods …

We present a refined Arnoldi-type method for extracting partial eigenpairs of large matrices.
The approximate eigenvalues are the Ritz values of (A− τ I)− 1 with respect to a shifted …

In this paper we apply the recently proposed Jacobi-Davidson method for calculating
extreme eigenvalues of large matrices to a generalized eigenproblem. This leads to an …

Arnoldi methods can be more effective than subspace iteration methods for computing the
dominant eigenvalues of a large, sparse, real, unsymmetric matrix. A code, EB12, for the …