The present paper describes a parallel preconditioned algorithm for the solution of partial eigenvalue problems for large sparse symmetric matrices, on parallel computers. Namely, we consider the Deflation-Accelerated Conjugate Gradient (DACG) algorithm accelerated by factorized-sparse-approximate-inverse- (FSAI-) type preconditioners. We present an enhanced parallel implementation of the FSAI preconditioner and make use of the recently developed Block FSAI-IC preconditioner, which combines the FSAI and the Block Jacobi-IC preconditioners. Results onto matrices of large size arising from finite element discretization of geomechanical models reveal that DACG accelerated by these type of preconditioners is competitive with respect to the avai...
We exploit an optimization method, called DACG, which sequentially computes the smallest eigenpairs...
The Factorized Sparse Approximate Inverse (FSAI) is an efficient technique for preconditioning paral...
Rayleigh Quotient Minimization methods for the calculation of minimal eigenpair achieve great effici...
The present paper describes a parallel preconditioned algorithm for the solution of partial eigenval...
We exploit an optimization method, called deflation-accelerated conjugate gradient (DACG), which seq...
The choice of the preconditioner is a key factor to accelerate the convergence of eigensolvers for l...
A parallel algorithm based on the S-dimensional minimization of the Rayleigh quotient is proposed to...
n this paper we analyze the parallel efficiency of the approximate inverse preconditioners AINV and ...
A preconditioned scheme for solving sparse symmetric eigenproblems is proposed. The solution strateg...
We exploit an optimization method, called DACG, which sequentially computes the smallest eigenpairs ...
Abstract A parallel algorithm based on the multidimensional minimization of the Rayleigh quotient is...
We propose a parallel preconditioner for the Newton method in the computation of the leftmost eigenp...
Preconditioning is a key factor to accelerate the convergence of sparse eigensolvers. The present co...
Factorized sparse approximate inverse (FSAI) preconditioners are robust algorithms for symmetric pos...
2In this paper we propose a parallel preconditioner for the CG solver based on successive applicatio...
We exploit an optimization method, called DACG, which sequentially computes the smallest eigenpairs...
The Factorized Sparse Approximate Inverse (FSAI) is an efficient technique for preconditioning paral...
Rayleigh Quotient Minimization methods for the calculation of minimal eigenpair achieve great effici...
The present paper describes a parallel preconditioned algorithm for the solution of partial eigenval...
We exploit an optimization method, called deflation-accelerated conjugate gradient (DACG), which seq...
The choice of the preconditioner is a key factor to accelerate the convergence of eigensolvers for l...
A parallel algorithm based on the S-dimensional minimization of the Rayleigh quotient is proposed to...
n this paper we analyze the parallel efficiency of the approximate inverse preconditioners AINV and ...
A preconditioned scheme for solving sparse symmetric eigenproblems is proposed. The solution strateg...
We exploit an optimization method, called DACG, which sequentially computes the smallest eigenpairs ...
Abstract A parallel algorithm based on the multidimensional minimization of the Rayleigh quotient is...
We propose a parallel preconditioner for the Newton method in the computation of the leftmost eigenp...
Preconditioning is a key factor to accelerate the convergence of sparse eigensolvers. The present co...
Factorized sparse approximate inverse (FSAI) preconditioners are robust algorithms for symmetric pos...
2In this paper we propose a parallel preconditioner for the CG solver based on successive applicatio...
We exploit an optimization method, called DACG, which sequentially computes the smallest eigenpairs...
The Factorized Sparse Approximate Inverse (FSAI) is an efficient technique for preconditioning paral...
Rayleigh Quotient Minimization methods for the calculation of minimal eigenpair achieve great effici...