๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Monotone additive Schwarz algorithms for solving two-side obstacle problems

โœ Scribed by Jinping Zeng

Publisher
Wuhan University
Year
1996
Tongue
English
Weight
181 KB
Volume
1
Category
Article
ISSN
1007-1202

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Convergence analysis ofgeneralized Schwa
Convergence analysis ofgeneralized Schwarz algorithms for solving obstacle problems with T-monotone operator
โœ Chenliang Li; Jinping Zeng; Shuzi Zhou ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 747 KB

This paper proves the convergence of some generalized Schwarz algorithms for solving the obstacle problems with a T-monotone operator. Numerical results show that the generalized Sehwarz algorithms converge faster than the classical Schwarz algorithms.

Monotonic iterative algorithms for an im
Monotonic iterative algorithms for an implicit two-sided obstacle problem
โœ Shuzi Zhou; Jinping Zeng; Wuping Zhan ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 383 KB

find u e B(u) + [a, b] such that (A(u), v -u) >\_ (f, v -u), V v โ€ข B(u) + In, b]. (1.1) If a = (0,..., 0) T, b = (+c~,..., +c~) T, (1.1) reduces into quasi-complementarity problems. If a, b are finite vectors, B(x) = O, Vx โ€ข R n, (1.1) turns into usual two-sided obstacle problem. Quasi-variational