On the Convergence of Exchange Algorithms for Calculating Minimax Approximations
On the Convergence of Exchange Algorithms for Calculating Minimax Approximations
Given a function f(x) and a range of the variable, S, the general minimax approximation problem is to determine that function of a class, C, which is the best approximation to f(x) in the sense that the maximum error of the approximation as x ranges over S is minimized. We …