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

Quadratic programming algorithms for obstacle problems

โœ Scribed by Doukhovni, Ilia ;Givoli, Dan

Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
446 KB
Volume
12
Category
Article
ISSN
1069-8299

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 for incremental displacement. The performances of several QP algorithms, including two new versions of a modified steepest descent algorithm, are compared in this context. Numerical examples include a string, a membrane and an Euler-Bernoulli beam, in contact with flat and non-flat rigid obstacles.

๐Ÿ“œ SIMILAR VOLUMES

An approximation algorithm for quadratic
An approximation algorithm for quadratic cost 0โ€“1 mixed integer programming problems
โœ Kumiko Mukai; Keiji Tatsumi; Masao Fukushima ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 586 KB

In this paper, we focus on the quadratic cost 01 mixed integer programming problem. First, we formulate the problem as a two-level programming problem that consists of a lower-level continuous quadratic programming problem with 01 variables fixed and an upper-level nonlinear 01 programming problem.

A fuzzy goal programming procedure for s
A fuzzy goal programming procedure for solving quadratic bilevel programming problems
โœ Bijay Baran Pal; Bhola Nath Moitra ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 93 KB

This article presents a fuzzy goal programming (FGP) procedure for solving quadratic bilevel programming problems (QBLPP). In the proposed approach, the membership functions for the defined fuzzy objective goals of the decision makers (DM) at both the levels are developed first. Then, a quadratic pr

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