## Diagrammatic modelling representation methods in discrete event simulation are varied and can be classified as follows: simulation strategy neutral, simulation strategy oriented, simulation language oriented, and methods borrowed from other computer modelling areas. The main diagrammatic method
On the stability and performance of discrete event methods for simulating continuous systems
β Scribed by James Nutaro; Bernard Zeigler
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 375 KB
- Volume
- 227
- Category
- Article
- ISSN
- 0021-9991
No coin nor oath required. For personal study only.
β¦ Synopsis
This paper establishes a link between the stability of a first order, explicit discrete event integration scheme and the stability criteria for the explicit Euler method. The paper begins by constructing a time-varying linear system with bounded inputs that is equivalent to the first order discrete event integration scheme. The stability of the discrete event system is shown to result from the fact that it automatically adjusts its time advance to lie below the limit set by the explicit Euler stability criteria. Moreover, because it is not necessary to update all integrators at this rate, a significant performance advantage is possible. Our results confirm and explain previously reported studies where it is demonstrated that a reduced number of updates can provide a significant performance advantage compared to fixed step methods. These results also throw some light on stability requirements for discrete event simulation of spatially extended systems.
π SIMILAR VOLUMES
Al~a~et--Let a real polynomial in a complex variable, whose coefficients are any given continuous functions of two real interval parameters, be given. Necessary and sufficient conditions are derived for the polynomial to have all its zeros outside (or inside) the unit circle of the complex variable
In a recent article on stability of discrete inclusions the authors argue that the problem of determining stability of discrete inclusions given by convex sets of matrices with a finite number of extremal points is NP-hard. It is shown that the argument that has been employed is inconclusive and thu