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

An algorithm for the computer simulation of very large dynamic systems

โœ Scribed by E.J. Davison


Publisher
Elsevier Science
Year
1973
Tongue
English
Weight
835 KB
Volume
9
Category
Article
ISSN
0005-1098

No coin nor oath required. For personal study only.

โœฆ Synopsis


A fast efficient algorithm may be used for integrating very large (n >> 10) stiffdifferential equations of the type R = Ax + Bu + f(x, t), x(t0) = x0, wh ere f(x, t) has a small Lipschitz constant.

Summary--An algorithm for integrating high dimensional stiff nonlinear differential equations of the type i=Ax +f(x, t)+Bu(t), x(t0)=x0, where u(t) is a specified time function, f(x, t) is a nonlinear function with a small Lipschitz constant and A is a matrix whose eigenvalues are widely distributed is given. The proposed algorithm has a truncation error of 0(hS) where h is the step-size, is numerically stable for any h provided the original system is stable and the Lipschitz constant is small enough, will give exact steady-state solutions for constant input systems for any h, and is especially suited to those systems in which the order n of the system is large, for example, n >> 10. Some numerical examples varying from 10th to 80th order are included and a comparison of the computation time required by the proposed method is made with other algorithms--the Runge--Kutta method, and Gear's method. It is found that the proposed algorithm is approximately 10 times faster than Gear's method for the 80th order example.


๐Ÿ“œ SIMILAR VOLUMES


An Optimized Algorithm for Molecular Dyn
โœ E. Glikman; I. Kelson; N.V. Doan; H. Tietze ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 272 KB

tasks, which results in considerable CPU time savings. This method is based on selectively limiting the calculation of A method of optimizing molecular dynamics calculations is presented. The method employs multiple time steps across the computhe forces and the neighbor list updating, according to t

Molecular dynamics for very large system
โœ Lim, Kian-Tat; Brunett, Sharon; Iotov, Mihail; McClurg, Richard B.; Vaidehi, Nag ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 377 KB ๐Ÿ‘ 1 views

We describe the implementation of the cell multipole method CMM in a ลฝ . ลฝ . complete molecular dynamics MD simulation program MPSim for massively parallel supercomputers. Tests are made of how the program scales with size ลฝ . ลฝ . linearly and with number of CPUs nearly linearly in applications invo

An Algorithm for Computing a New Normal
โœ Guoting Chen; Jean Della Dora ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 378 KB

We propose in this paper a new normal form for dynamical systems or vector fields which improves the classical normal forms in the sense that it is a further reduction of the classical normal forms. We give an algorithm for an effective computation of these normal forms. Our approach is rational in

An efficient algorithm for the brownian
โœ Francis Sullivan; Raymond D. Mountain ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 531 KB

Computer simulation techniques have proven to be quite useful for studying the structure of particulates produced by the process of growth through the aggregation of smaller particles. In this paper we introduce an efficient algorithm for use in the computer simulation of the kinetics of the growth