AbstractIn this paper we consider a nonsymmetric elliptic problem and we use the techniques related to the Steklov–Poincaré operators to propose new substructuring iterative procedures. In particular, we propose two methods that generalize the well-known Neumann–Neumann and Dirichlet–Neumann iterative procedures. We prove that our methods, that use symmetric and positive-definite preconditioners, lead to the construction of iterative schemes with optimal convergence properties. Numerical results for the finite element discretization are given
AbstractParallel domain decomposition algorithms for the solution of singularly perturbed semilinear...
AbstractDomain decomposition methods are designed to deal with coupled or transmission problems for ...
Abstract. The purpose of this paper is to give a unified investigation of a class of nonoverlapping ...
In this paper we consider a nonsymmetric elliptic problem and we use the techniques related to the S...
Abstract. An optimal iterative method for solving systems of linear algebraic equations arising from...
AbstractIterative substructuring methods form an important family of domain decomposition algorithms...
. Domain decomposition methods provide powerful preconditioners for the iterative solution of the la...
. For nonselfadjoint elliptic boundary value problem which are preconditioned by a substructuring me...
Abstract. The balancing domain decomposition methods by constraints are extended to solving nonsymme...
In this paper we propose a substructuring preconditioner for solving three-dimensional elliptic equa...
. An optimal iterative method for solving systems of linear algebraic equations arising from nonconf...
We consider a Galerkin Finite Element approximation of the Stokes–Darcy problem which models the cou...
. The Neumann-Neumann algorithm is known to be an efficient domain decomposition preconditioner with...
We propose a domain decomposition method for advection-diffusion-reaction equations based on Nitsch...
AbstractIn this study we analyze a nonoverlapping domain decomposition method for the solution of el...
AbstractParallel domain decomposition algorithms for the solution of singularly perturbed semilinear...
AbstractDomain decomposition methods are designed to deal with coupled or transmission problems for ...
Abstract. The purpose of this paper is to give a unified investigation of a class of nonoverlapping ...
In this paper we consider a nonsymmetric elliptic problem and we use the techniques related to the S...
Abstract. An optimal iterative method for solving systems of linear algebraic equations arising from...
AbstractIterative substructuring methods form an important family of domain decomposition algorithms...
. Domain decomposition methods provide powerful preconditioners for the iterative solution of the la...
. For nonselfadjoint elliptic boundary value problem which are preconditioned by a substructuring me...
Abstract. The balancing domain decomposition methods by constraints are extended to solving nonsymme...
In this paper we propose a substructuring preconditioner for solving three-dimensional elliptic equa...
. An optimal iterative method for solving systems of linear algebraic equations arising from nonconf...
We consider a Galerkin Finite Element approximation of the Stokes–Darcy problem which models the cou...
. The Neumann-Neumann algorithm is known to be an efficient domain decomposition preconditioner with...
We propose a domain decomposition method for advection-diffusion-reaction equations based on Nitsch...
AbstractIn this study we analyze a nonoverlapping domain decomposition method for the solution of el...
AbstractParallel domain decomposition algorithms for the solution of singularly perturbed semilinear...
AbstractDomain decomposition methods are designed to deal with coupled or transmission problems for ...
Abstract. The purpose of this paper is to give a unified investigation of a class of nonoverlapping ...