✦ LIBER ✦

Generalized Schwarz algorithm for obstacle problems

✍ Scribed by S. Zhou; J. Zeng; X. Tang

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 448 KB
Volume: 38
Category: Article
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(99)00255-2

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we present so-called generalized additive and multiplicative Schwarz algorithms for solving the discretization problems of obstacle problems with a self-adjoint elliptic operator. We establish convergence theorems for the proposed algorithms. Numerical tests show that a faster convergence rate can be obtained by choosing suitable parameters in the algorithms.

📜 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.

An algorithm for solving the obstacle pr

An algorithm for solving the obstacle problems

✍ Lian Xue; Xiao-Liang Cheng 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 365 KB

ln this paper, we propose an algorithm for solving the obstacle problem. We try to find the approximated region of the contact in the obstacle problem by iteration. Numerical examples are given for the obstacle problem for a membrane and the elastic-plastic torsion problem. (~) 2004 Elsevier Ltd. Al

Multilevel projection algorithm for solv

Multilevel projection algorithm for solving obstacle problems

✍ Yongmin Zhang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 503 KB

Obstacle problems are nonlinear free boundary problems and the computation of ap\* proximate solutions can be difficult and expensive. Little work has been done on effective numerical methods of such problems. This paper addresses some aspects of this issue. Discretizing the problem in a continuous

Quadratic programming algorithms for obs

Quadratic programming algorithms for obstacle problems

✍ Doukhovni, Ilia ;Givoli, Dan 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 446 KB

The numerical solution of problems involving frictionless contact between an elastic body and a rigid obstacle is considered. The elastic body may undergo small or large deformation. Finite element discretization and repetitive linearization lead to a sequence of quadratic programming (QP) problems

A two-grids/projection algorithm for obs

A two-grids/projection algorithm for obstacle problems

✍ A. Caboussat; R. Glowinski 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 481 KB

In order to emphasize the possible relatmn between discontinuous and continuous approximations on different meshes, a two-grids method for the resolution of parabolic variational mequality problems is presented. The numemcal methodology combines a time splitting algorithm to decouple a diffusion phe

A projection algorithm for bilateral obs

A projection algorithm for bilateral obstacle problem

✍ A. Addou; A. Lidouh; B. Seddoug 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 151 KB