Overview
ABSTRACT
Most domain decomposition methods which are currently used in all engineering sectors encounter, due to their decomposition in a large number of sub-domains, problems of insufficiently parallelized resolution problems. Furthermore, raising the iteration number lowers the calculation speed and convergence diminishes. In order to solve these problems and to obtain scalable methods, adding components such as the coarse grid or recoursing to time and space resolutions, notably with the parareal algorithm, can be used to obtain satisfactory solutions even within extremely complex contexts.
Read this article from a comprehensive knowledge base, updated and supplemented with articles reviewed by scientific committees.
Read the articleAUTHORS
-
Martin J. GANDER : Mathematics teacher - Mathematics Section, University of Geneva
-
Laurence HALPERN : Mathematics teacher - Analysis, Geometry and Applications Laboratory, Université Paris 13
INTRODUCTION
This is the second part of the article Domain decomposition methods. Basic concepts.
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
KEYWORDS
| | Domain Decomposition | Schwarz Methods | Waveform Relaxation | Parareal Algorithm
Domain decomposition methods - Extended notions
Coarse-grid preconditioner
Article included in this offer
"Mathematics"
(
167 articles
)
Updated and enriched with articles validated by our scientific committees
A set of exclusive tools to complement the resources
Bibliography
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
