Parallel preconditioned conjugate gradient optimization of the Rayleigh quotient for the solution of sparse eigenproblems

DOI10.1016/j.amc.2005.09.015zbMath1093.65036OpenAlexW2026977080MaRDI QIDQ2493739

Giorgio Pini, Àngeles Martínez, Luca Bergamaschi

Publication date: 16 June 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.09.015

zbMATH Keywords

numerical examplesparallel computationsparse matrixinverse preconditionerblock preconditionersconjugate gradient-like proceduregeneralized symmetric positive definite eigenproblemleftmost eigenpairsminimization of the Rayleigh quotient

Mathematics Subject Classification ID

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

Related Items

Shifted FSAI preconditioners for the efficient parallel solution of non-linear groundwater flow models ⋮ Overlapping Schwarz preconditioned eigensolvers for spectral element discretizations ⋮ Robust dropping criteria for F-norm minimization based sparse approximate inverse preconditioning ⋮ Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives ⋮ A robust adaptive algebraic multigrid linear solver for structural mechanics ⋮ Computing several eigenpairs of Hermitian problems by conjugate gradient iterations ⋮ Efficient parallel solution to large‐size sparse eigenproblems with block FSAI preconditioning ⋮ Parallel Jacobi-Davidson with block FSAI preconditioning and controlled inner iterations

Uses Software

• LAPACK
• P-SPARSLIB
• ARPACK
• JDCG

Cites Work

• Accelerated simultaneous iterations for large finite element eigenproblems
• Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
• A parallel algorithm for the partial eigensolution of sparse symmetric matrices on the CRAY Y-MP
• A comparative study of sparse approximate inverse preconditioners
• Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices
• Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices
• A Scalable Parallel Algorithm for Incomplete Factor Preconditioning
• Approximate inverse preconditioning in the parallel solution of sparse eigenproblems
• Factorized sparse approximate inverse preconditionings. IV: Simple approaches to rising efficiency
• Factorized Sparse Approximate Inverse Preconditionings I. Theory
• Mixed finite elements and Newton-type linearizations for the solution of Richards' equation
• Preconditioned Gradient-Type Iterative Methods in a Subspace for Partial Generalized Symmetric Eigenvalue Problems
• Parallel Preconditioning with Sparse Approximate Inverses
• Asymptotic Convergence of Conjugate Gradient Methods for the Partial Symmetric Eigenproblem
• Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
• New convergence results and preconditioning strategies for the conjugate gradient method
• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
• A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
• Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
• A comparison of eigensolvers for large-scale 3D modal analysis using AMG-preconditioned iterative methods
• Computational Variants of the Lanczos Method for the Eigenproblem
• Parallel incomplete factorizations with pseudo-overlapped subdomains
• Unnamed Item
• Unnamed Item