A Harmonic Restarted Arnoldi Algorithm for Calculating Eigenvalues and Determining Multiplicity
نویسندگان
چکیده
A restarted Arnoldi algorithm is given that computes eigenvalues and eigenvectors. It is related to implicitly restarted Arnoldi, but has a simpler restarting approach. Harmonic and regular RayleighRitz versions are possible. For multiple eigenvalues, an approach is proposed that first computes eigenvalues with the new harmonic restarted Arnoldi algorithm, then uses random restarts to determine multiplicity. This avoids the need for a block method or for relying on roundoff error to produce the multiple copies.
منابع مشابه
Some new restart vectors for explicitly restarted Arnoldi method
The explicitly restarted Arnoldi method (ERAM) can be used to find some eigenvalues of large and sparse matrices. However, it has been shown that even this method may fail to converge. In this paper, we present two new methods to accelerate the convergence of ERAM algorithm. In these methods, we apply two strategies for the updated initial vector in each restart cycles. The implementation of th...
متن کاملA hybrid of the restarted Arnoldi and electromagnetism meta-heuristic methods for calculating eigenvalues and eigenvectors of a non-symmetric matrix
In this paper, we present a new algorithm, which is called electromagnetism meta-heuristic restarted Arnoldi algorithm (EM-RA) for calculating eigenvalues and eigenvectors of a non-symmetric matrix. In most of the restarting methods the basic idea is a selection of the best initial eigenvector, but our aim is to improve the initial eigenvectors in each iteration of the restarting method. Numeri...
متن کاملAnalysis of Accelerating Algorithms for the Restarted Arnoldi Iteration
We present an approach for the acceleration of the restarted Arnoldi iteration for the computation of a number of eigenvalues of the standard eigenproblem Ax = x. This study applies the Chebyshev polynomial to the restarted Arnoldi iteration and proves that it computes necessary eigenvalues with far less complexity than the QR method. We also discuss the dependence of the convergence rate of th...
متن کاملEvaluation of Acceleration Techniques for the Restarted Arnoldi Method
We present an approach for the acceleration of the restarted Arnoldi iteration for the computation of a number of eigenvalues of the standard eigenproblem Ax = λx. This study applies the Chebyshev polynomial to the restarted Arnoldi iteration and proves that it computes necessary eigenvalues with far less complexity than the QR method. We also discuss the dependence of the convergence rate of t...
متن کاملPii: S0168-9274(01)00132-5
The harmonic Arnoldi method can be used to compute some eigenpairs of a large matrix, and it is more suitable for finding interior eigenpairs. However, the harmonic Ritz vectors obtained by the method may converge erratically and may even fail to converge, so that resulting algorithms may not perform well. To improve convergence, a refined harmonic Arnoldi method is proposed that replaces the h...
متن کامل