On conjugate gradient-like methods for eigen-like problems

DOI10.1007/BF01731929zbMath0856.65037MaRDI QIDQ1923871

Alan Edelman, Steven T. Smith

Publication date: 20 May 1997

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

Lanczos methodNewton methodsurvey paperdifferential geometrysignal processingelectronic structuresconjugate gradient-like methods

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02)

Related Items (6)

Riemannian Conjugate Gradient Methods: General Framework and Specific Algorithms with Convergence Analyses ⋮ On extremum properties of orthogonal quotients matrices ⋮ The use of bulk states to accelerate the band edge state calculation of a semiconductor quantum dot ⋮ Iterative diagonalization of symmetric matrices in mixed precision and its application to electronic structure calculations ⋮ A globally and quadratically convergent algorithm with efficient implementation for unconstrained optimization ⋮ Unconstrained energy functionals for electronic structure calculations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Three methods for refining estimates of invariant subspaces
• In favor of conjugate directions: a generalized acceptable-point algorithm for function minimization
• New iterative methods for solution of the eigenproblem
• An iterative method for finding characteristic vectors of a symmetric matrix
• A survey of conjugate gradient algorithms for solution of extreme eigen-problems of a symmetric matrix
• Improving the Accuracy of Computed Eigenvalues and Eigenvectors
• Gradient-Type Algorithms for Partial Singular Value Decomposition
• Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
• A Trace Minimization Algorithm for the Generalized Eigenvalue Problem
• Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
• The simultaneous computation of a few of the algebraically largest and smallest eigenvalues of a large, sparse, symmetric matrix
• Gradient methods for finite-element eigenproblems.
• The computational efficiency of a new minimization algorithm for eigenvalue analysis
• Optimal gradient minimization scheme for finite element eigenproblems

This page was built for publication: On conjugate gradient-like methods for eigen-like problems