The FETI and Balancing domain decomposition algorithms form two important families of iterative methods. They have been implemented and tested for very large applications and have been used extensively in academia as well as in national laboratories in Europe and the United States. Over the years, these methods have been improved and in the FETI family, FETI—DP (dualprimal finite element tearing and interconnection) has proven to be a very robust algorithm which also, when carefully implemented, respects the memory hierarchy of modern parallel and distributed computing systems. This is essential for approaching peak floating point performance.
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
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klawonn, A., Widlund, O.B., Wohlmuth, B. (2008). MINISYMPOSIUM 5: FETI, Balancing, and Related Hybrid Domain Decomposition Methods. In: Langer, U., Discacciati, M., Keyes, D.E., Widlund, O.B., Zulehner, W. (eds) Domain Decomposition Methods in Science and Engineering XVII. Lecture Notes in Computational Science and Engineering, vol 60. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75199-1_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-75199-1_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75198-4
Online ISBN: 978-3-540-75199-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)