Parallel complexity of domain decomposition methods and optimal coarse grid size
- 1 July 1995
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 21 (7) , 1033-1049
- https://doi.org/10.1016/0167-8191(95)00009-d
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Efficient Variants of the Vertex Space Domain Decomposition AlgorithmSIAM Journal on Scientific Computing, 1994
- Domain Decomposition Algorithms with Small OverlapSIAM Journal on Scientific Computing, 1994
- Parallel efficiency of domain decomposition methodsParallel Computing, 1993
- Domain Decomposition with Local Mesh RefinementSIAM Journal on Scientific and Statistical Computing, 1992
- An Optimal Domain Decomposition Preconditioner for the Finite Element Solution of Linear Elasticity ProblemsSIAM Journal on Scientific and Statistical Computing, 1992
- A domain decomposition algorithm for elliptic problems in three dimensionsNumerische Mathematik, 1991
- Convergence estimates for product iterative methods with applications to domain decompositionMathematics of Computation, 1991
- Iterative solvers by substructuring for the p-version finite element methodComputer Methods in Applied Mechanics and Engineering, 1990
- Data communication in parallel architecturesParallel Computing, 1989
- The construction of preconditioners for elliptic problems by substructuring. IMathematics of Computation, 1986