Optimal computation of the Bernstein algorithm for the bound of an interval polynomial
From MaRDI portal
Publication:1159437
DOI10.1007/BF02241751zbMath0475.65007MaRDI QIDQ1159437
Publication date: 1982
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02241751
65G30: Interval and finite arithmetic
41A17: Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities)
41A10: Approximation by polynomials
65D15: Algorithms for approximation of functions
Related Items
Lower bound functions for polynomials, Bernstein form is inclusion monotone, Matrix methods for the tensorial Bernstein form
Cites Work