A three-dimensional, nonsymmetric, domain decomposition algorithm is developed. The algorithm is based upon the use of a lower dimensional problem as a correction to the preconditioned generalized conjugate residual method using the domain decomposition technique as the overall preconditioner. For the finite difference solution of elliptic and parabolic partial differential equations with symmetric and nonsymmetric rough coefficients, the method is both robust and efficient. Three problems, including a highly heterogeneous example, an example from the SPE/SIAM comparative solution project, and a nonsymmetric parabolic reservoir simulation example, are presented to validate the method. Several comparisons are made with other well-known preco...
The domain decomposition strategies proposed in this thesis are efficient preconditioning techniques...
A non-intrusive proper generalized decomposition (PGD) strategy, coupled with an overlapping domain ...
A DD (domain decomposition) preconditioner of almost optimal in p arithmetical complexity is present...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/15...
AbstractTwo parallel domain decomposition procedures for solving initial-boundary value problems of ...
Two parallel non-overlapping domain decomposition algorithms for solving parabolic partial different...
We present three parallel solvers for parabolic equation. The solution methods, which are based on n...
AbstractThe idea of solving large problems using domain decomposition technique appears particularly...
In this paper we propose a substructuring preconditioner for solving three-dimensional elliptic equa...
La résolution numérique de problèmes de grande taille par des techniques de décomposition de domaine...
Projet MENUSINThe idea of solving large problems using domain decomposition techniques appears parti...
In this paper we review several methods for solving large sparse linear systems arising from discret...
Numerically solving elliptic partial differential equations for a large number of degrees of freedom...
A domain decomposition procedure for parabolic equations is described. In this procedure, the comput...
The purpose of this book is to offer an overview of the most popular domain decomposition methods fo...
The domain decomposition strategies proposed in this thesis are efficient preconditioning techniques...
A non-intrusive proper generalized decomposition (PGD) strategy, coupled with an overlapping domain ...
A DD (domain decomposition) preconditioner of almost optimal in p arithmetical complexity is present...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/15...
AbstractTwo parallel domain decomposition procedures for solving initial-boundary value problems of ...
Two parallel non-overlapping domain decomposition algorithms for solving parabolic partial different...
We present three parallel solvers for parabolic equation. The solution methods, which are based on n...
AbstractThe idea of solving large problems using domain decomposition technique appears particularly...
In this paper we propose a substructuring preconditioner for solving three-dimensional elliptic equa...
La résolution numérique de problèmes de grande taille par des techniques de décomposition de domaine...
Projet MENUSINThe idea of solving large problems using domain decomposition techniques appears parti...
In this paper we review several methods for solving large sparse linear systems arising from discret...
Numerically solving elliptic partial differential equations for a large number of degrees of freedom...
A domain decomposition procedure for parabolic equations is described. In this procedure, the comput...
The purpose of this book is to offer an overview of the most popular domain decomposition methods fo...
The domain decomposition strategies proposed in this thesis are efficient preconditioning techniques...
A non-intrusive proper generalized decomposition (PGD) strategy, coupled with an overlapping domain ...
A DD (domain decomposition) preconditioner of almost optimal in p arithmetical complexity is present...