AbstractA method for simultaneous solution of large and sparse linearized equation sets and the corresponding eigenvalue problems is presented. Such problems arise from the discretization and the solution of nonlinear problems with the finite element method and Newton iteration. The method is based on a parallel version of the preconditioned GMRES(m) by deflation. The parallel code exploits the architecture of the computational clusters using the MPI (Message Passing Interface). The convergence rate, the parallel speedup and the memory requirements of the proposed method are reported and evaluated
An acceleratedsimultaneousiteration method is presented for the solution of the generalized eigenpro...
The Flexible Generalized Minimal Residual method (FGMRES) is an attractive iterative solver for non-...
The paper describes solution of large scale linear systems arising from finite element analysis by p...
AbstractWe present a parallel hybrid asynchronous method to solve large sparse linear systems by the...
The paper deals with parallel approach for the numerical solution of large, sparse, non-symmetric sy...
Linearization of the non-linear systems arising from fully implicit schemes in computational fluid...
We present parallel preconditioned solvers to compute a few extreme eigenvalues and vectors of large...
An accelerated simultaneous iteration method is presented for the solution of the generalized eigenp...
International audienceGrid computing focuses on making use of a very large amount of resources from ...
AbstractThe Flexible Generalized Minimal Residual method (FGMRES) is an attractive iterative solver ...
The GMRES iterative method is widely used as Krylov subspace accelerator for solving sparse linear s...
Three multigrid algorithms are described that can solve the symmetric generalized eigenvalue problem...
Parallelizable numerical methods for solving large scale DAE systems are developed at the level of d...
ABSTRACT: This paper presents a parallel implementation of the implicitly restarted Lanc-zos method ...
A parallel solver based on domain decomposition is presented for the solution of large algebraic sys...
An acceleratedsimultaneousiteration method is presented for the solution of the generalized eigenpro...
The Flexible Generalized Minimal Residual method (FGMRES) is an attractive iterative solver for non-...
The paper describes solution of large scale linear systems arising from finite element analysis by p...
AbstractWe present a parallel hybrid asynchronous method to solve large sparse linear systems by the...
The paper deals with parallel approach for the numerical solution of large, sparse, non-symmetric sy...
Linearization of the non-linear systems arising from fully implicit schemes in computational fluid...
We present parallel preconditioned solvers to compute a few extreme eigenvalues and vectors of large...
An accelerated simultaneous iteration method is presented for the solution of the generalized eigenp...
International audienceGrid computing focuses on making use of a very large amount of resources from ...
AbstractThe Flexible Generalized Minimal Residual method (FGMRES) is an attractive iterative solver ...
The GMRES iterative method is widely used as Krylov subspace accelerator for solving sparse linear s...
Three multigrid algorithms are described that can solve the symmetric generalized eigenvalue problem...
Parallelizable numerical methods for solving large scale DAE systems are developed at the level of d...
ABSTRACT: This paper presents a parallel implementation of the implicitly restarted Lanc-zos method ...
A parallel solver based on domain decomposition is presented for the solution of large algebraic sys...
An acceleratedsimultaneousiteration method is presented for the solution of the generalized eigenpro...
The Flexible Generalized Minimal Residual method (FGMRES) is an attractive iterative solver for non-...
The paper describes solution of large scale linear systems arising from finite element analysis by p...