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.
Type de document :
[Research Report] RR-7099, INRIA. 2009, pp.23
Liste complète des métadonnées

Littérature citée [28 références]  Voir  Masquer  Télécharger

Contributeur : Bernard Philippe <>
Soumis le : mardi 17 novembre 2009 - 19:58:17
Dernière modification le : mercredi 16 mai 2018 - 11:23:05
Document(s) archivé(s) le : mardi 16 octobre 2012 - 14:20:42


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00433009, version 1


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



Consultations de la notice


Téléchargements de fichiers