Ebook: Domain Decomposition Methods — Algorithms and Theory
- Genre: Mathematics // Computational Mathematics
- Tags: Computational Mathematics and Numerical Analysis, Computational Science and Engineering, Processor Architectures, Software Engineering/Programming and Operating Systems, Mathematics of Computing
- Series: Springer Series in Computational Mathematics 34
- Year: 2005
- Publisher: Springer-Verlag Berlin Heidelberg
- City: Berlin
- Edition: 1
- Language: English
- djvu
From the reviews of the first edition:
"This book unifies the results from a number of papers by the authors and their coworkers over the past two decades, and complements them by new insights and some background. The distinguishing feature of this book is a comprehensive and rigorous treatment of convergence bounds based on the theory of infinite elements. … The bibliography is quite complete for the fields covered … . The book belongs on the desk of all specialists involved in domain decomposition and substructuring … ." (Jan Mandel, Zentralblatt MATH, Vol. 1069, 2005)
The scope of this text is to offer a comprehensive and self-sufficient presentation of some of the most successful and popular domain decomposition preconditioners for finite and spectral element approximations of partial differential equations. Strong emphasis is put both on their algorithmic and mathematical aspects. Some important methods that are not treated in other available monographs on domain decomposition, such as FETI methods, Balancing Neumann-Neumann methods and algorithms for spectral element approximations, are covered in this book.