The numerical solution of linear differential equations in Chebyshev series
C. W. Clenshaw
Source record
Source: Crossref
Published: Jan 1, 1957
DOI: 10.1017/s0305004100032072
Open original source ↗Source abstract
ABSTRACT 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.