On the public citation graph

Optimal computation of the Bernstein algorithm for the bound of an interval polynomial

https://doi.org/10.1007/bf02241751
0 signed · 20 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/bf02253136openalex-snapshot
A note on the Bernstein algorithm for bounds for interval polynomials
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/bf01901274openalex-snapshot
Interval Ray Tracing — a divide and conquer strategy for realistic computer graphics
inferred← citeshttps://doi.org/10.1007/bf02238236openalex-snapshot
Bernstein form is inclusion monotone
inferred← citeshttps://doi.org/10.1016/b978-0-08-091636-1.50032-0openalex-snapshot
BIBLIOGRAPHY
inferred← citeshttps://doi.org/10.1016/j.amc.2018.08.049openalex-snapshot
Matrix methods for the tensorial Bernstein form
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.1533/9780857099518.1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1533/9780857099518.109openalex-snapshot
Intersection Tests
inferred← citeshttps://doi.org/10.1533/9780857099518.13openalex-snapshot
Interval Analysis
inferred← citeshttps://doi.org/10.1533/9780857099518.185openalex-snapshot
The SCCI-Hybrid Method for 2D-Curve Tracing
inferred← citeshttps://doi.org/10.1533/9780857099518.219openalex-snapshot
Interval Versions of Bernstein Polynomials, Bézier Curves and the de Casteljau Algorithm
inferred← citeshttps://doi.org/10.1533/9780857099518.241openalex-snapshot
Robust Computations of Selected Discrete Problems
inferred← citeshttps://doi.org/10.1533/9780857099518.297openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1533/9780857099518.61openalex-snapshot
Interval Newton Methods
inferred← citeshttps://doi.org/10.1533/9780857099518.79openalex-snapshot
The Exact Sign of Sum Algorithm (ESSA)
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.