Add to ORKGA preconditioned scheme, DACG, is proposed for compute in parallel the leftmost eigenpairs of the generalized eigenproblem, by minimizing the Raileigh quotient
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...
This paper is concerned with the computation of the minimal eigenpair of the generalized eigen-probl...
A preconditioned scheme for solving sparse symmetric eigenproblems is proposed. The solution strateg...
n this paper we analyze the parallel efficiency of the approximate inverse preconditioners AINV and ...
We exploit an optimization method, called DACG, which sequentially computes the smallest eigenpairs ...
We exploit an optimization method, called deflation-accelerated conjugate gradient (DACG), which seq...
Abstract A parallel algorithm based on the multidimensional minimization of the Rayleigh quotient is...
A parallel algorithm based on the S-dimensional minimization of the Rayleigh quotient is proposed to...
We exploit an optimization method, called DACG, which sequentially computes the smallest eigenpairs...
We report about our analysis of an optimization method, called DACG (Deflation-Accelerated Conju...
A new metod (NI-DACG) for the partial eigensolution of large sparse symmetric FE eigenproblems is pr...
The present paper describes a parallel preconditioned algorithm for the solution of partial eigenval...
The present paper describes a parallel preconditioned algorithm for the solution of partial eigenval...
An efficient parallel approach for the computation of the eigenvalue of smallest absolute magnitude ...
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...
This paper is concerned with the computation of the minimal eigenpair of the generalized eigen-probl...
A preconditioned scheme for solving sparse symmetric eigenproblems is proposed. The solution strateg...
n this paper we analyze the parallel efficiency of the approximate inverse preconditioners AINV and ...
We exploit an optimization method, called DACG, which sequentially computes the smallest eigenpairs ...
We exploit an optimization method, called deflation-accelerated conjugate gradient (DACG), which seq...
Abstract A parallel algorithm based on the multidimensional minimization of the Rayleigh quotient is...
A parallel algorithm based on the S-dimensional minimization of the Rayleigh quotient is proposed to...
We exploit an optimization method, called DACG, which sequentially computes the smallest eigenpairs...
We report about our analysis of an optimization method, called DACG (Deflation-Accelerated Conju...
A new metod (NI-DACG) for the partial eigensolution of large sparse symmetric FE eigenproblems is pr...
The present paper describes a parallel preconditioned algorithm for the solution of partial eigenval...
The present paper describes a parallel preconditioned algorithm for the solution of partial eigenval...
An efficient parallel approach for the computation of the eigenvalue of smallest absolute magnitude ...
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...
This paper is concerned with the computation of the minimal eigenpair of the generalized eigen-probl...