Bounds for an interval polynomial
From MaRDI portal
Publication:1241256
DOI10.1007/BF02253209zbMATH Open0365.65027OpenAlexW1556074912MaRDI QIDQ1241256FDOQ1241256
Authors: J. Rokne
Publication date: 1977
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02253209
Cites Work
Cited In (14)
- Globally minimizing polynomials without evaluating derivatives
- The range of values of a circular complex polynomial over a circular complex interval
- The range of values of a complex polynomial over a complex interval
- Global minimization of univariate functions by sequential polynomial approximation
- Bounds on a polynomial
- A note on the Bernstein algorithm for bounds for interval polynomials
- Interval approximation of higher order to the ranges of functions
- Methods for bounding the range of a polynomial
- Optimal computation of the Bernstein algorithm for the bound of an interval polynomial
- Optimality of the centered form for polynomials
- Bernstein form is inclusion monotone
- Lower bound functions for polynomials
- Rational circular complex centered forms
- Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison
This page was built for publication: Bounds for an interval polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1241256)