Applications of a Space Decomposition Method to Linear and Nonlinear Elliptic Problems

Abstract

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. c © 1998 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 14: 717–737, 1998

1 Figure or Table

Cite this paper

@inproceedings{Tai1997ApplicationsOA, title={Applications of a Space Decomposition Method to Linear and Nonlinear Elliptic Problems}, author={Xuecheng Tai and Magne S. Espedal}, year={1997} }