scientific article; zbMATH DE number 176177

MaRDI QIDQ4035281zbMATH OpenFDO

Authors J. Shanehchi, D. J. Evans

Publication date 18 May 1993

zbMATH Keywords

conjugate gradient algorithmeigenvectorsextreme eigenvaluesgeneralized eigenvalue problemiterative methodslarge sparse matricespreconditioningsuccessive overrelaxation

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50)

Review text

[For the entire collection see Zbl 0753.00013.] The authors study iterative methods suitable for the solution of the generalized eigenvalue problem for large sparse matrices. The methods of interest, i.e. successive overrelaxation and preconditioned methods, are those in which no change in the structure of the original matrices occurs, and which are suitable for the determination of the extreme eigenvalues and their corresponding eigenvectors. The advantage of the preconditioning approach becomes evident when coupled with the conjugate gradient algorithm whereby a powerful algorithm is revealed which copes adequately with this class of problems.

Recommendations

• scientific article; zbMATH DE number 278841
• Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems
• Publication:3212187
• Subspace iteration methods with preconditioning for eigenvalues of very large matrices
• Accelerated simultaneous iterations for large finite element eigenproblems

Cited in

(20)

• Preconditioned iterative methods for the large sparse symmetric eigenvalue problem
• On the approximate computation of extreme eigenvalues and the condition number of nonsingular matrices
• Large-scale complex eigenvalue problems
• Robust preconditioning of large, sparse, symmetric eigenvalue problems
• New iterative methods for generalized singular-value problems
• A prediction-correction dynamic method for large-scale generalized eigenvalue problems
• Preconditioned iterative methods for a class of nonlinear eigenvalue problems
• Successive eigenvalue relaxation: A new method for the generalized eigenvalue problem and convergence estimates
• scientific article; zbMATH DE number 4195040 (Why is no real title available?)
• scientific article; zbMATH DE number 3874487 (Why is no real title available?)
• Hybrid preconditioning for iterative diagonalization of ill-conditioned generalized eigenvalue problems in electronic structure calculations
• A simple iterative algorithm for generating selected eigenspaces of large matrices
• A fast hierarchically preconditioned eigensolver based on multiresolution matrix decomposition
• On an iterative method for finding lovver eigenvalues
• Sparse Hierarchical Preconditioners Using Piecewise Smooth Approximations of Eigenvectors
• Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
• scientific article; zbMATH DE number 278841 (Why is no real title available?)
• A comparison of eigensolvers for large-scale 3D modal analysis using AMG-preconditioned iterative methods
• Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. I. Extreme eigenvalues
• Preconditioned conjugate gradient method for the sparse generalized eigenvalue problem in electronic structure calculations

This page was built for publication:

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