Robust expansion of subspaces in iterative projection methods for large eigenvalue problems

Heinrich Voß · PAMM · 2007

Abstract The Jacobi–Davidson method is known to converge at least quadratically if the correction equation is solved exactly, and it is common experience that the fast convergence is maintained if the correction equation is solved only approximately. Here we derive the Jacobi–Davidson method in a way that explains this robust behavior. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

Read the paper · More papers on PaperTik