Affiliation:
1. Institute of Computer Science, University of Toronto, Canada
Abstract
Methods are described for the derivation of minimax and near-minimax polynomial approximations. For minimax approximations techniques are considered for both analytically defined functions and functions defined by a table of values. For near-minimax approximations methods of determining the coefficients of the Fourier-Chebyshev expansion are first described. These consist of the rearrangement of the coefficients of a power polynomial, and also direct determination of the coefficients from the integral which defines them, or the differential equation which defines the function. Finally there is given a convenient modification of an interpolation scheme which finds coefficients of a near-minimax approximation without requiring numerical integration or the numerical solution of a system of equations.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference24 articles.
1. CHENY E.W. Approximation theory. Dept. of Mathematics U. of California 1963. (Mimeo) CHENY E.W. Approximation theory. Dept. of Mathematics U. of California 1963. (Mimeo)
2. A note on the summation of Chebyshev series;CLNSHAW C.W;MTAC,1955
3. numerical solution of linear differential equations in Chebyshev series;Proc. Camb. Phil. Soc.,1957
Cited by
52 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献