Near-Minimax Polynomial Approximations and Partitioning of Intervals A method of near-minimax polynomial approximation is described. As a by-product, this method provides a formula for an estimate of the maximum error associated with a given degree of approximation. Using this formula, a partitioning algorithm is obtained for dividing a basic interval into subintervals for which approximations of equal degree give equal maximum error. CACM August, 1964 Fraser, W. Hart, J. F. CA640815 JB March 9, 1978 6:41 PM 1015 4 1015 1346 4 1015 1440 4 1015 1645 4 1015 951 4 1015 1015 5 1015 1015 5 1015 1015 5 1015 532 5 1015