This book offers a comprehensive presentation of some of the most successful and popular domain decomposition preconditioners for finite and spectral element approximations of partial differential equations. It places strong emphasis on both algorithmic and mathematical aspects. It covers in detail important methods such as FETI and balancing Neumann-Neumann methods and algorithms for spectral element 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.?

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.

Domain decomposition is an active research area concerned with the development, analysis, and implementation of coupling and decoupling strategies in mathematical and computational models of natural and engineered systems. The present volume sets forth new contributions in areas of numerical analysis, computer science, scientific and industrial applications, and software development.

One of the first things a student of partial differential equations learns is that it is impossible to solve elliptic equations by spatial marching. This new book describes how to do exactly that, providing a powerful tool for solving problems in fluid dynamics, heat transfer, electrostatics, and other fields characterized by discretized partial differential equations. Elliptic Marching Methods and Domain Decomposition demonstrates how to handle numerical instabilities (i.e., limitations on the size of the problem) that appear when one tries to solve these discretized equations with marching methods. The book also shows how marching methods can be superior to multigrid and pre-conditioned conjugate gradient (PCG) methods, particularly when used in the context of multiprocessor parallel computers. Techniques for using domain decomposition together with marching methods are detailed, clearly illustrating the benefits of these techniques for applications in engineering, applied mathematics, and the physical sciences.

Targeted at students and researchers in computational sciences who need to develop computer codes for solving PDEs, the exposition here is focused on numerics and software related to mathematical models in solid and fluid mechanics. The book teaches finite element methods, and basic finite difference methods from a computational point of view, with the main emphasis on developing flexible computer programs, using the numerical library Diffpack. Diffpack is explained in detail for problems including model equations in applied mathematics, heat transfer, elasticity, and viscous fluid flow. All the program examples, as well as Diffpack for use with this book, are available on the Internet. XXXXXXX NEUER TEXT This book is for researchers who need to develop computer code for solving PDEs. Numerical methods and the application of Diffpack are explained in detail. Diffpack is a modern C++ development environment that is widely used by industrial scientists and engineers working in areas such as oil exploration, groundwater modeling, and materials testing. All the program examples, as well as a test version of Diffpack, are available for free over the Internet.

This book contains the proceedings of the Sixth International Conference on Domain Decomposition, held in June 1992 in Como, Italy. Much of the work in this field focuses on developing numerical methods for large algebraic systems.

This book is a collection of papers presented at the 23rd International Conference on Domain Decomposition Methods in Science and Engineering, held on Jeju Island, Korea on July 6-10, 2015. Domain decomposition methods solve boundary value problems by splitting them into smaller boundary value problems on subdomains and iterating to coordinate the solution between adjacent subdomains. Domain decomposition methods have considerable potential for a parallelization of the finite element methods, and serve a basis for distributed, parallel computations.

th This volume contains a selection of 41 refereed papers presented at the 18 International Conference of Domain Decomposition Methods hosted by the School of ComputerScience and Engineering(CSE) of the Hebrew Universityof Jerusalem, Israel, January 12–17, 2008. 1 Background of the Conference Series The International Conference on Domain Decomposition Methods has been held in twelve countries throughout Asia, Europe, the Middle East, and North America, beginning in Paris in 1987. Originally held annually, it is now spaced at roughly 18-month intervals. A complete list of past meetings appears below. The principal technical content of the conference has always been mathematical, but the principal motivation has been to make ef cient use of distributed memory computers for complex applications arising in science and engineering. The leading 15 such computers, at the “petascale” characterized by 10 oating point operations per second of processing power and as many Bytes of application-addressablem- ory, now marshal more than 200,000 independentprocessor cores, and systems with many millions of cores are expected soon. There is essentially no alternative to - main decomposition as a stratagem for parallelization at such scales. Contributions from mathematicians, computerscientists, engineers,and scientists are together n- essary in addressing the challenge of scale, and all are important to this conference.