A partial enumeration algorithm for solving PNS problems
✍ Scribed by Cs. Holló
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 811 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0895-7177
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
For a partial di erential parametric system P1 = 0; : : : ; Pr = 0; Q1 = 0; : : : ; Qs = 0; where Pi; Qj are di erential polynomials in K{u1; : : : ; ut; y1; : : : ; yn} and u k are parameters, an algorithm to solve the parametric system is presented in this paper. The algorithm ÿnds not just the v
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
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
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