Using Krylov approximations to the matrix exponential operator in Davidson's method

DOI10.1016/S0168-9274(98)00134-2MaRDI QIDQ1807760zbMATH OpenFDO

Authors Karl Meerbergen, M. Sadkane

Publication date 2 August 2000

Published in Applied Numerical Mathematics (Search for Journal in Brave)

zbMATH Keywords

convergencenumerical examplesKrylov subspace methodGalerkin projectionArnoldi methodJacobi-Davidson methodmatrix exponentialdominant eigenvaluesDavidson methodeigenpairsrightmost eigenvalueslarge sparse nonsymmetric square matrix

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• Is Jacobi--Davidson Faster than Davidson?
• The Davidson Method
• Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices

Cited in

(2)

• Fixing nonconvergence of algebraic iterative reconstruction with an unmatched backprojector
• Robust linear stability analysis and a new method for computing the action of the matrix exponential

Describes a project that uses

Uses Software

• SPARSKIT
• ITSOL
• eigs

This page was built for publication: Using Krylov approximations to the matrix exponential operator in Davidson's method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1807760)