AbstractFor the approximate eigenvalues and eigenvectors obtained from a block Lanczos iteration, characterizations are given in terms of vectors of polynomials.It is proven that after r steps of block Lanczos with selfadjoint iteration matrix S, the application p(S)f of a matrix polynomial and the linear functional 〈v, q(S)f〉 can be evaluated exactly, if p and q are polynomials of degree r − 1 and 2r − 1, respectively. For that, the Lanczos starting block should contain the vectors f and v.Based on this property a priori error bounds for the evaluation of g(S)f and 〈v, g(S)f〉 for more general functions g are derived. The error bounds are applied to the case of calculating the dynamic response in forced vibration problems. A numerical examp...
AbstractWe present a new variant of the block Lanczos algorithm for finding vectors in the kernel of...
This dissertation proposes an efficient eigenvalue solution method for structures by improving Lancz...
AbstractLanczos method for solving Ax = b consists in constructing the sequence of vectors (xk) such...
AbstractFor the approximate eigenvalues and eigenvectors obtained from a block Lanczos iteration, ch...
The Lanczos process constructs a sequence of orthonormal vectors $v_m$ spanning a nested sequence of...
We give an elementary exposition of the Lanczos technique to solve the matrix eigenvalue problem. Th...
Dedicated to Richard Varga on the occasion of his 70th birthday The Lanczos method can be generalize...
AbstractIn this paper, the new theoretical error bounds on the convergence of the Lanczos and the bl...
Eigenvalue problems for very large sparse matrices based on the Lanczos' minimized iteration method ...
We use a block Lanczos algorithm for computing a few of the smallest eigenvalues and the correspond...
Lanczos method for solving a system of linear equations can be derived by using formal orthogonal po...
In this thesis, we develop an efficient accurate numerical algorithm for evaluating a few of the sma...
We analyze the Lanczos method for matrix function approximation (Lanczos-FA), an iterative algorithm...
We extend the error bounds from [SIMAX, Vol. 43, Iss. 2, pp. 787-811 (2022)] for the Lanczos method ...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/...
AbstractWe present a new variant of the block Lanczos algorithm for finding vectors in the kernel of...
This dissertation proposes an efficient eigenvalue solution method for structures by improving Lancz...
AbstractLanczos method for solving Ax = b consists in constructing the sequence of vectors (xk) such...
AbstractFor the approximate eigenvalues and eigenvectors obtained from a block Lanczos iteration, ch...
The Lanczos process constructs a sequence of orthonormal vectors $v_m$ spanning a nested sequence of...
We give an elementary exposition of the Lanczos technique to solve the matrix eigenvalue problem. Th...
Dedicated to Richard Varga on the occasion of his 70th birthday The Lanczos method can be generalize...
AbstractIn this paper, the new theoretical error bounds on the convergence of the Lanczos and the bl...
Eigenvalue problems for very large sparse matrices based on the Lanczos' minimized iteration method ...
We use a block Lanczos algorithm for computing a few of the smallest eigenvalues and the correspond...
Lanczos method for solving a system of linear equations can be derived by using formal orthogonal po...
In this thesis, we develop an efficient accurate numerical algorithm for evaluating a few of the sma...
We analyze the Lanczos method for matrix function approximation (Lanczos-FA), an iterative algorithm...
We extend the error bounds from [SIMAX, Vol. 43, Iss. 2, pp. 787-811 (2022)] for the Lanczos method ...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/...
AbstractWe present a new variant of the block Lanczos algorithm for finding vectors in the kernel of...
This dissertation proposes an efficient eigenvalue solution method for structures by improving Lancz...
AbstractLanczos method for solving Ax = b consists in constructing the sequence of vectors (xk) such...