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

A projection algorithm for bilateral obstacle problem

โœ Scribed by A. Addou; A. Lidouh; B. Seddoug

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
151 KB
Volume
77
Category
Article
ISSN
0378-4754

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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

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

Numerical Algorithms Based on Characteri
Numerical Algorithms Based on Characteristic Domain Decomposition for Obstacle Problems
โœ Tarvainen, P. ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 148 KB

A new numerical solution algorithm for obstacle problems is proposed, where the characteristic domain decomposition into active and inactive subdomains separated by the free boundary is approximated by a Schwarz method. Such an approach gives an opportunity to apply fast linear system solvers to gen