Abstract
In this chapter we present the parallelization of our multilevel partition of unity method [57]. Our parallelization follows the data decomposition approach. Here, the main ingredients are a key-based tree implementation and a space filling curve load balancing scheme.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schweitzer, M.A. (2003). Parallelization and Implementational Details. In: A Parallel Multilevel Partition of Unity Method for Elliptic Partial Differential Equations. Lecture Notes in Computational Science and Engineering, vol 29. Springer, Berlin, Heidelberg. http://doi.org/10.1007/978-3-642-59325-3_6
Download citation
DOI: http://doi.org/10.1007/978-3-642-59325-3_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00351-9
Online ISBN: 978-3-642-59325-3
eBook Packages: Springer Book Archive