On the public citation graph

A note on the Bernstein algorithm for bounds for interval polynomials

https://doi.org/10.1007/bf02253136
0 signed · 14 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/bf02253209openalex-snapshot
Bounds for an interval polynomial
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/3-540-16437-5_5openalex-snapshot
Convergent bounds for the range of multivariate polynomials
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/s11155-006-9023-4openalex-snapshot
Solving Interval Constraints by Linearization in Computer-Aided Design
inferred← citeshttps://doi.org/10.1016/b978-0-08-091636-1.50032-0openalex-snapshot
BIBLIOGRAPHY
inferred← citeshttps://doi.org/10.1016/j.automatica.2022.110305openalex-snapshot
A polynomial blossoming approach to stabilization of periodic time-varying systems
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.1109/icsse.2018.8520093openalex-snapshot
Application of Bernstein Branch-and-Bound Method to PID Controls with Maximum Stability Degree
inferred← citeshttps://doi.org/10.1109/tac.2020.3037041openalex-snapshot
A Bernstein Polynomial Approach to Estimating Reachable Set of Periodic Piecewise Polynomial Systems
inferred← citeshttps://doi.org/10.1145/384101.384123openalex-snapshot
Symbolic-interval cooperation in constraint programming
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.