Optimal computation of the Bernstein algorithm for the bound of an interval polynomial

DOI10.1007/BF02241751zbMath0475.65007MaRDI QIDQ1159437

Jon G. Rokne

Publication date: 1982

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

upper and lower bounds; Bernstein polynomial; interval polynomials; Bernstein coefficients

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Bounds for an interval polynomial
• A note on the Bernstein algorithm for bounds for interval polynomials
• Bounds on a polynomial