Is Jacobi--Davidson Faster than Davidson?

DOI10.1137/S0895479803430941zbMath1078.65032MaRDI QIDQ4651009

Yvan Notay

Publication date: 21 February 2005

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

convergencenumerical experimentspreconditioningsmallest eigenvalueJacobi-Davidson methodDavidson's methodlarge symmetric matrix

Mathematics Subject Classification ID

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

Related Items (6)

A new justification of the Jacobi-Davidson method for large eigenproblems ⋮ Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems ⋮ JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices ⋮ The Jacobi-Davidson method ⋮ On convergence of iterative projection methods for symmetric eigenvalue problems ⋮ On preconditioned eigensolvers and invert-Lanczos processes

This page was built for publication: Is Jacobi--Davidson Faster than Davidson?