A parallel algorithm based on the S-dimensional minimization of the Rayleigh quotient is proposed to evaluate the s ~ S/2 leftmost eigenpairs of the generalized symmetric positive definite eigenproblem. The minimization is performed via a conjugate gradient-like procedure accelerated by a factorized approximate inverse preconditioner (FSAI). The resulting code attains a high level of parallel efficiency and reveals comparable with the PARPACK package on a set of large matrices.
Parallel solution of sparse eigenproblems by simultaneous Rayleigh quotient optimization with FSAI preconditioning / Bergamaschi, L., Martinez, A., Pini, G.. - STAMPA. - 13:(2004), pp. 275-282. [10.1016/S0927-5452(04)80037-6]
Parallel solution of sparse eigenproblems by simultaneous Rayleigh quotient optimization with FSAI preconditioning
A. MARTINEZ;
2004-01-01
Abstract
A parallel algorithm based on the S-dimensional minimization of the Rayleigh quotient is proposed to evaluate the s ~ S/2 leftmost eigenpairs of the generalized symmetric positive definite eigenproblem. The minimization is performed via a conjugate gradient-like procedure accelerated by a factorized approximate inverse preconditioner (FSAI). The resulting code attains a high level of parallel efficiency and reveals comparable with the PARPACK package on a set of large matrices.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
