In 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
AbstractDomain decomposition methods are designed to deal with coupled or transmission problems for ...
. For nonselfadjoint elliptic boundary value problem which are preconditioned by a substructuring me...
An iterative domain decomposition method is developed to solve a singular perturbation problem. The ...
In this paper we consider a nonsymmetric elliptic problem and we use the techniques related to the S...
AbstractIn this paper we consider a nonsymmetric elliptic problem and we use the techniques related ...
Abstract. The balancing domain decomposition methods by constraints are extended to solving nonsymme...
We propose a domain decomposition method for advection-diffusion-reaction equations based on Nitsch...
We propose a domain decomposition method for advection-diffusion-reaction equations based on Nitsche...
AbstractTwo families of non-overlapping coercive domain decomposition methods are proposed for the n...
: The aim of this paper is to study the convergence properties of a Time Marching Algorithm solving ...
. Domain decomposition methods provide powerful preconditioners for the iterative solution of the la...
New domain decomposition methods (DDM) based on optimal control approach are introduced for the coup...
AbstractIterative substructuring methods form an important family of domain decomposition algorithms...
Abstract. An optimal iterative method for solving systems of linear algebraic equations arising from...
Summary. For advection-diffusion problems we show that a non-overlapping do-main decomposition metho...
AbstractDomain decomposition methods are designed to deal with coupled or transmission problems for ...
. For nonselfadjoint elliptic boundary value problem which are preconditioned by a substructuring me...
An iterative domain decomposition method is developed to solve a singular perturbation problem. The ...
In this paper we consider a nonsymmetric elliptic problem and we use the techniques related to the S...
AbstractIn this paper we consider a nonsymmetric elliptic problem and we use the techniques related ...
Abstract. The balancing domain decomposition methods by constraints are extended to solving nonsymme...
We propose a domain decomposition method for advection-diffusion-reaction equations based on Nitsch...
We propose a domain decomposition method for advection-diffusion-reaction equations based on Nitsche...
AbstractTwo families of non-overlapping coercive domain decomposition methods are proposed for the n...
: The aim of this paper is to study the convergence properties of a Time Marching Algorithm solving ...
. Domain decomposition methods provide powerful preconditioners for the iterative solution of the la...
New domain decomposition methods (DDM) based on optimal control approach are introduced for the coup...
AbstractIterative substructuring methods form an important family of domain decomposition algorithms...
Abstract. An optimal iterative method for solving systems of linear algebraic equations arising from...
Summary. For advection-diffusion problems we show that a non-overlapping do-main decomposition metho...
AbstractDomain decomposition methods are designed to deal with coupled or transmission problems for ...
. For nonselfadjoint elliptic boundary value problem which are preconditioned by a substructuring me...
An iterative domain decomposition method is developed to solve a singular perturbation problem. The ...