The harmonic Arnoldi method can be used to find interior eigenpairs of large matrices. However, it has been shown that this method may converge erratically and even may fail to do so. In this paper, we present a new method for computing interior eigenpairs of large nonsymmetric matrices, which is called weighted harmonic Arnoldi method. The implementation of the method has been tested by numerical examples, the results show that the method converges fast and works with high accuracy
AbstractThe shift-and-invert Arnoldi method has been popularly used for computing a number of eigenv...
AbstractWe present an efficient inexact implicitly restarted Arnoldi algorithm to find a few eigenpa...
Eigenvalue problems in which just a few eigenvalues and -vectors of a large and sparse matrix have t...
AbstractThe harmonic block Arnoldi method can be used to find interior eigenpairs of large matrices....
给出了调和Arnoldi算法的一种等价变形.利用求解Krylov子空间和其位移子空间的基之间的巧妙关系式,作者以较少的运算量将原大规模矩阵特征问题转化为一个标准特征问题求解,比原来调和Arnoldi算...
AbstractThe global Arnoldi method can be used to compute exterior eigenpairs of a large non-Hermitia...
We propose a restarted Arnoldi's method with Faber polynomials and discuss its use for computing the...
We present two methods for computing the leading eigenpairs of large sparse unsymmetric matrices. Na...
Arnoldi method approximates exterior eigenvalues of a large sparse matrix, but may fail to approxima...
AbstractComputing eigenvalues from the interior of the spectrum of a large matrix is a difficult pro...
Computing eigenvalues from the interior of the spectrum of a large matrix is a difficult problem. Th...
This study proposes a method for the acceleration of the projection method to coinpute a few eigenva...
There are several known methods for computing eigenvalues of a large sparse nonsymmetric matrix. One...
AbstractArnoldi's method has been popular for computing the small number of selected eigenvalues and...
AbstractThe block Arnoldi method is one of the most commonly used techniques for large eigenproblems...
AbstractThe shift-and-invert Arnoldi method has been popularly used for computing a number of eigenv...
AbstractWe present an efficient inexact implicitly restarted Arnoldi algorithm to find a few eigenpa...
Eigenvalue problems in which just a few eigenvalues and -vectors of a large and sparse matrix have t...
AbstractThe harmonic block Arnoldi method can be used to find interior eigenpairs of large matrices....
给出了调和Arnoldi算法的一种等价变形.利用求解Krylov子空间和其位移子空间的基之间的巧妙关系式,作者以较少的运算量将原大规模矩阵特征问题转化为一个标准特征问题求解,比原来调和Arnoldi算...
AbstractThe global Arnoldi method can be used to compute exterior eigenpairs of a large non-Hermitia...
We propose a restarted Arnoldi's method with Faber polynomials and discuss its use for computing the...
We present two methods for computing the leading eigenpairs of large sparse unsymmetric matrices. Na...
Arnoldi method approximates exterior eigenvalues of a large sparse matrix, but may fail to approxima...
AbstractComputing eigenvalues from the interior of the spectrum of a large matrix is a difficult pro...
Computing eigenvalues from the interior of the spectrum of a large matrix is a difficult problem. Th...
This study proposes a method for the acceleration of the projection method to coinpute a few eigenva...
There are several known methods for computing eigenvalues of a large sparse nonsymmetric matrix. One...
AbstractArnoldi's method has been popular for computing the small number of selected eigenvalues and...
AbstractThe block Arnoldi method is one of the most commonly used techniques for large eigenproblems...
AbstractThe shift-and-invert Arnoldi method has been popularly used for computing a number of eigenv...
AbstractWe present an efficient inexact implicitly restarted Arnoldi algorithm to find a few eigenpa...
Eigenvalue problems in which just a few eigenvalues and -vectors of a large and sparse matrix have t...