Chebyshev interpolation is employed to produce an algorithm for th-order approximate soluton of the ordinary oscillatory differential equation
The mapping takes to , . Expanding in Chebyshev polynomials in the solution of (1) satisfies
Truncating the series (2) after terms and choosing leads to an implicit algorithm relating the values where are the extremal nodes of , . Numerical results are presented for four specific linear examples. These compare well with results obtained by other methods.