Abstract

In this paper, we present a new method for solving linear neutral delay differential equations. We derive and illustrate the main features of this novel approach, that combines the Laplace transform method with (harmonic) Fourier series theory. Linear neutral delay differential equations are generally more difficult to solve because the time delay appears in the derivative of the state variable. We rely on computer algebra and numerical methods to implement the method. In addition, we derive an approximate formula for the location of the complex poles, which are required for computing the inverse Laplace transform. The form of the resulting solution, when only the Laplace method is used is a non-harmonic Fourier series. The accuracy of this solution can be improved by including more terms in the associated truncated series, but the convergence to the correct solution is slow. The main goal of this paper is to present a modified method which enables us to account for the terms which are excluded from these truncated Laplace series. That is, the terms in the tail of the infinite series. We include several examples where we compare the solutions generated by the standard Laplace method and the proposed Laplace-Fourier approach. Both solutions require using Cauchy’s residue theorem and finding the real and complex poles. It is shown that the Laplace-Fourier solution provides more accurate solutions than the conventional Laplace transform solution. Finally, since the Laplace-Fourier method generates a solution which is valid for all times, it allows us to accurately approximate the solution at any point with a single calculation.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.