AbstractA transpose-free two-sided nonsymmetric Lanczos method is developed for multiple starting vectors on both the left and right. The method is mathematically equivalent to the two-sided methods without look-ahead or deflation steps, but avoids the use of the transpose of the system matrix. The method is applied to the computation of the matrix Padé approximation to a linear dynamical system. The result is a method which can be labeled transpose-free matrix Padé via Lanczos (TFMPVL). Under certain circumstances, TFMPVL will actually reduce the total number of matrix-vector products needed. It is illustrated with some numerical examples
The method of Lanczos for solving systems of linear equations is implemented by various recurrence r...
Includes bibliographical references (p. 70-74)We are interested in computing eigenvalues and eigenve...
In this paper, we investigate the block Lanczos algorithm for solving large sparse symmetric linear ...
AbstractA transpose-free two-sided nonsymmetric Lanczos method is developed for multiple starting ve...
We present a transpose-free version of the nonsymmetric scaled Lanczos procedure. It generates the s...
We present a transpose-free version of the nonsymmetric scaled Lanczos procedure. It generates the s...
We present a transpose-free version of the nonsymmetric scaled Lanczos procedure. It generates the s...
We present a transpose-free version of the nonsymmetric scaled Lanczos procedure. It generates the s...
. Given a square matrix and single right and left starting vectors, the classical nonsymmetric Lancz...
AbstractIn this paper, we propose a method with a finite termination property for solving the linear...
Among the iterative methods for solving large linear systems with a sparse (or, possibly, structured...
The solution of linear systems with a parameter is an important problem in engineering applications,...
The method of Lanczos for solving systems of linear equations is implemented by using recurrence rel...
AbstractSimple versions of the conjugate gradient algorithm and the Lanczos method are discussed, an...
The solution of linear systems with a parameter is an important problem in engineering applications,...
The method of Lanczos for solving systems of linear equations is implemented by various recurrence r...
Includes bibliographical references (p. 70-74)We are interested in computing eigenvalues and eigenve...
In this paper, we investigate the block Lanczos algorithm for solving large sparse symmetric linear ...
AbstractA transpose-free two-sided nonsymmetric Lanczos method is developed for multiple starting ve...
We present a transpose-free version of the nonsymmetric scaled Lanczos procedure. It generates the s...
We present a transpose-free version of the nonsymmetric scaled Lanczos procedure. It generates the s...
We present a transpose-free version of the nonsymmetric scaled Lanczos procedure. It generates the s...
We present a transpose-free version of the nonsymmetric scaled Lanczos procedure. It generates the s...
. Given a square matrix and single right and left starting vectors, the classical nonsymmetric Lancz...
AbstractIn this paper, we propose a method with a finite termination property for solving the linear...
Among the iterative methods for solving large linear systems with a sparse (or, possibly, structured...
The solution of linear systems with a parameter is an important problem in engineering applications,...
The method of Lanczos for solving systems of linear equations is implemented by using recurrence rel...
AbstractSimple versions of the conjugate gradient algorithm and the Lanczos method are discussed, an...
The solution of linear systems with a parameter is an important problem in engineering applications,...
The method of Lanczos for solving systems of linear equations is implemented by various recurrence r...
Includes bibliographical references (p. 70-74)We are interested in computing eigenvalues and eigenve...
In this paper, we investigate the block Lanczos algorithm for solving large sparse symmetric linear ...