You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
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.
None
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.
Positioning itself at the common boundaries of several disciplines, this work provides new perspectives on modern nanoscale problems where fundamental science meets technology and computer modeling. In addition to well-known computational techniques such as finite-difference schemes and Ewald summation, the book presents a new finite-difference calculus of Flexible Local Approximation Methods (FLAME) that qualitatively improves the numerical accuracy in a variety of problems.
The book discusses some key scientific and technological developments in computational and applied partial differential equations. It covers many areas of scientific computing, including multigrid methods, image processing, finite element analysis and adaptive computations. It also covers software technology, algorithms and applications. Most papers are of research level, and are contributed by some well-known mathematicians and computer scientists. The book will be useful to engineers, computational scientists and graduate students.
This book contains proceedings from the Seventh International Conference on Domain Decomposition Methods, held at Pennsylvania State University in October 1993. The term ``domain decomposition'' has for nearly a decade been associated with the partly iterative, partly direct algorithms explored in the proceedings of this conference. Noteworthy trends in the current volume include progress in dealing with so-called ``bad parameters'' in elliptic partial differential equation problems, as well as developments in partial differential equations outside of the elliptically-dominated framework. Also described here are convergence and complexity results for novel discretizations, which bring with t...