
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
Excerpt from Domain Decomposition Algorithms for Indefinite Elliptic Problems Domain decomposition techniques are powerful iterative methods for solving lin ear systems oi equations that arise from finite element problems. In each iteration step, a coarse mesh finite element problem and a number of smaller linear sys tems, which correspond to the restriction of the original problem to subregions, are solved instead of the large original system. These algorithms can be regarded as divide and conquer methods. The number of subproblems can be large and these methods are therefore promising for parallel computation. The central mathematical question is to obtain estimates on the rate of convergence of the iteration by deriving bounds on the spectrum of the iteration operator. We are able to establish quite satisfactory bounds if the coarse mesh is fine enough. About the Publisher Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
This book investigates the convergence rates of domain decomposition algorithms for solving indefinite elliptic problems. The author, Xiao-Chuan Cai, a noted researcher in numerical analysis, presents these algorithms as powerful iterative methods derived from finite element problems. The core challenge lies in obtaining spectral bounds for the iteration operator, with satisfactory results achievable when the coarse mesh is sufficiently fine. These methods are framed as 'divide and conquer' strategies, promising for parallel computation due to their potential to break down large systems into smaller, manageable subproblems.
This classic reprint focuses on the mathematical underpinnings of domain decomposition algorithms, particularly for indefinite elliptic problems. The text is likely to appeal to researchers and advanced students in numerical analysis and scientific computing who are interested in the theoretical aspects of iterative solvers. The approach emphasizes the derivation of convergence bounds, suggesting a rigorous and analytical treatment of the subject matter. The book's value lies in its detailed exploration of these powerful techniques for large-scale problems.
Page Count:
32
Publication Date:
2018-04-22
Publisher:
LULU Press
ISBN-10:
1332088570
ISBN-13:
9781332088577
No comments yet. Be the first to share your thoughts!