𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On simulation methods for solving the Boltamann equation

✍ Scribed by H. Ploss


Publisher
Springer Vienna
Year
1987
Tongue
English
Weight
622 KB
Volume
38
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On rediscovered iteration methods for so
✍ Miodrag PetkoviΔ‡; Dragoslav Herceg πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 92 KB

In the recent papers of Gerlach (SIAM Rev. 36 (1994) 272-276) and Ford and Pennline (SIAM Rev. 38 (1996) 658-659) a class of iterative methods for solving a single equation f(x) = 0, with arbitrary rate of convergence, has been presented. In this paper we show that this class is equivalent to ΓΏve ot

Solving stiff differential equations for
✍ T.D. Bui πŸ“‚ Article πŸ“… 1981 πŸ› Elsevier Science 🌐 English βš– 540 KB

## Computer simulation of dynamic systems very often leads to the solution of a set of stiff ordinary differential equations. The solution of this set of equations involves the eigenvalues of its Jacobian matrix. The greater the spread in eigenvalues, the more time consuming the solutions become

Solving ordinary differential equations
✍ L.F. Shampine πŸ“‚ Article πŸ“… 1978 πŸ› Elsevier Science 🌐 English βš– 303 KB

Runge-Kutta formulas are given which are suited to the tasks arising in simulation. They are methods permitting interpolation which use overlap into the succeeding step to reduce the cost of a step and its error estimate.

Parallel methods for solving equations
✍ W.L. Miranker πŸ“‚ Article πŸ“… 1978 πŸ› Elsevier Science 🌐 English βš– 730 KB

Two classes of algorithms for equation solving are presented and analyzed. These algorithms have been devised in recent years because of the computational facility of the multiprocessor. The first class consists of parallel search methods while the second class consists of asynchronous methods. The