scientific article; zbMATH DE number 3942139

From MaRDI portal
Publication:3712892





[For the entire collection see Zbl 0572.00008.] The author makes some remarks on the complexity of an exchange algorithm for Chebychev approximation. This algorithm constructs the best polynomial of uniform approximation to a continuous function defined on a closed interval or a finite point set of real numbers. The author considers the simplest method of an exchange algorithm.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3712892)