@Article{	  Zumbusch:2001*1,
  author	= {G. W. Zumbusch},
  title		= {On the Quality of Space-filling Curve Induced Partitions},
  journal	= {Z. Angew. Math. Mech.},
  volume	= 81,
  pages		= {25--28},
  note		= {Suppl. 1, also as report SFB 256, University Bonn, no.
		  674, 2000},
  institution	= {SFB 256, University Bonn},
  year		= {2001},
  annote	= {refereed,256C},
  ps		= {http://wissrech.ins.uni-bonn.de/research/pub/zumbusch/gamm00.ps.gz}
		  ,
  pdf		= {http://wissrech.ins.uni-bonn.de/research/pub/zumbusch/gamm00.pdf}
		  ,
  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
		  space-filling 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.}
}