We propose and study an iterative substructuring method for an $$h$$h-$$p$$p Nitsche-type discretization, following the original approach introduced in Bramble et al. Math. Comp. 47(175):103–134, (1986) for conforming methods. We prove quasi-optimality with respect to the mesh size and the polynomial degree for the proposed preconditioner. Numerical experiments assess the performance of the preconditioner and verify the theory
The balancing Neumann-Neumann (BNN) and the additive coarse grid correction (BPS) preconditioner are...
AbstractDomain decomposition methods for the solution of partial differential equations are attracti...
In the classical Schwarz framework for conforming approximations of non-symmetric and indefinite pro...
We propose and study an iterative substructuring method for an $$h$$h-$$p$$p Nitsche-type discretiza...
We propose and study an iterative substructuring method for an h-p Nitsche-type discretization, foll...
International audienceWe build and analyze a substructuring preconditioner for the mortar method in ...
This thesis investigates domain decomposition methods, commonly classified as either overlapping Sch...
We analyse a class of preconditioners for the Mortar Method, based on substructuring. After splittin...
We study an iterative substructuring algorithm for a C interior penalty method for the biharmonic p...
A DD (domain decomposition) preconditioner of almost optimal in p arithmetical complexity is present...
. The p-version finite element method for linear, second order elliptic equations in an arbitrary, s...
We study a class of preconditioners based on substructuring, for the discrete Steklov-Poincare\u27 o...
We develop a balancing domain decomposition by constraints preconditioner for a weakly over-penalize...
. Domain decomposition methods provide powerful preconditioners for the iterative solution of the la...
Abstract. The balancing Neumann-Neumann (BNN) and the additive coarse grid correction (BPS) precondi...
The balancing Neumann-Neumann (BNN) and the additive coarse grid correction (BPS) preconditioner are...
AbstractDomain decomposition methods for the solution of partial differential equations are attracti...
In the classical Schwarz framework for conforming approximations of non-symmetric and indefinite pro...
We propose and study an iterative substructuring method for an $$h$$h-$$p$$p Nitsche-type discretiza...
We propose and study an iterative substructuring method for an h-p Nitsche-type discretization, foll...
International audienceWe build and analyze a substructuring preconditioner for the mortar method in ...
This thesis investigates domain decomposition methods, commonly classified as either overlapping Sch...
We analyse a class of preconditioners for the Mortar Method, based on substructuring. After splittin...
We study an iterative substructuring algorithm for a C interior penalty method for the biharmonic p...
A DD (domain decomposition) preconditioner of almost optimal in p arithmetical complexity is present...
. The p-version finite element method for linear, second order elliptic equations in an arbitrary, s...
We study a class of preconditioners based on substructuring, for the discrete Steklov-Poincare\u27 o...
We develop a balancing domain decomposition by constraints preconditioner for a weakly over-penalize...
. Domain decomposition methods provide powerful preconditioners for the iterative solution of the la...
Abstract. The balancing Neumann-Neumann (BNN) and the additive coarse grid correction (BPS) precondi...
The balancing Neumann-Neumann (BNN) and the additive coarse grid correction (BPS) preconditioner are...
AbstractDomain decomposition methods for the solution of partial differential equations are attracti...
In the classical Schwarz framework for conforming approximations of non-symmetric and indefinite pro...