Electronic Resource
New York, NY [u.a.]
:
Wiley-Blackwell
Numerical Methods for Partial Differential Equations
14 (1998), S. 717-737
ISSN:
0749-159X
Keywords:
parallel
;
domain decomposition
;
nonlinear
;
elliptic equation
;
space decomposition
;
Mathematics and Statistics
Source:
Wiley InterScience Backfile Collection 1832-2000
Topics:
Mathematics
Notes:
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. © 1998 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 14: 717-737, 1998
Additional Material:
7 Ill.
Type of Medium:
Electronic Resource
Permalink
| Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |
