Back to Search
Start Over
Efficient parallel solution to large-size sparse eigenproblems with block FSAI preconditioning.
- Source :
-
Numerical Linear Algebra with Applications . Oct2012, Vol. 19 Issue 5, p797-815. 19p. - Publication Year :
- 2012
-
Abstract
- SUMMARY The choice of the preconditioner is a key factor to accelerate the convergence of eigensolvers for large-size sparse eigenproblems. Although incomplete factorizations with partial fill-in prove generally effective in sequential computations, the efficient preconditioning of parallel eigensolvers is still an open issue. The present paper describes the use of block factorized sparse approximate inverse (BFSAI) preconditioning for the parallel solution of large-size symmetric positive definite eigenproblems with both a simultaneous Rayleigh quotient minimization and the Jacobi-Davidson algorithm. BFSAI coupled with a block diagonal incomplete decomposition proves a robust and efficient parallel preconditioner in a number of test cases arising from the finite element discretization of 3D fluid-dynamical and mechanical engineering applications, outperforming FSAI even by a factor of 8 and exhibiting a satisfactory scalability. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 10705325
- Volume :
- 19
- Issue :
- 5
- Database :
- Academic Search Index
- Journal :
- Numerical Linear Algebra with Applications
- Publication Type :
- Academic Journal
- Accession number :
- 80126233
- Full Text :
- https://doi.org/10.1002/nla.813