3A 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.nonenoneG. R. JOUBERT ET AL.; L. BERGAMASCHI; A. MARTINEZ; PINI G.Bergamaschi, L.; Martinez, A.; Pini, G
A preconditioned scheme, DACG, is proposed for compute in parallel the leftmost eigenpairs of the ge...
We exploit an optimization method, called DACG, which sequentially computes the smallest eigenpairs...
Rayleigh Quotient Minimization methods for the calculation of minimal eigenpair achieve great effici...
A parallel algorithm based on the S-dimensional minimization of the Rayleigh quotient is proposed to...
3Abstract A parallel algorithm based on the multidimensional minimization of the Rayleigh quotient i...
The present paper describes a parallel preconditioned algorithm for the solution of partial eigenval...
The choice of the preconditioner is a key factor to accelerate the convergence of eigensolvers for l...
The present paper describes a parallel preconditioned algorithm for the solution of partial eigenval...
2We propose a parallel preconditioner for the Newton method in the computation of the leftmost eigen...
We exploit an optimization method, called DACG, which sequentially computes the smallest eigenpairs ...
A parallel algorithm for the calculation of the p leftmost eigenpairs of large, sparse F.E.M. matric...
We exploit an optimization method, called deflation-accelerated conjugate gradient (DACG), which seq...
A preconditioned scheme for solving sparse symmetric eigenproblems is proposed. The solution strateg...
A preconditioned simultaneous iteration method is described for the solution of the generalized eige...
n this paper we analyze the parallel efficiency of the approximate inverse preconditioners AINV and ...
A preconditioned scheme, DACG, is proposed for compute in parallel the leftmost eigenpairs of the ge...
We exploit an optimization method, called DACG, which sequentially computes the smallest eigenpairs...
Rayleigh Quotient Minimization methods for the calculation of minimal eigenpair achieve great effici...
A parallel algorithm based on the S-dimensional minimization of the Rayleigh quotient is proposed to...
3Abstract A parallel algorithm based on the multidimensional minimization of the Rayleigh quotient i...
The present paper describes a parallel preconditioned algorithm for the solution of partial eigenval...
The choice of the preconditioner is a key factor to accelerate the convergence of eigensolvers for l...
The present paper describes a parallel preconditioned algorithm for the solution of partial eigenval...
2We propose a parallel preconditioner for the Newton method in the computation of the leftmost eigen...
We exploit an optimization method, called DACG, which sequentially computes the smallest eigenpairs ...
A parallel algorithm for the calculation of the p leftmost eigenpairs of large, sparse F.E.M. matric...
We exploit an optimization method, called deflation-accelerated conjugate gradient (DACG), which seq...
A preconditioned scheme for solving sparse symmetric eigenproblems is proposed. The solution strateg...
A preconditioned simultaneous iteration method is described for the solution of the generalized eige...
n this paper we analyze the parallel efficiency of the approximate inverse preconditioners AINV and ...
A preconditioned scheme, DACG, is proposed for compute in parallel the leftmost eigenpairs of the ge...
We exploit an optimization method, called DACG, which sequentially computes the smallest eigenpairs...
Rayleigh Quotient Minimization methods for the calculation of minimal eigenpair achieve great effici...