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
โฆ LIBER โฆ
An algorithm for solving fermion problems
โ Scribed by J. P. Eckmann; M. Guenin
- Book ID
- 112880782
- Publisher
- Springer-Verlag,Italian Physical Society
- Year
- 1973
- Weight
- 371 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0369-3554
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
An algorithm for solving the obstacle pr
โ
Lian Xue; Xiao-Liang Cheng
๐
Article
๐
2004
๐
Elsevier Science
๐
English
โ 365 KB
An Algorithm for Solving Boundary Value
โ
Elias Deeba; S.A. Khuri; Shishen Xie
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 83 KB
In this paper a numerical algorithm, based on the decomposition technique, is presented for solving a class of nonlinear boundary value problems. The method is implemented for well-known examples, including Troesch's and Bratu's problems which have been extensively studied. The scheme is shown to be
An algorithm development for solving ine
โ
G. Pagani; A. d'Arminio Monforte; G. Bianchi
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 577 KB
An algorithm for solving bidisperse cata
โ
V.K. Jayaraman
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 352 KB
An improved SQP algorithm for solving mi
โ
Zhibin Zhu; Xiang Cai; Jinbao Jian
๐
Article
๐
2009
๐
Elsevier Science
๐
English
โ 412 KB
An algorithm for solving quadratic netwo
โ
N. Boland; C.J. Goh; A.I. Mees
๐
Article
๐
1991
๐
Elsevier Science
๐
English
โ 333 KB
We describe a new algorithm for solving separable quadratic cost network programming problems and compare its performance with that of the convex simplex method for networks.