On the public citation graph

Bounds for an interval polynomial

https://doi.org/10.1007/bf02253209
0 signed · 29 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf02241731openalex-snapshot
Die Berechnung von Schranken für den Wertebereich eines Polynoms in einem Intervall
inferredcites →https://doi.org/10.1007/bf02242301openalex-snapshot
Reducing the degree of an interval polynomial
inferredcites →https://doi.org/10.1007/bf02316911openalex-snapshot
Gleichheit von Produkt und Formalprodukt bei Intervallpolynomen
inferredcites →https://doi.org/10.6028/jres.074b.006openalex-snapshot
Bounds on a polynomial

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11425076_6openalex-snapshot
A Comparison of Methods for the Computation of Affine Lower Bound Functions for Polynomials
inferred← citeshttps://doi.org/10.1007/3-540-16437-5_5openalex-snapshot
Convergent bounds for the range of multivariate polynomials
inferred← citeshttps://doi.org/10.1007/978-1-4615-2025-2_9openalex-snapshot
Lipschitz Optimization
inferred← citeshttps://doi.org/10.1007/bf01581203openalex-snapshot
Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison
inferred← citeshttps://doi.org/10.1007/bf01934076openalex-snapshot
Bounds on a polynomial
inferred← citeshttps://doi.org/10.1007/bf02238236openalex-snapshot
Bernstein form is inclusion monotone
inferred← citeshttps://doi.org/10.1007/bf02241751openalex-snapshot
Optimal computation of the Bernstein algorithm for the bound of an interval polynomial
inferred← citeshttps://doi.org/10.1007/bf02252094openalex-snapshot
The range of values of a circular complex polynomial over a circular complex interval
inferred← citeshttps://doi.org/10.1007/bf02253127openalex-snapshot
The range of values of a complex polynomial over a complex interval
inferred← citeshttps://doi.org/10.1007/bf02253136openalex-snapshot
A note on the Bernstein algorithm for bounds for interval polynomials
inferred← citeshttps://doi.org/10.1016/0021-9045(81)90111-8openalex-snapshot
Optimality of the centered form for polynomials
inferred← citeshttps://doi.org/10.1016/0041-5553(82)90036-2openalex-snapshot
The iterative solution of initial value problems for ordinary differential equations
inferred← citeshttps://doi.org/10.1016/0377-0427(87)90108-7openalex-snapshot
Rational circular complex centered forms
inferred← citeshttps://doi.org/10.1016/0377-0427(93)e0270-vopenalex-snapshot
Methods for bounding the range of a polynomial
inferred← citeshttps://doi.org/10.1016/0898-1221(96)00020-xopenalex-snapshot
Interval approximation of higher order to the ranges of functions
inferred← citeshttps://doi.org/10.1016/b978-0-08-091636-1.50032-0openalex-snapshot
BIBLIOGRAPHY
inferred← citeshttps://doi.org/10.1016/b978-0-12-518850-0.50042-1openalex-snapshot
OPTIMALITY OF THE CENTERED FORM
inferred← citeshttps://doi.org/10.1016/j.ifacol.2018.08.048openalex-snapshot
Algorithm for Bernstein Polynomial Control Design
inferred← citeshttps://doi.org/10.1016/s0377-0427(03)00422-9openalex-snapshot
Lower bound functions for polynomials
inferred← citeshttps://doi.org/10.1023/a:1009934614393openalex-snapshot
Application of Bernstein Expansion to the Solution of Control Problems
inferred← citeshttps://doi.org/10.1023/a:1009942430877openalex-snapshot
Bounds for the Range of a Bivariate Polynomial over a Triangle
inferred← citeshttps://doi.org/10.1080/00207168508803469openalex-snapshot
Globally minimizing polynomials without evaluating derivatives
inferred← citeshttps://doi.org/10.1080/00207168908803738openalex-snapshot
Global minimization of univariate functions by sequential polynomial approximation
inferred← citeshttps://doi.org/10.1109/9.661615openalex-snapshot
Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion
inferred← citeshttps://doi.org/10.7907/c196-9r88.openalex-snapshot
Towards more efficient interval analysis: corner forms and a remainder interval newton method
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.