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.

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.

Mathematics of Computing -- General.

Compared to other books devoted to matrices, this volume is unique in covering the whole of a triptych consisting of algebraic theory, algorithmic problems and numerical applications, all united by the essential use and urge for development of matrix methods. This was the spirit of the 2nd International Conference on Matrix Methods and Operator Equations from 23-27 July 2007 in Moscow that was organized by Dario Bini, Gene Golub, Alexander Guterman, Vadim Olshevsky, Stefano Serra-Capizzano, Gilbert Strang and Eugene Tyrtyshnikov.Matrix methods provide the key to many problems in pure and applied mathematics. However, linear algebra theory, numerical algorithms and matrices in FEM/BEM applications usually live as if in three separate worlds. In this volume, maybe for the first time ever, they are compiled together as one entity as it was at the Moscow meeting, where the algebraic part was impersonated by Hans Schneider, algorithms by Gene Golub, and applications by Guri Marchuk. All topics intervened in plenary sessions are specially categorized into three sections of this volume.The soul of the meeting was Gene Golub, who rendered a charming “Golub's dimension” to the three main axes of the conference topics. This volume is dedicated in gratitude to his memory.

Tearing and interconnecting methods, such as FETI, FETI-DP, BETI, etc., are among the most successful domain decomposition solvers for partial differential equations. The purpose of this book is to give a detailed and self-contained presentation of these methods, including the corresponding algorithms as well as a rigorous convergence theory. In particular, two issues are addressed that have not been covered in any monograph yet: the coupling of finite and boundary elements within the tearing and interconnecting framework including exterior problems, and the case of highly varying (multiscale) coefficients not resolved by the subdomain partitioning. In this context, the book offers a detailed view to an active and up-to-date area of research.

This self-contained introduction to numerical linear algebra provides a comprehensive, yet concise, overview of the subject. It includes standard material such as direct methods for solving linear systems and least-squares problems, error, stability and conditioning, basic iterative methods and the calculation of eigenvalues. Later chapters cover more advanced material, such as Krylov subspace methods, multigrid methods, domain decomposition methods, multipole expansions, hierarchical matrices and compressed sensing. The book provides rigorous mathematical proofs throughout, and gives algorithms in general-purpose language-independent form. Requiring only a solid knowledge in linear algebra and basic analysis, this book will be useful for applied mathematicians, engineers, computer scientists, and all those interested in efficiently solving linear problems.

What does Google's management of billions of Web pages have in common with analysis of a genome with billions of nucleotides? Both apply methods that coordinate many processors to accomplish a single task. From mining genomes to the World Wide Web, from modeling financial markets to global weather patterns, parallel computing enables computations that would otherwise be impractical if not impossible with sequential approaches alone. Its fundamental role as an enabler of simulations and data analysis continues an advance in a wide range of application areas. Scientific Parallel Computing is the first textbook to integrate all the fundamentals of parallel computing in a single volume while also providing a basis for a deeper understanding of the subject. Designed for graduate and advanced undergraduate courses in the sciences and in engineering, computer science, and mathematics, it focuses on the three key areas of algorithms, architecture, languages, and their crucial synthesis in performance. The book's computational examples, whose math prerequisites are not beyond the level of advanced calculus, derive from a breadth of topics in scientific and engineering simulation and data analysis. The programming exercises presented early in the book are designed to bring students up to speed quickly, while the book later develops projects challenging enough to guide students toward research questions in the field. The new paradigm of cluster computing is fully addressed. A supporting web site provides access to all the codes and software mentioned in the book, and offers topical information on popular parallel computing systems. Integrates all the fundamentals of parallel computing essential for today's high-performance requirements Ideal for graduate and advanced undergraduate students in the sciences and in engineering, computer science, and mathematics Extensive programming and theoretical exercises enable students to write parallel codes quickly More challenging projects later in the book introduce research questions New paradigm of cluster computing fully addressed Supporting web site provides access to all the codes and software mentioned in the book