Add to ORKGA preconditioner for iterative solution of the interface problem in Schur Complement Domain Decomposition Methods is presented. This preconditioner is based on solving a problem in a narrow strip around the interface. It requires much less memory and computing time than classical Neumann-Neumann preconditioner and its variants, and handles correctly the flux splitting among subdomains that share the interface. The performance of this preconditioner is assessed with an analytical study of Schur complement matrix eigenvalues. Results in a production parallel finite element code are given in a companion paper [1].Fil: Storti, Mario Alberto. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Sant...
This paper is devoted to the fast solution of interface concentrated finite element equations. The i...
A parallel iterative algorithm is described for efficient solution of the Schur complement (interfac...
AbstractThe idea of solving large problems using domain decomposition technique appears particularly...
In this paper, the efficiency of a parallelizable preconditioner for domain decomposition methodsin ...
In this paper we consider domain decomposition preconditioners based on a vertex-oriented (VO) decom...
A preconditioner for iterative solution of the interface problem in Schur Complement Domain Decompos...
This paper presents a new approach to construct preconditioners for the domain decomposition-based p...
Abstract. In the preconditioned iterative method based on nonoverlapping domain decompo-sitions, the...
This work documents two contributions to the parallel resolution of large systems of equations resul...
We present two new variants of Schur complement domain decomposition preconditioners suitable for 2D...
We present numerical methods for solving systems of linear equations originated from the discretisat...
We consider additive two-level preconditioners, with a local and a global component, for the Schur c...
The domain decomposition strategies proposed in this thesis are efficient preconditioning techniques...
AbstractDomain decomposition methods for the solution of partial differential equations are attracti...
A parallel solver based on domain decomposition is presented for the solution of large algebraic sys...
This paper is devoted to the fast solution of interface concentrated finite element equations. The i...
A parallel iterative algorithm is described for efficient solution of the Schur complement (interfac...
AbstractThe idea of solving large problems using domain decomposition technique appears particularly...
In this paper, the efficiency of a parallelizable preconditioner for domain decomposition methodsin ...
In this paper we consider domain decomposition preconditioners based on a vertex-oriented (VO) decom...
A preconditioner for iterative solution of the interface problem in Schur Complement Domain Decompos...
This paper presents a new approach to construct preconditioners for the domain decomposition-based p...
Abstract. In the preconditioned iterative method based on nonoverlapping domain decompo-sitions, the...
This work documents two contributions to the parallel resolution of large systems of equations resul...
We present two new variants of Schur complement domain decomposition preconditioners suitable for 2D...
We present numerical methods for solving systems of linear equations originated from the discretisat...
We consider additive two-level preconditioners, with a local and a global component, for the Schur c...
The domain decomposition strategies proposed in this thesis are efficient preconditioning techniques...
AbstractDomain decomposition methods for the solution of partial differential equations are attracti...
A parallel solver based on domain decomposition is presented for the solution of large algebraic sys...
This paper is devoted to the fast solution of interface concentrated finite element equations. The i...
A parallel iterative algorithm is described for efficient solution of the Schur complement (interfac...
AbstractThe idea of solving large problems using domain decomposition technique appears particularly...