A block preconditioned steepest descent method for symmetric eigenvalue problems

DOI10.1016/j.amc.2013.03.114zbMath1293.65055OpenAlexW2064174303MaRDI QIDQ2511691

Shuai Jian

Publication date: 6 August 2014

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2013.03.114

zbMATH Keywords

steepest descentasymptotic convergence factorpolynomial preconditionerblock preconditioned eigensolver

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Preconditioners for iterative methods (65F08)

Related Items (2)

A Filtered-Davidson Method for Large Symmetric Eigenvalue Problems ⋮ Rayleigh quotient minimization method for symmetric eigenvalue problems

Uses Software

• lobpcg.m

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of nested iteration schemes for linear systems with a coefficient matrix with a dominant positive definite symmetric part
• A subspace preconditioning algorithm for eigenvector/eigenvalue computation
• Approximating the inverse of a matrix for use in iterative algorithms on vector processors
• Simultaneous Rayleigh-quotient minimization methods for Ax=lambdaBx
• Conjugate gradient methods for the Rayleigh quotient minimization of generalized eigenvalue problems
• Sharp error bounds of some Krylov subspace methods for non-Hermitian linear systems
• Cluster robustness of preconditioned gradient subspace iteration eigensolvers
• A geometric theory for preconditioned inverse iteration applied to a subspace
• Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
• Polynomial Preconditioners for Conjugate Gradient Calculations
• Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
• The Geometry of Algorithms with Orthogonality Constraints
• The Davidson Method
• CONJUGATE GRADIENT METHODS FOR SOLVING THE SMALLEST EIGENPAIR OF LARGE SYMMETRIC EIGENVALUE PROBLEMS
• Asymptotic Convergence of Conjugate Gradient Methods for the Partial Symmetric Eigenproblem
• Sharp Convergence Estimates for the Preconditioned Steepest Descent Method for Hermitian Eigenvalue Problems

This page was built for publication: A block preconditioned steepest descent method for symmetric eigenvalue problems