A single-step high-order implicit time integration scheme for the solution of transient and wave propagation problems is presented. It constructed from Pad\'e expansions matrix exponential a system first-order ordinary differential equations formulated in state-space. computationally efficient developed exploiting techniques polynomial factorization partial fractions rational functions, by deco...

In the last few years a number of real{time process calculi have emerged with the purpose of capturing important quantitative aspects of real{time systems. In addition, a number of process equivalences sensitive to time{quantities have been proposed, among these the notion of timed (bisimulation) equivalence in RR86, DS89, HR91, BB89, NRSV90, MT90, Wan91b]. In this paper, we introduce a time{ab...

In the game-theoretic model war of attrition, players are subject to an explicit cost proportional to the duration of contests. We construct a model where the time cost is not explicitly given, but instead depends implicitly on the strategies of the whole population. We identify and analyse the underlying mechanisms responsible for the implicit time cost. Each player participates in a series of...

Across-the-space parallelism still remains the most mature, convenient and natural way to parallelize large scale problems. One of the major problems here is that implicit time stepping is often difficult to parallelize due to the structure of the system. Approximate implicit schemes have been suggested to circumvent the problem [5]. These schemes have attractive stability properties and they a...

Flows over time may be maximized by computing a static maximum flow on the corresponding time-expanded network, which contains a copy of the original network for each discrete time step. This makes available the whole algorithmic toolbox developed for static flows. The major drawback of this method compared to a polynomial (motivated by Ford and Fulkerson [6, 7]) is that the time-expanded netwo...

New methodologies are designed to reduce the time complexity of an implicit discrete-time differentiator and simulation implement it. They rely on Horner’s method Shaw-Traub algorithm. The algorithms compared for differentiators order 3, 7, 10. Half-Horner Full-Horner methods showed best performance complexity.

A coordinate-splitting economic diierence scheme is proposed for generalized parabolic equations (GPE) containing fourth-order diiusion operators and the algorithm for its implementation is developed. The performance of the scheme is demonstrated for diierent cases, e.g. for treating bifurcation phenomena. The technique is applied to the numerical solution of Swift-Hohenberg equation describing...