Computational Technology Resources - CSETS

F. Magoulès, "Asynchronous Schwarz Methods for Peta and Exascale Computing", in B.H.V. Topping and P. Iványi, (Editor), "Developments in Parallel, Distributed, Grid and Cloud Computing for Engineering", Saxe-Coburg Publications, Stirlingshire, UK, Chapter 10, pp 229-247, 2013. doi:10.4203/csets.31.10

Keywords: Schwarz algorithm, domain decomposition, interface condition, parallel computing, asynchronous iteration.

Abstract

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 subdomains. 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 an 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 £85 +P&P)

	Computational & Technology Resources an online resource for computational, engineering & technology publications
	not logged in - login
Front Page Browse CCP CSETS CTR IJRT Other Authors Search Purchase Guide FAQ Contact us	Computational Science, Engineering & Technology Series ISSN 1759-3158 CSETS: 31 DEVELOPMENTS IN PARALLEL, DISTRIBUTED, GRID AND CLOUD COMPUTING FOR ENGINEERING Edited by: B.H.V. Topping and P. Iványi Chapter 10 Asynchronous Schwarz Methods for Peta and Exascale Computing F. Magoulès Laboratoire de Mathématiques Appliquées aux Systèmes, Ecole Centrale Paris, Châtenay-Malabry, France doi:10.4203/csets.31.10 purchase the full-text of this chapter Full Bibliographic Reference for this chapter F. Magoulès, "Asynchronous Schwarz Methods for Peta and Exascale Computing", in B.H.V. Topping and P. Iványi, (Editor), "Developments in Parallel, Distributed, Grid and Cloud Computing for Engineering", Saxe-Coburg Publications, Stirlingshire, UK, Chapter 10, pp 229-247, 2013. doi:10.4203/csets.31.10 Keywords: Schwarz algorithm, domain decomposition, interface condition, parallel computing, asynchronous iteration. Abstract 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 subdomains. 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 an 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 £85 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions