Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices
DOI10.1016/S0045-7825(02)00457-7zbMATH Open1016.65013WikidataQ62925950 ScholiaQ62925950MaRDI QIDQ1871007FDOQ1871007
Publication date: 6 May 2003
Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)
Recommendations
- Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- The Jacobi-Davidson method
- Is Jacobi--Davidson Faster than Davidson?
- Implementation of a variable block Davidson method with deflation for solving large sparse eigenproblems
eigenvaluesnumerical examplesnumerical experimentsdiffusion equationfinite differenceiterative methodsfinite elementcomparison of methodsJacobi-Davidson methodLanczos methodlarge sparse matricessparse symmetric matricesdeflation accelerated conjugate gradient methodpartial eigenspectrum
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 difference methods for boundary value problems involving PDEs (65N06) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Cites Work
- ARPACK Users' Guide
- Templates for the Solution of Algebraic Eigenvalue Problems
- ILUT: A dual threshold incomplete LU factorization
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
- Numerical methods for large eigenvalue problems
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- Computational Variants of the Lanczos Method for the Eigenproblem
- Nested Iterations for Symmetric Eigenproblems
- Approximate inverse preconditioning in the parallel solution of sparse eigenproblems
- Preconditioned Gradient-Type Iterative Methods in a Subspace for Partial Generalized Symmetric Eigenvalue Problems
- Asymptotic Convergence of Conjugate Gradient Methods for the Partial Symmetric Eigenproblem
- Lanczos versus subspace iteration for solution of eigenvalue problems
- The Software Scene in the Extraction of Eigenvalues from Sparse Matrices
- Title not available (Why is that?)
- Parallel preconditioning of a sparse eigensolver
- An orthogonal accelerated deflation technique for large symmetric eigenproblems
Cited In (24)
- Spectral preconditioners for the efficient numerical solution of a continuous branched transport model
- RMCP: relaxed mixed constraint preconditioners for saddle point linear systems arising in geomechanics
- corr3p\_tr: a particle approach for the general three-body problem
- Generalized Block Tuned Preconditioners for SPD Eigensolvers
- Banded target matrices and recursive FSAI for parallel preconditioning
- Overlapping Schwarz preconditioned eigensolvers for spectral element discretizations
- Computing the smallest eigenpairs of the graph Laplacian
- Efficient parallel solution to large‐size sparse eigenproblems with block FSAI preconditioning
- ``Compress and Eliminate” Solver for Symmetric Positive Definite Sparse Matrices
- An Out-of-Core Eigen-Solver with OpenMP Parallel Scheme for Large Spare Damped System
- 3-D nested eigenanalysis on finite element grids
- Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems Under Limited Memory. Part II: Seeking Many Eigenvalues
- Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices
- Parallel Rayleigh quotient optimization with FSAI-based preconditioning
- Parallel matrix-free polynomial preconditioners with application to flow simulations in discrete fracture networks
- Model order reduction for meshfree solution of Poisson singularity problems
- Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
- Parallel Jacobi-Davidson with block FSAI preconditioning and controlled inner iterations.
- Efficiently preconditioned inexact Newton methods for large symmetric eigenvalue problems
- Parallel preconditioned conjugate gradient optimization of the Rayleigh quotient for the solution of sparse eigenproblems
- 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
- Fast and stable rational RBF-based partition of unity interpolation
- Rational RBF-based partition of unity method for efficiently and accurately approximating 3D objects
Uses Software
This page was built for publication: Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1871007)
