Abstract

In this paper, we propose an effective Chebyshev–Picard iteration (CPI) method for solving delay differential equations with a constant delay. This approach adopts the Chebyshev series to represent the solution and improves the accuracy of the solution by successive Picard iterations. The CPI method is implemented in a matrix–vector form efficiently without matrix inversion. We also present a multi-interval CPI method for solving long-term simulation problems. Further, the convergence of the CPI method is analyzed by evaluating the eigenvalues of the coefficient matrices of the iteration. Several numerical experiments including both the linear and nonlinear systems with delay effects are presented to demonstrate the high accuracy and efficiency of the CPI method by comparison with the classic methods.

Full Text
Published version (Free)

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