Skip to Main content Skip to Navigation
Reports

On the generation of Krylov subspace bases

Abstract : Many problems in scientific computing involving a large sparse matrix A are solved by Krylov subspace methods. This includes methods for the solution of large linear systems of equations with A, for the computation of a few eigenvalues and associated eigenvectors of A, and for the approximation of nonlinear matrix functions of A. When the matrix A is non-Hermitian, the Arnoldi process commonly is used to compute an orthonormal basis of a Krylov subspace associated with A. The Arnoldi process often is implemented with the aid of the modified Gram-Schmidt method. It is well known that the latter constitutes a bottleneck in parallel computing environments, and to some extent also on sequential computers. Several approaches to circumvent orthogonalization by the modified Gram-Schmidt method have been described in the literature, including the generation of Krylov subspace bases with the aid of suitably chosen Chebyshev or Newton polynomials. We review these schemes and describe new ones. Numerical examples are presented.
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download

https://hal.inria.fr/inria-00433009
Contributor : Bernard Philippe <>
Submitted on : Tuesday, November 17, 2009 - 7:58:17 PM
Last modification on : Tuesday, June 15, 2021 - 4:13:22 PM
Long-term archiving on: : Tuesday, October 16, 2012 - 2:20:42 PM

File

RR-7099.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00433009, version 1

Citation

Bernard Philippe, Lothar Reichel. On the generation of Krylov subspace bases. [Research Report] RR-7099, INRIA. 2009, pp.23. ⟨inria-00433009⟩

Share

Metrics

Record views

535

Files downloads

902