Abstract
Methods for constructing best nonlinear Chebyshev approximations are discussed. It is shown that local strong unicity is sufficient to guarantee "good numerical behaviour" of the algorithms. Applications are given for approximations by splines with free knots, rational functions, and exponential sums as well as for the approximation of functions defined by differential equations.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
