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

An algorithm for solving bidisperse catalyst pellet problems

โœ Scribed by V.K. Jayaraman

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
352 KB
Volume
17
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 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.