The numerical solution of linear differential equations in Chebyshev series

This paper describes a method for computing the coefficients in the Chebyshev expansion of a solution of an ordinary linear differential equation. The method is valid when the solution required is bounded and possesses a finite number of maxima and minima in the finite range of integration. The essence of the method is that an expansion in Chebyshev polynomials is assumed for the highest derivative occurring in the equation; the coefficients are then determined by integrating this series, substituting in the original equation and equating coefficients. Comparison is made with the Fourier series method of Dennis and Foots, and with the polynomial approximation method of Lanczos. Examples are given of the application of the method to some first and second order equations, including one eigenvalue problem.

[1]  G. Poots,et al.  The solution of linear differential equations , 1955, Mathematical Proceedings of the Cambridge Philosophical Society.

[2]  C. W. Clenshaw.  A note on the summation of Chebyshev series , 1955 .

[3]  C. Lanczos,et al.  Trigonometric Interpolation of Empirical and Analytical Functions , 1938 .

[4]  L. Fox,et al.  The solution by relaxation methods of ordinary differential equations , 1949, Mathematical Proceedings of the Cambridge Philosophical Society.

[5]  L. Fox,et al.  Some new methods for the numerical integration of ordinary differential equations , 1949, Mathematical Proceedings of the Cambridge Philosophical Society.

[6]  John Todd,et al.  Solution of Differential Equations by Recurrence Relations , 1950 .