Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices

DOI10.1016/S0045-7825(02)00457-7zbMath1016.65013WikidataQ62925950 ScholiaQ62925950MaRDI QIDQ1871007

Luca Bergamaschi, Mario Putti

Publication date: 6 May 2003

Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)

zbMATH Keywords

comparison of methodsnumerical exampleseigenvaluesnumerical experimentsLanczos methoddiffusion equationfinite elementiterative methodsfinite differenceJacobi-Davidson methodlarge sparse matricessparse symmetric matricesdeflation accelerated conjugate gradient methodpartial eigenspectrum

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Finite difference methods for boundary value problems involving PDEs (65N06)

Related Items

corr3p\_tr: a particle approach for the general three-body problem, Efficiently preconditioned inexact Newton methods for large symmetric eigenvalue problems, Parallel matrix-free polynomial preconditioners with application to flow simulations in discrete fracture networks, Model order reduction for meshfree solution of Poisson singularity problems, Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices, Spectral preconditioners for the efficient numerical solution of a continuous branched transport model, Overlapping Schwarz preconditioned eigensolvers for spectral element discretizations, Parallel Rayleigh quotient optimization with FSAI-based preconditioning, Fast and stable rational RBF-based partition of unity interpolation, Generalized Block Tuned Preconditioners for SPD Eigensolvers, Computing the smallest eigenpairs of the graph Laplacian, Rational RBF-based partition of unity method for efficiently and accurately approximating 3D objects, Banded target matrices and recursive FSAI for parallel preconditioning, RMCP: relaxed mixed constraint preconditioners for saddle point linear systems arising in geomechanics, Efficient parallel solution to large‐size sparse eigenproblems with block FSAI preconditioning, Parallel preconditioned conjugate gradient optimization of the Rayleigh quotient for the solution of sparse eigenproblems, An Out-of-Core Eigen-Solver with OpenMP Parallel Scheme for Large Spare Damped System, Parallel Jacobi-Davidson with block FSAI preconditioning and controlled inner iterations, Tuned preconditioners for the eigensolution of large SPD matrices arising in engineering problems, A solution procedure for constrained eigenvalue problems and its application within the structural finite-element code NOSA-ITACA

Uses Software

• JDQR
• ARPACK
• JDQZ
• ILUT

Cites Work

• Unnamed Item
• Unnamed Item
• Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
• An orthogonal accelerated deflation technique for large symmetric eigenproblems
• Approximate inverse preconditioning in the parallel solution of sparse eigenproblems
• Lanczos versus subspace iteration for solution of eigenvalue problems
• The Software Scene in the Extraction of Eigenvalues from Sparse Matrices
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• Preconditioned Gradient-Type Iterative Methods in a Subspace for Partial Generalized Symmetric Eigenvalue Problems
• Nested Iterations for Symmetric Eigenproblems
• Asymptotic Convergence of Conjugate Gradient Methods for the Partial Symmetric Eigenproblem
• ARPACK Users' Guide
• Templates for the Solution of Algebraic Eigenvalue Problems
• Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
• ILUT: A dual threshold incomplete LU factorization
• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
• A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
• Computational Variants of the Lanczos Method for the Eigenproblem
• Parallel preconditioning of a sparse eigensolver