Abstract
In the previous chapter we have developed and proposed a parallel adaptive multigrid method. We were able to prove asymptotic parallel efficiency for mesh partitions created by space-filling curves. The proofs were based on the locality preserving properties of the curves. We also showed some numerical evidence that the cut sizes of the dual graphs of the meshes were indeed bounded. Now we want to verify the results for the whole parallel adaptive multigrid code experimentally. For this purpose we study several test problems on a variety of parallel computers. In order to demonstrate scalability of the algorithms, we use even some of the world’s largest parallel computers, where we were able to run computations on up to 1024 processors.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 B. G. Teubner Verlag / GWV Fachverlage GmbH, Wiesbaden
About this chapter
Cite this chapter
Zumbusch, G. (2003). Numerical Applications. In: Parallel Multilevel Methods. Advances in Numerical Mathematics. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-322-80063-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-322-80063-3_6
Publisher Name: Vieweg+Teubner Verlag
Print ISBN: 978-3-519-00451-6
Online ISBN: 978-3-322-80063-3
eBook Packages: Springer Book Archive