## Abstract A classical result in the theory of monotone operators states that if __C__ is a reflexive Banach space, and an operator __A__: __C__→__C__^\*^ is monotone, semicontinuous and coercive, then __A__ is surjective. In this paper, we define the ‘dual space’ __C__^\*^ of a convex, usually no
Applications of a space decomposition method to linear and nonlinear elliptic problems
✍ Scribed by Xue–Cheng Tai; Magne Espedal
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 501 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0749-159X
No coin nor oath required. For personal study only.
✦ Synopsis
This work presents some space decomposition algorithms for a convex minimization problem. The algorithms has linear rate of convergence and the rate of convergence depends only on four constants. The space decomposition could be a multigrid or domain decomposition method. We explain the detailed procedure to implement our algorithms for a two-level overlapping domain decomposition method and estimate the needed constants. Numerical tests are reported for linear as well as nonlinear elliptic problems.
📜 SIMILAR VOLUMES
Nevertheless, at present there is still a need to reduce the computational costs of a BEM. Moreover, the straight-In this paper an iterative domain decomposition method for the solution of Laplace's equation is described and its effectiveness in forward application of a BEM requires a computational