AbstractThe block Arnoldi method is one of the most commonly used techniques for large eigenproblems. In this paper, we exploit certain modified Ritz vectors to take the place of Ritz vectors in the thick-restarted block Arnoldi algorithm, and propose a modified thick-restarted block Arnoldi algorithm for large eigenproblems. We then consider how to periodically combine the refined subspace iterative method with the modified thick-restarting block Arnoldi algorithm for computing a few dominant eigenpairs of a large matrix. The resulting algorithm is called a Subspace-Block Arnoldi algorithm. Numerical experiments show the efficiency of our new algorithms
AbstractComputing the eigenvalues and eigenvectors of a large sparse nonsymmetric matrix arises in m...
AbstractWe present an efficient inexact implicitly restarted Arnoldi algorithm to find a few eigenpa...
The Arnoldi iteration is widely used to compute a few eigenvalues of a large sparse or structured ma...
AbstractThe block Arnoldi method is one of the most commonly used techniques for large eigenproblems...
AbstractWhen the matrix in question is unsymmetric, the approximate eigenvectors or Ritz vectors obt...
Sorensen's iteratively restarted Arnoldi algorithm is one of the most successful and flexible method...
AbstractThe harmonic block Arnoldi method can be used to find interior eigenpairs of large matrices....
Jia ZX, Elsner L. Improving eigenvectors in Arnoldi's method. JOURNAL OF COMPUTATIONAL MATHEMATICS. ...
AbstractArnoldi's method has been popular for computing the small number of selected eigenvalues and...
There are several known methods for computing eigenvalues of a large sparse nonsymmetric matrix. One...
Most iterative algorithms for eigenpair computation consist of two main steps: a subspace update (SU...
AbstractWe discuss a class of deflated block Krylov subspace methods for solving large scale matrix ...
AbstractThe shift-and-invert Arnoldi method has been popularly used for computing a number of eigenv...
International audienceThe implicitly restarted Arnoldi method (IRAM) computes some eigenpairs of lar...
We present two methods for computing the leading eigenpairs of large sparse unsymmetric matrices. Na...
AbstractComputing the eigenvalues and eigenvectors of a large sparse nonsymmetric matrix arises in m...
AbstractWe present an efficient inexact implicitly restarted Arnoldi algorithm to find a few eigenpa...
The Arnoldi iteration is widely used to compute a few eigenvalues of a large sparse or structured ma...
AbstractThe block Arnoldi method is one of the most commonly used techniques for large eigenproblems...
AbstractWhen the matrix in question is unsymmetric, the approximate eigenvectors or Ritz vectors obt...
Sorensen's iteratively restarted Arnoldi algorithm is one of the most successful and flexible method...
AbstractThe harmonic block Arnoldi method can be used to find interior eigenpairs of large matrices....
Jia ZX, Elsner L. Improving eigenvectors in Arnoldi's method. JOURNAL OF COMPUTATIONAL MATHEMATICS. ...
AbstractArnoldi's method has been popular for computing the small number of selected eigenvalues and...
There are several known methods for computing eigenvalues of a large sparse nonsymmetric matrix. One...
Most iterative algorithms for eigenpair computation consist of two main steps: a subspace update (SU...
AbstractWe discuss a class of deflated block Krylov subspace methods for solving large scale matrix ...
AbstractThe shift-and-invert Arnoldi method has been popularly used for computing a number of eigenv...
International audienceThe implicitly restarted Arnoldi method (IRAM) computes some eigenpairs of lar...
We present two methods for computing the leading eigenpairs of large sparse unsymmetric matrices. Na...
AbstractComputing the eigenvalues and eigenvectors of a large sparse nonsymmetric matrix arises in m...
AbstractWe present an efficient inexact implicitly restarted Arnoldi algorithm to find a few eigenpa...
The Arnoldi iteration is widely used to compute a few eigenvalues of a large sparse or structured ma...