Abstract
In order to solve the linear approximation problem the Remes-algorithm is quite suitable in case of a Haar subspace. Without this assumption one must modify the algorithm even to ensure the practicability (cf. [8]). In this paper, a modification, in some respect similar to that in [8], will be given which is always practicable and the convergence of which is proved, too. The relation to the Remes-algorithm will be evident from a geometrical interpretation.
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
