Minimax polynomial approximation
HTML articles powered by AMS MathViewer
- by Harry H. Denman PDF
- Math. Comp. 20 (1966), 257-265 Request permission
Abstract:
Some new methods for obtaining the minimax polynomial approximation of degree $n$ to a continuous function are introduced, and applied to several simple functions. The amount of computation required is substantially reduced compared with that of previous methods.References
-
Harry H. Denman, "Computer generation of optimized subroutines," J. Assoc. Comput. Mach., v. 8, 1961, pp. 104–116.
- N. I. Achieser, Theory of approximation, Frederick Ungar Publishing Co., New York, 1956. Translated by Charles J. Hyman. MR 0095369
- E. P. Novodvorskiĭ and I. Š. Pinsker, The process of equating maxima, Uspehi Matem. Nauk (N.S.) 6 (1951), no. 6(46), 174–181 (Russian). MR 0046400
- A. Shenitzer, Chebyshev approximation of a continuous function by a class of functions, J. Assoc. Comput. Mach. 4 (1957), 30–35. MR 93892, DOI 10.1145/320856.320863 W. Fraser & J. F. Hart, "On the computation of rational approximations to continuous functions," Comm. ACM, v. 5, 1962, pp. 401–403.
- F. D. Murnaghan and J. W. Wrench Jr., The determination of the Chebyshev approximating polynomial for a differentiable function, Math. Tables Aids Comput. 13 (1959), 185–193. MR 105790, DOI 10.1090/S0025-5718-1959-0105790-8
Additional Information
- © Copyright 1966 American Mathematical Society
- Journal: Math. Comp. 20 (1966), 257-265
- MSC: Primary 65.30
- DOI: https://doi.org/10.1090/S0025-5718-1966-0195235-8
- MathSciNet review: 0195235