CONJUGATE GRADIENT METHODS FOR SOLVING THE SMALLEST EIGENPAIR OF LARGE SYMMETRIC EIGENVALUE PROBLEMS
From MaRDI portal
Publication:4349445
DOI<2209::AID-NME951>3.0.CO;2-R 10.1002/(SICI)1097-0207(19960715)39:13<2209::AID-NME951>3.0.CO;2-RzbMath0880.73074OpenAlexW2092320654MaRDI QIDQ4349445
Publication date: 24 August 1997
Full work available at URL: https://doi.org/10.1002/(sici)1097-0207(19960715)39:13<2209::aid-nme951>3.0.co;2-r
Related Items
Cluster robustness of preconditioned gradient subspace iteration eigensolvers, Block subspace projection preconditioned conjugate gradient method in modal structural analysis, Algorithms for recursive/semi-recursive bias-compensating least squares system identification within the errors-in-variables framework, Computing several eigenpairs of Hermitian problems by conjugate gradient iterations, Multilevel preconditioned iterative eigensolvers for Maxwell eigenvalue problems, A block preconditioned steepest descent method for symmetric eigenvalue problems, 3-D nested eigenanalysis on finite element grids, On the discrete dynamic nature of the conjugate gradient method, A geometric theory for preconditioned inverse iteration. I: Extrema of Rayleigh quotient, A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extreme eigenvalues of large sparse matrices by Rayleigh quotient and modified conjugate gradients
- An improved iterative optimization technique for the leftmost eigenpairs of large symmetric matrices
- Accelerated simultaneous iterations for large finite element eigenproblems
- Simultaneous Rayleigh-quotient minimization methods for Ax=lambdaBx
- An orthogonal accelerated deflation technique for large symmetric eigenproblems
- New iterative methods for solution of the eigenproblem
- The accelerated power method
- A comparison of Lanczos and optimization methods in the partial solution of sparse symmetric eigenproblems
