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.
β¦ LIBER β¦
On the convergence of generalized Schwarz algorithms for solving obstacle problems with elliptic operators
β Scribed by Gaojie Chen; Jinping Zeng
- Publisher
- Springer
- Year
- 2008
- Tongue
- English
- Weight
- 207 KB
- Volume
- 67
- Category
- Article
- ISSN
- 0340-9422
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Convergence analysis ofgeneralized Schwa
β
Chenliang Li; Jinping Zeng; Shuzi Zhou
π
Article
π
2004
π
Elsevier Science
π
English
β 747 KB
On the geometric convergence of optimize
β
SΓ©bastien Loisel; Daniel B. Szyld
π
Article
π
2009
π
Springer-Verlag
π
English
β 527 KB
ON THE CONVERGENCE OF ZERO-FINDING EIGEN
β
MOHAMMEDI R. ABDEL-AZIZ
π
Article
π
1997
π
John Wiley and Sons
π
English
β 118 KB
π 2 views
This paper presents a convergence theory for non-linear eigenvalue methods. The basic idea of these methods, which have been described by the author in an earlier paper, 1 is to apply an eigen-solver in conjunction with a zero-ΓΏnding technique for solving the non-linear eigenvalue problems. The main
A numerical algorithm for solving the ge
β
P. O. Savenko
π
Article
π
1998
π
Springer US
π
English
β 223 KB
Algorithm for solving NLP problems with
β
O. N. Tokareva
π
Article
π
1986
π
Springer US
π
English
β 632 KB
One-sided problems for elliptic operator
One-sided problems for elliptic operators with convex constraints on the gradient of the solution. I
β
T. N. Rozhkovskaya
π
Article
π
1986
π
SP MAIK Nauka/Interperiodica
π
English
β 740 KB