Download:
|
by Gerhard Zumbusch
Z. Angew. Math. Mech. 81, Supplement
http://wissrech.iam.uni-bonn.de/research/pub/zumbusch/gamm00.ps.gz
Add To MetaCart
Abstract:
The solution of partial differential equations on a parallel computer is usually done by a domain decomposition approach. The mesh is split into several partitions mapped onto the processors. However, partitioning of unstructured meshes and adaptive refined meshes in general is an NP-hard problem and heuristics are used. In this paper spacefilling curve based partition methods are analysed and bounds for the quality of the partitions are given. Furthermore estimates for parallel numerical algorithms such as multigrid and wavelet methods on these partitions are derived.
Citations
|
414
|
Partitioning sparse matrices with eigenvectors of graphs
– Pothen, Simon, et al.
- 1990
|
|
53
|
Sparse grids
– Zenger
- 1990
|
|
50
|
Parallele Adaptive Mehrgitterverfahren
– Bastian
- 1996
|
|
43
|
A Portable Parallel Particle Program
– Warren, Salmon
- 1995
|
|
31
|
Problem decomposition for adaptive hp finite element methods
– Patra, Oden
- 1995
|
|
13
|
Partitioning with spacefilling curves
– Pilkington, Baden
- 1994
|
|
9
|
Parallel adaptive subspace correction schemes with applications to elasticity
– Griebel, Zumbusch
- 1999
|
|
8
|
Recursive 3D mesh indexing with improved locality
– Chochia, Cole
- 1997
|
|
8
|
A key based parallel adaptive refinement technique for finite element methods
– Roberts, Kalyanasundaram, et al.
- 1998
|
|
8
|
Topological matching
– Stout
- 1983
|
|
7
|
A parallel tree code
– Dubinski
- 1996
|
|
7
|
Partitioning and mapping adaptive multigrid hierarchies on distributed memory computers
– Keyser, Roose
- 1992
|
|
3
|
Interleave in peace, or interleave in pieces
– Beichl, Sullivan
- 1998
|
|
2
|
Combinatorial inequalities and smoothness of functions
– Garsia
- 1976
|
|
1
|
Concurrency - Practice and Experience
– Karypis, Kumar
|