Everything About ___
Live briefing

Everything about Domain decomposition methods

Type of numerical method

In mathematics, numerical analysis, and numerical partial differential equations, domain decomposition methods solve a boundary value problem by splitting it into smaller boundary value problems on subdomains and iterating to coordinate the solution between adjacent subdomains. A coarse problem with one or few unknowns per subdomain is used to further coordinate the solution between the subdomains globally. The problems on the subdomains are independent, which makes domain decomposition methods suitable for parallel computing. Domain decomposition methods are typically used as preconditioners for Krylov space iterative methods, such as the conjugate gradient method, GMRES, and LOBPCG. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Domain decomposition methodsA 5-minute orientation
  2. Skim a recent paper: Machine learning and domain decomposition methods - a surveyInfluential work since 2022
  3. Pick up a classic book: Domain decomposition methods in sciences and engineeringThe most-reprinted book on the subject
  4. Read the landmark paper: Non-overlapping domain decomposition methods in structural mechanicsCited 173 times
  5. Go sideways: Additive Schwarz methodA closely related topic
  6. Go sideways: Numerical methods for partial differential equationsA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics