Comparative efficiencies of domain decompositions
- 1 November 1995
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 21 (11) , 1823-1835
- https://doi.org/10.1016/0167-8191(95)00031-7
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Message passing on the Meiko CS-2Parallel Computing, 1994
- The communication challenge for MPP: Intel Paragon and Meiko CS-2Parallel Computing, 1994
- Parallel efficiency of domain decomposition methodsParallel Computing, 1993
- Mesh partitioning algorithms for the parallel solution of partial differential equationsApplied Numerical Mathematics, 1993
- Partitioning Sparse Matrices with Eigenvectors of GraphsSIAM Journal on Matrix Analysis and Applications, 1990
- On estimating the largest eigenvalue with the Lanczos algorithmMathematics of Computation, 1982
- Estimating the Largest Eigenvalue of a Positive Definite MatrixMathematics of Computation, 1979
- An Implementation of a Pseudoperipheral Node FinderACM Transactions on Mathematical Software, 1979
- Bandwidth reduction by automatic renumberingInternational Journal for Numerical Methods in Engineering, 1973
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970