Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices
From MaRDI portal
Publication:1399640
DOI10.1016/S0021-9991(03)00190-6zbMath1022.65037MaRDI QIDQ1399640
Giorgio Pini, Flavio Sartoretto, Luca Bergamaschi
Publication date: 30 July 2003
Published in: Journal of Computational Physics (Search for Journal in Brave)
performance; convergence; eigenvalues; preconditioning; parallel algorithms; Jacobi-Davidson method; approximate inverse preconditioners; sparse approximate inverses; large, sparse matrices; paralell algorithms
65F50: Computational methods for sparse matrices
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
65F35: Numerical computation of matrix norms, conditioning, scaling
65Y05: Parallel numerical computation
Related Items
A numerical experimental study of inverse preconditioning for the parallel iterative solution to 3D finite element flow equations, Parallel preconditioned conjugate gradient optimization of the Rayleigh quotient for the solution of sparse eigenproblems, 3-D nested eigenanalysis on finite element grids, The Jacobi-Davidson method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Accelerated simultaneous iterations for large finite element eigenproblems
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Inexact Newton preconditioning techniques for large symmetric eigenvalue problems
- Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems
- Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices
- A Scalable Parallel Algorithm for Incomplete Factor Preconditioning
- SOLVING SPARSE TRIANGULAR LINEAR SYSTEMS ON PARALLEL COMPUTERS
- The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Factorized Sparse Approximate Inverse Preconditionings I. Theory
- 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
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- A Priori Sparsity Patterns for Parallel Sparse Approximate Inverse Preconditioners
- Templates for the Solution of Algebraic Eigenvalue Problems
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
- Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
- The convergence of Jacobi–Davidson iterations for Hermitian eigenproblems
- Solution methods for eigenvalue problems in structural mechanics
- Computational Variants of the Lanczos Method for the Eigenproblem
- Parallel preconditioning of a sparse eigensolver
- Parallel incomplete factorizations with pseudo-overlapped subdomains
