𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm development for solving inexact simulation problems

✍ Scribed by G. Pagani; A. d'Arminio Monforte; G. Bianchi

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
577 KB
Volume
20
Category
Article
ISSN
0098-1354

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Algorithm for Solving Boundary Value
An Algorithm for Solving Boundary Value Problems
✍ 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 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

An inexact Krylov–Schur algorithm for th
An inexact Krylov–Schur algorithm for the unitary eigenvalue problem
✍ Roden J.A. David; David S. Watkins πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 173 KB

We present an efficient inexact implicitly restarted Arnoldi algorithm to find a few eigenpairs of large unitary matrices. The approximating Krylov spaces are built using short-term recurrences derived from Gragg's isometric Arnoldi process. The implicit restarts are done by the Krylov-Schur methodo

An algorithm for solving quadratic netwo
An algorithm for solving quadratic network flow problems
✍ 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.