Dedicated to Professor Ivo Marek on the occasion of his 70th birthday. A convergence theory is presented for a substructuring preconditioner based on constrained energy minimization concepts. The preconditioner is formulated as an Additive Schwarz method and analyzed by building on existing results for Balancing Domain Decomposition. The main result is a bound on the condition number based on inequalities involving the matrices of the preconditioner. Estimates of the usual form C(1 + log2(H/h)) are obtained under the standard assumptions of substructuring theory. Computational results demonstrating the performance of method are included
The classical convergence result for the additive Schwarz preconditioner with coarse grid is based o...
We investigate a two-level additive Schwarz domain decomposition preconditioner for a flat-top parti...
The balancing Neumann-Neumann (BNN) and the additive coarse grid correction (BPS) preconditioner are...
Optimized Schwarz methods form a class of domain decomposition al- gorithms in which the transmissio...
One level overlapping Schwarz domain decomposition preconditioners can be viewed as a generalization...
One level overlapping Schwarz domain decomposition preconditioners can be viewed as a generalization...
One level overlapping Schwarz domain decomposition preconditioners can be viewed as a generalization...
AbstractDomain decomposition methods for the solution of partial differential equations are attracti...
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...
The balancing domain decomposition (BDD) method is a well-known preconditioner due to its excellent ...
A simple variant of the BDDC preconditioner in which constraints are imposed on a selected set of su...
. The Neumann-Neumann algorithm is known to be an efficient domain decomposition preconditioner with...
summary:We generalize the overlapping Schwarz domain decomposition method to problems of linear elas...
The classical convergence result for the additive Schwarz preconditioner with coarse grid ...
The classical convergence result for the additive Schwarz preconditioner with coarse grid is based o...
We investigate a two-level additive Schwarz domain decomposition preconditioner for a flat-top parti...
The balancing Neumann-Neumann (BNN) and the additive coarse grid correction (BPS) preconditioner are...
Optimized Schwarz methods form a class of domain decomposition al- gorithms in which the transmissio...
One level overlapping Schwarz domain decomposition preconditioners can be viewed as a generalization...
One level overlapping Schwarz domain decomposition preconditioners can be viewed as a generalization...
One level overlapping Schwarz domain decomposition preconditioners can be viewed as a generalization...
AbstractDomain decomposition methods for the solution of partial differential equations are attracti...
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...
The balancing domain decomposition (BDD) method is a well-known preconditioner due to its excellent ...
A simple variant of the BDDC preconditioner in which constraints are imposed on a selected set of su...
. The Neumann-Neumann algorithm is known to be an efficient domain decomposition preconditioner with...
summary:We generalize the overlapping Schwarz domain decomposition method to problems of linear elas...
The classical convergence result for the additive Schwarz preconditioner with coarse grid ...
The classical convergence result for the additive Schwarz preconditioner with coarse grid is based o...
We investigate a two-level additive Schwarz domain decomposition preconditioner for a flat-top parti...
The balancing Neumann-Neumann (BNN) and the additive coarse grid correction (BPS) preconditioner are...