A note on the Bernstein algorithm for bounds for interval polynomials

DOI10.1007/BF02253136zbMath0391.65001OpenAlexW80325070MaRDI QIDQ1251447

Jon G. Rokne

Publication date: 1979

Published in: Computing (Search for Journal in Brave)

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

zbMATH Keywords

Bernstein AlgorithmBernstein PolynomialsFinite Differencelike SchemeInterval PolynomialsRange of a Polynomial

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Computation of special functions and constants, construction of tables (65D20) Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities) (41A17)

Related Items (6)

A polynomial blossoming approach to stabilization of periodic time-varying systems ⋮ Bernstein form is inclusion monotone ⋮ Solving interval constraints by linearization in computer-aided design ⋮ The range of values of a circular complex polynomial over a circular complex interval ⋮ Optimal computation of the Bernstein algorithm for the bound of an interval polynomial ⋮ The range of values of a complex polynomial over a complex interval

Cites Work

• Bounds for an interval polynomial
• Die Berechnung von Schranken für den Wertebereich eines Polynoms in einem Intervall
• Bernstein form of a polynomial
• Bounds on a polynomial

This page was built for publication: A note on the Bernstein algorithm for bounds for interval polynomials