Best difference equation approximation to Duffing's equation

Abstract

Duffing's differential equation in its simplest form can be approximated by a variety of difference equations. It is shown how to choose a 'best' difference equation in the sense that the solutions of this difference equation are successive discrete exact values of the solution of the differential equation.

Contributions to the development of differential systems exactly solved by multistep finite-difference schemes

“…Evidently, a necessary condition for an I.V.P. of the form in (1) to be solved exactly by the method in (2) is that its solution must solve the ordinary differential equation given by LðyÞ ¼ 0 (see [6] for the case of one-step methods). That is, the differential equations formed by the solutions of LðyÞ ¼ 0 are candidates to be solved exactly by the numerical method.…”

Exponential stability preservation in discrete-time analogues of artificial neural networks with distributed delays

“…[1,32,[41][42][43] for more examples of nonstandard analogues). In addition to (3.22), we invoke aYoung inequality of nonnegative real numbers in the forthcoming analysis-namely that, if 1 , 2 denote nonnegative real numbers, then…”

Computer simulations of exponentially convergent networks with large impulses

“…This function is referred by Mickens [21] as a denominator function. Its use can also be found in the work of Potts [28][29][30][31]. By rewriting the analogue (2.5) as…”

“…(3.23) as a nonstandard analogue of the derivative df p (t)/dt (see Refs. [1,21,[28][29][30][31] for more examples of nonstandard analogues). In addition to Eq.…”