On conjugate gradient-like methods for eigen-like problems

DOI10.1007/BF01731929MaRDI QIDQ1923871zbMATH OpenFDO

Authors Alan Edelman, Steven T. Smith

Publication date 20 May 1997

Published in BIT (Search for Journal in Brave)

zbMATH Keywords

signal processingsurvey paperNewton methoddifferential geometryLanczos methodelectronic structuresconjugate gradient-like methods

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(10)

• On extremum properties of orthogonal quotients matrices
• Unconstrained energy functionals for electronic structure calculations
• The use of bulk states to accelerate the band edge state calculation of a semiconductor quantum dot
• A globally and quadratically convergent algorithm with efficient implementation for unconstrained optimization
• Riemannian conjugate gradient methods: general framework and specific algorithms with convergence analyses
• scientific article; zbMATH DE number 4011778 (Why is no real title available?)
• Computing several eigenpairs of Hermitian problems by conjugate gradient iterations
• Polynomial chaos expansions on principal geodesic Grassmannian submanifolds for surrogate modeling and uncertainty quantification
• Iterative diagonalization of symmetric matrices in mixed precision and its application to electronic structure calculations
• scientific article; zbMATH DE number 741144 (Why is no real title available?)

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

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