Domain Decomposition Algorithms for Indefinite Elliptic Problems (Classic Reprint) - Tapa dura

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.