Abstract A parallel algorithm based on the multidimensional minimization of the Rayleigh quotient is proposed to evaluate the 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) and by a number of block preconditioners. The resulting code obtains a high level of parallel efficiency and proves to be comparable with the PARPACK package on a set of large matrices arising from various discretizations of PDEs of elliptic/parabolic type
We exploit an optimization method, called DACG, which sequentially computes the smallest eigenpairs ...
The computation of the smallest eigenvalues and eigenvectors of large numerical problems is a very i...
2In this paper we propose an efficiently preconditioned Newton method for the computation of the lef...
3Abstract A parallel algorithm based on the multidimensional minimization of the Rayleigh quotient i...
A parallel algorithm based on the S-dimensional minimization of the Rayleigh quotient is proposed to...
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 present paper describes a parallel preconditioned algorithm for the solution of partial eigenval...
A preconditioned scheme for solving sparse symmetric eigenproblems is proposed. The solution strateg...
2We propose a parallel preconditioner for the Newton method in the computation of the leftmost eigen...
A preconditioned simultaneous iteration method is described for the solution of the generalized eige...
A parallel algorithm for the calculation of the p leftmost eigenpairs of large, sparse F.E.M. matric...
The choice of the preconditioner is a key factor to accelerate the convergence of eigensolvers for l...
A preconditioned scheme, DACG, is proposed for compute in parallel the leftmost eigenpairs of the ge...
The computation of the smallest eigenvalues and eigenvectors of large numerical problems is a very i...
We exploit an optimization method, called DACG, which sequentially computes the smallest eigenpairs ...
The computation of the smallest eigenvalues and eigenvectors of large numerical problems is a very i...
2In this paper we propose an efficiently preconditioned Newton method for the computation of the lef...
3Abstract A parallel algorithm based on the multidimensional minimization of the Rayleigh quotient i...
A parallel algorithm based on the S-dimensional minimization of the Rayleigh quotient is proposed to...
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 present paper describes a parallel preconditioned algorithm for the solution of partial eigenval...
A preconditioned scheme for solving sparse symmetric eigenproblems is proposed. The solution strateg...
2We propose a parallel preconditioner for the Newton method in the computation of the leftmost eigen...
A preconditioned simultaneous iteration method is described for the solution of the generalized eige...
A parallel algorithm for the calculation of the p leftmost eigenpairs of large, sparse F.E.M. matric...
The choice of the preconditioner is a key factor to accelerate the convergence of eigensolvers for l...
A preconditioned scheme, DACG, is proposed for compute in parallel the leftmost eigenpairs of the ge...
The computation of the smallest eigenvalues and eigenvectors of large numerical problems is a very i...
We exploit an optimization method, called DACG, which sequentially computes the smallest eigenpairs ...
The computation of the smallest eigenvalues and eigenvectors of large numerical problems is a very i...
2In this paper we propose an efficiently preconditioned Newton method for the computation of the lef...