Studies in Domain Decomposition: Multilevel Methods and the Biharmonic Dirichlet Problem (Classic Reprint) - Tapa dura

Sinopsis

Excerpt from Studies in Domain Decomposition: Multilevel Methods and the Biharmonic Dirichlet Problem

Multilevel methods, such as multigrid methods, are among the most efficient methods for linear equations arising from elliptic problems; cf. Hackbusch mccormick [38] and the references therein. Recently, with the increasing interest in parallel computation, several new multilevel methods have been developed; cf. Yserentant Bank, Dupont and Yserentant Bramble, Pasciak and Xu and Dryja and Widlund In this thesis, we give improved results for a class of multilevel methods by showing that the condition number of the iteration Operator grows at most linearly with the number of levels in general, and is bounded by a constant independent of the mesh sizes and the number of levels if the elliptic problem is Hz - regular. This is an improvement on Dryja and Widlund's results on a multilevel additive Schwarz method as well as Bramble, P-asciak and Ku's results on the bpx algorithm.

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.