AbstractThe Lanczos algorithm with a new recursive partitioning method to compute the eigenvalues, in a given specified interval, is presented in this paper. Comparisons have been made respecting the numerical results as well as the CPU-time with that of the Sturm sequence-bisection method
Abstract. We investigate the behavior of the Lanczos process when it is used to find all the eigenva...
The application of the Lanczos algorithm for the solution of eigenvalue problems connected with cycl...
Several methods are discribed for combinations of Krylov subspace techniques, deflation procedures a...
AbstractIn this paper, the computation of the smallest eigenvalues and the corresponding eigenvector...
AbstractFirst we identify five options which can be used to distinguish one Lanczos eigenelement pro...
AbstractEigenvalues and eigenvectors of a large sparse symmetric matrix A can be found accurately an...
The Lanczos algorithm is a well known technique for approximating a few eigenvalues and correspondin...
A new stable and efficient implementation of the Lanczos algorithm is presented. The algorithm is a ...
An important problem in scientific computing consists in finding a few eigenvalues and corresponding...
Eigenvalue problems for very large sparse matrices based on the Lanczos' minimized iteration method ...
Includes bibliographical references (p. 70-74)We are interested in computing eigenvalues and eigenve...
There are continual and compelling needs for computing many eigenpairs of very large Hermitian matri...
AbstractThe Lanczos algorithm is used to compute some eigenvalues of a given symmetric matrix of lar...
We give an elementary exposition of the Lanczos technique to solve the matrix eigenvalue problem. Th...
AbstractIn this article, we present a novel algorithm, named nonsymmetric K−-Lanczos algorithm, for ...
Abstract. We investigate the behavior of the Lanczos process when it is used to find all the eigenva...
The application of the Lanczos algorithm for the solution of eigenvalue problems connected with cycl...
Several methods are discribed for combinations of Krylov subspace techniques, deflation procedures a...
AbstractIn this paper, the computation of the smallest eigenvalues and the corresponding eigenvector...
AbstractFirst we identify five options which can be used to distinguish one Lanczos eigenelement pro...
AbstractEigenvalues and eigenvectors of a large sparse symmetric matrix A can be found accurately an...
The Lanczos algorithm is a well known technique for approximating a few eigenvalues and correspondin...
A new stable and efficient implementation of the Lanczos algorithm is presented. The algorithm is a ...
An important problem in scientific computing consists in finding a few eigenvalues and corresponding...
Eigenvalue problems for very large sparse matrices based on the Lanczos' minimized iteration method ...
Includes bibliographical references (p. 70-74)We are interested in computing eigenvalues and eigenve...
There are continual and compelling needs for computing many eigenpairs of very large Hermitian matri...
AbstractThe Lanczos algorithm is used to compute some eigenvalues of a given symmetric matrix of lar...
We give an elementary exposition of the Lanczos technique to solve the matrix eigenvalue problem. Th...
AbstractIn this article, we present a novel algorithm, named nonsymmetric K−-Lanczos algorithm, for ...
Abstract. We investigate the behavior of the Lanczos process when it is used to find all the eigenva...
The application of the Lanczos algorithm for the solution of eigenvalue problems connected with cycl...
Several methods are discribed for combinations of Krylov subspace techniques, deflation procedures a...