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

DOI10.1007/BF02241751zbMath0475.65007OpenAlexW1562522937MaRDI QIDQ1159437

Jon G. Rokne

Publication date: 1982

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02241751

zbMATH Keywords

upper and lower boundsBernstein polynomialinterval polynomialsBernstein coefficients

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities) (41A17) Approximation by polynomials (41A10) Algorithms for approximation of functions (65D15)

Related Items

Bernstein form is inclusion monotone ⋮ Lower bound functions for polynomials ⋮ Matrix methods for the tensorial Bernstein form

Cites Work

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