Abstract
An algorithm for rational L1 approximation on an interval is obtained by adapting Loeb's weighted minimax algorithm for rational Chebyshev approximation on an interval. Sufficient conditions for the algorithm to fail are given.
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
