In this paper we propose a substructuring preconditioner for solving three-dimensional elliptic equations with strongly discontinuous coefficients. The new preconditioner can be viewed as a variant of the classical substructuring preconditioner introduced in Bramble, Pasiack and Schatz (1989), with simpler coarse solvers. We will show that, although the preconditioned system may not have a good condition-number bound, the convergence rate of PCG method with this substructuring preconditioner is nearly optimal and also robust with possible large jumps of the coefficient in the elliptic equation. Key words: domain decomposition, coarse subspace, substructuring preconditioner, inexact solver, condition number Mathematics Subject Classification...
In this article we consider the application of Schwarz-type domain decomposition preconditioners for...
In this paper, we propose a domain decomposition method for multiscale second order elliptic partial...
Projet MENUSINThe idea of solving large problems using domain decomposition techniques appears parti...
In this paper we are concerned with non-overlapping domain decomposition methods for the second-orde...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/15...
In this paper we study some nonoverlapping domain decomposition methods for solving a class of ellip...
In this paper we are concerned with substructuring methods for the second-order elliptic problems in...
. Domain decomposition methods provide powerful preconditioners for the iterative solution of the la...
AbstractThe idea of solving large problems using domain decomposition technique appears particularly...
Abstract. We study a method for parallel solution of elliptic partial di erential equations which de...
The domain decomposition strategies proposed in this thesis are efficient preconditioning techniques...
Domain decomposition methods are, alongside multigrid methods, one of the dominant paradigms in cont...
A three-dimensional, nonsymmetric, domain decomposition algorithm is developed. The algorithm is bas...
A DD (domain decomposition) preconditioner of almost optimal in p arithmetical complexity is present...
. The Neumann-Neumann algorithm is known to be an efficient domain decomposition preconditioner with...
In this article we consider the application of Schwarz-type domain decomposition preconditioners for...
In this paper, we propose a domain decomposition method for multiscale second order elliptic partial...
Projet MENUSINThe idea of solving large problems using domain decomposition techniques appears parti...
In this paper we are concerned with non-overlapping domain decomposition methods for the second-orde...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/15...
In this paper we study some nonoverlapping domain decomposition methods for solving a class of ellip...
In this paper we are concerned with substructuring methods for the second-order elliptic problems in...
. Domain decomposition methods provide powerful preconditioners for the iterative solution of the la...
AbstractThe idea of solving large problems using domain decomposition technique appears particularly...
Abstract. We study a method for parallel solution of elliptic partial di erential equations which de...
The domain decomposition strategies proposed in this thesis are efficient preconditioning techniques...
Domain decomposition methods are, alongside multigrid methods, one of the dominant paradigms in cont...
A three-dimensional, nonsymmetric, domain decomposition algorithm is developed. The algorithm is bas...
A DD (domain decomposition) preconditioner of almost optimal in p arithmetical complexity is present...
. The Neumann-Neumann algorithm is known to be an efficient domain decomposition preconditioner with...
In this article we consider the application of Schwarz-type domain decomposition preconditioners for...
In this paper, we propose a domain decomposition method for multiscale second order elliptic partial...
Projet MENUSINThe idea of solving large problems using domain decomposition techniques appears parti...