Some Domain Decomposition Algorithms for Nonselfadjoint Elliptic and Parabolic Partial Differential Equations

Angebote / Angebote:

Excerpt from Some Domain Decomposition Algorithms for Nonselfadjoint Elliptic and Parabolic Partial Differential Equations: Technical Report 461, September, 1989 The iterative methods most commonly used are the conjugate gradient method for the symmetric, positive definite case and the generalized conju gate residual methods (gmres) for the general, nonsymmetric case. If the symmetric part of the operator is positive definite, with respect to a suitable inner product, convergence can be guaranteed. In this thesis, the rate of convergence of all algorithms will be estimated. We show that the additive Schwarz algorithm is optimal for both elliptic and parabolic problems in R2 and R3 in the sense that the rate of convergence is independent of both the coarse mesh size, defined by the substructures, and the fine mesh size. The iterative substructuring algorithm is not optimal in the above sense, however, in the R2 case the corresponding rate of convergence depends only mildly on the mesh parameters. A modified additive Schwarz algorithm is also introduced for parabolic problems in R2. The rate of convergence is independent of the fine mesh size. 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.