About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Mathematics of Computation
Paper
Stability of the discretized pantograph differential equation
Abstract
In this paper we study discretizations of the general pantograph equation y’(t) = ay(t) + by(θ(t)) + cy’(∅(t)) , t≥0, y(0)=y0where a , b , c , and y0are complex numbers and where θ and ∅ a re strictly increasing functions on the nonnegative reals with θ(0) = ∅(0) = 0 and θ(t) < t, ∅(t)< t for positive t. Our purpose is an analysis of the stability of the numerical solution with trapezoidal rule discretizations, and we will identify conditions on a , b , c and the stepsize which imply that the solution sequence ynn=0∞’s DOunded or that it tends to zero algebraically, as a negative power of n. © 1993 American Mathematical Society.