Efficient parallel solution to large‐size sparse eigenproblems with block FSAI preconditioning
DOI10.1002/nla.813zbMath1274.65106OpenAlexW1807060212MaRDI QIDQ4924932
Carlo Janna, Massimiliano Ferronato, Giorgio Pini
Publication date: 10 June 2013
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.813
numerical resultseigenvalueparallel computationsparse approximate inverseJacobi-Davidsonparallel preconditionerSPD matrices
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05) Preconditioners for iterative methods (65F08)
Related Items (7)
Uses Software
Cites Work
- A comparison of projective and direct solvers for finite elements in elastostatics
- An improved iterative optimization technique for the leftmost eigenpairs of large symmetric matrices
- Accelerated simultaneous iterations for large finite element eigenproblems
- A class of iterative methods for finite element equations
- Inexact Newton preconditioning techniques for large symmetric eigenvalue problems
- Approximate sparsity patterns for the inverse of a matrix and preconditioning
- 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 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
- Mixed constraint preconditioning in computational contact mechanics
- Approximate inverse preconditioning in the parallel solution of sparse eigenproblems
- Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
- A Block FSAI-ILU Parallel Preconditioner for Symmetric Positive Definite Linear Systems
- Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc
- Factorized Sparse Approximate Inverse Preconditionings I. Theory
- 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
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- Crout Versions of ILU for General Sparse Matrices
- A Priori Sparsity Patterns for Parallel Sparse Approximate Inverse Preconditioners
- New convergence results and preconditioning strategies for the conjugate gradient method
- ILUT: A dual threshold incomplete LU factorization
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
- The convergence of Jacobi–Davidson iterations for Hermitian eigenproblems
- Parallel preconditioning of a sparse eigensolver
This page was built for publication: Efficient parallel solution to large‐size sparse eigenproblems with block FSAI preconditioning
