Domain decomposition methods are divide and conquer computational methods for the parallel solution of partial differential equations of elliptic or parabolic type. The methodology includes iterative algorithms, and techniques for non-matching grid discretizations and heterogeneous approximations. This book serves as a matrix oriented introduction to domain decomposition methodology. A wide range of topics are discussed include hybrid formulations, Schwarz, and many more.

Presents an easy-to-read discussion of domain decomposition algorithms, their implementation and analysis. Ideal for graduate students about to embark on a career in computational science. It will also be a valuable resource for all those interested in parallel computing and numerical computational methods.

The purpose of this book is to offer an overview of the most popular domain decomposition methods for partial differential equations (PDEs). These methods are widely used for numerical simulations in solid mechanics, electromagnetism, flow in porous media, etc., on parallel machines from tens to hundreds of thousands of cores. The appealing feature of domain decomposition methods is that, contrary to direct methods, they are naturally parallel. The authors focus on parallel linear solvers. The authors present all popular algorithms, both at the PDE level and at the discrete level in terms of matrices, along with systematic scripts for sequential implementation in a free open-source finite element package as well as some parallel scripts. Also included is a new coarse space construction (two-level method) that adapts to highly heterogeneous problems.?

In this volume, designed for computational scientists and engineers working on applications requiring the memories and processing rates of large-scale parallelism, leading algorithmicists survey their own field-defining contributions, together with enough historical and bibliographical perspective to permit working one's way to the frontiers. This book is distinguished from earlier surveys in parallel numerical algorithms by its extension of coverage beyond core linear algebraic methods into tools more directly associated with partial differential and integral equations - though still with an appealing generality - and by its focus on practical medium-granularity parallelism, approachable through traditional programming languages. Several of the authors used their invitation to participate as a chance to stand back and create a unified overview, which nonspecialists will appreciate.

While domain decomposition methods have a long history dating back well over one hundred years, it is only during the last decade that they have become a major tool in numerical analysis of partial differential equations. This monograph emphasizes domain decomposition methods in the context of so-called virtual optimal control problems and treats optimal control problems for partial differential equations and their decompositions using an all-at-once approach.

Domain decomposition methods are a well established tool for an efficient numerical solution of partial differential equations, in particular for the coupling of different model equations and of different discretization methods. Based on the approximate solution of local boundary value problems either by finite or boundary element methods, the global problem is reduced to an operator equation on the skeleton of the domain decomposition. Different variational formulations then lead to hybrid domain decomposition methods.