Restarting techniques for the (Jacobi-)Davidson symmetric eigenvalue method

MaRDI QIDQ1279554zbMATHFDO

Authors Andreas Stathopoulos, Y. Saad

Publication date 8 February 1999

Published in ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/119749

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

convergenceeigenvectorspreconditioningnumerical experimentsconjugate gradient methodArnoldi methodJacobi-Davidson methoddeflationLanczos methodimplicit restartinglarge sparse symmetric eigenvalue problems

Mathematics Subject Classification ID

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

Recommendations

• Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
• The Davidson Method
• Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems
• Thick-restart Lanczos method for large symmetric eigenvalue problems

Cited in

(23)

• A Case for a Biorthogonal Jacobi--Davidson Method: Restarting and Correction Equation
• Fast iterative interior eigensolver for millions of atoms
• Rayleigh quotient iteration and simplified Jacobi-Davidson method with preconditioned iterative solves
• Rayleigh quotient minimization method for symmetric eigenvalue problems
• Extending the eigCG algorithm to nonsymmetric Lanczos for linear systems with multiple right-hand sides.
• Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems
• Hybrid iterative refined method for computing a few extreme eigenpairs of a symmetric matrix
• TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems
• A Jacobi-Davidson type method for the product eigenvalue problem
• Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix
• Computing eigenvalues occurring in continuation methods with the Jacobi-Davidson QZ method
• Tuned preconditioners for inexact two-sided inverse and Rayleigh quotient iteration.
• JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
• A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc
• State-of-the-art eigensolvers for electronic structure calculations of large scale nano-systems
• On correction equations and domain decomposition for computing invariant subspaces
• A truncated-CG style method for symmetric generalized eigenvalue problems
• Two-sided and alternating Jacobi-Davidson
• Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems
• On convergence of the inexact Rayleigh quotient iteration with the Lanczos method used for solving linear systems
• An integrated Davidson and multigrid solution approach for very large scale symmetric eigenvalue problems
• The Jacobi-Davidson method
• A Golub-Kahan Davidson method for accurately computing a few singular triplets of large sparse matrices

Describes a project that uses

Uses Software

• ARPACK

This page was built for publication: Restarting techniques for the (Jacobi-)Davidson symmetric eigenvalue method

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