A note on the Bernstein algorithm for bounds for interval polynomials
From MaRDI portal
Publication:1251447
DOI10.1007/BF02253136zbMath0391.65001MaRDI QIDQ1251447
Publication date: 1979
Published in: Computing (Search for Journal in Brave)
Bernstein Algorithm; Bernstein Polynomials; Finite Differencelike Scheme; Interval Polynomials; Range of a Polynomial
65G30: Interval and finite arithmetic
65D20: Computation of special functions and constants, construction of tables
41A17: Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities)
Related Items
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, Bernstein form is inclusion monotone
Cites Work