Parallel efficiency of domain decomposition methods
- 1 December 1993
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 19 (12), 1375-1391
- https://doi.org/10.1016/0167-8191(93)90082-v
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The alternating schwarz method applied to some biharmonic variational inequalitiesCalcolo, 1990
- Efficiency of some parallel numerical algorithms on distributed systemsParallel Computing, 1989
- Data communication in parallel architecturesParallel Computing, 1989
- A Comparison of Domain Decomposition Techniques for Elliptic Partial Differential Equations and their Parallel ImplementationSIAM Journal on Scientific and Statistical Computing, 1987
- Matrix algorithms on a hypercube I: Matrix multiplicationParallel Computing, 1987
- The construction of preconditioners for elliptic problems by substructuring. IIMathematics of Computation, 1987
- An iterative method for elliptic problems on regions partitioned into substructuresMathematics of Computation, 1986
- The construction of preconditioners for elliptic problems by substructuring. IMathematics of Computation, 1986
- Polynomial Preconditioners for Conjugate Gradient CalculationsSIAM Journal on Numerical Analysis, 1983
- The Methods of Cyclic Reduction, Fourier Analysis and the FACR Algorithm for the Discrete Solution of Poisson’s Equation on a RectangleSIAM Review, 1977