Computational & Technology Resources
an online resource for computational,
engineering & technology publications
Computational Science, Engineering & Technology Series
ISSN 1759-3158
Edited by: B.H.V. Topping
Chapter 17

Asynchronous Optimized Schwarz Methods

F. Magoulès

Laboratoire de Mathématiques Appliquées aux Systèmes, Ecole Centrale Paris, Châtenay-Malabry, France

Full Bibliographic Reference for this chapter
F. Magoulès, "Asynchronous Optimized Schwarz Methods", in B.H.V. Topping, (Editor), "Computational Methods for Engineering Science", Saxe-Coburg Publications, Stirlingshire, UK, Chapter 17, pp 425-443, 2012. doi:10.4203/csets.30.17
Keywords: Schwarz algorithm, domain decomposition, interface condition, parallel computing, asynchronous iteration.

Optimized Schwarz methods are very efficient iterative algorithms for the parallel solution of computational mechanics problems. These methods are similar to the classical Schwarz methods, but they use absorbing interface conditions between the sub-domains. These interface conditions are then optimized for efficiency and lead to a fast and robust convergence behavior of the iterative algorithm. A wide range of optimization techniques have been proposed and developed in the literature. In this chapter, optimized Schwarz methods are extended to the asynchronous context. The word asynchronous here is related to the iterations of the mathematical algorithm. Numerical experiments illustrate the robustness and efficiency of this original approach when solving the Helmholtz equation on parallel computers.

purchase the full-text of this chapter (price £20)

go to the previous chapter
go to the next chapter
return to the table of contents
return to the book description
purchase this book (price £95 +P&P)