Sinopsis
Excerpt from Some Domain Decomposition Algorithms for Elliptic Problems
We consider a linear, self adjoint, elliptic problem, which is discretized by a finite element method on a bounded Lipschitz region. The region Q is a subset of R, n=2 or 3, the differential operator is the Laplacian, and zero Dirichlet conditions and continuous, piecewise linear finite elements are used. The theory could equally well be developed for much more general linear elliptic problems, which can be formulated as minimization problems. Arbitrary conforming finite elements could also be considered without fur ther major complications. Nonconforming finite elements, non-self adjoint problems and problems that give rise to indefinite symmetric systems of equations are also quite important. Some progress has already been made in such cases.
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.
