Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems
- 1 April 1994
- journal article
- research article
- Published by Wiley in Concurrency: Practice and Experience
- Vol. 6 (2), 101-117
- https://doi.org/10.1002/cpe.4330060203
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Automatic partitioning of unstructured meshes for the parallel solution of problems in computational mechanicsInternational Journal for Numerical Methods in Engineering, 1993
- Large-step markov chains for the TSP incorporating local search heuristicsOperations Research Letters, 1992
- Performance of dynamic load balancing algorithms for unstructured mesh calculationsConcurrency: Practice and Experience, 1991
- Partitioning of unstructured problems for parallel processingComputing Systems in Engineering, 1991
- On the mapping of massively parallel processors onto finite element graphsComputers & Structures, 1989
- A multilevel variational method for Au = λBu on composite gridsJournal of Computational Physics, 1989
- A simple and efficient automatic fem domain decomposerComputers & Structures, 1988
- On Estimating the Largest Eigenvalue with the Lanczos AlgorithmMathematics of Computation, 1982
- A Mesh Refinement Method for Ax = λBxMathematics of Computation, 1981
- The Rayleigh quotient iteration and some generalizations for nonnormal matricesMathematics of Computation, 1974