On the public citation graph

Computing with barycentric polynomials

0 signed · 44 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/bf01386381openalex-snapshot
The evaluation of the zeros of ill-conditioned polynomials. Part I
inferredcites →https://doi.org/10.1007/bf01400115openalex-snapshot
On condition numbers and the distance to the nearest ill-posed problem
inferredcites →https://doi.org/10.1007/bf01436257openalex-snapshot
On the conditioning of polynomial and rational forms
inferredcites →https://doi.org/10.1007/bf01436491openalex-snapshot
On the condition of algebraic equations
inferredcites →https://doi.org/10.1007/bf01934076openalex-snapshot
Bounds on a polynomial
inferredcites →https://doi.org/10.1016/0010-4485(89)90024-9openalex-snapshot
Curves and surfaces for computer-aided geometric design
inferredcites →https://doi.org/10.1016/0167-8396(87)90012-4openalex-snapshot
On the numerical condition of polynomials in Bernstein form
inferredcites →https://doi.org/10.1016/0167-8396(88)90016-7openalex-snapshot
Algorithms for polynomials in Bernstein form
inferredcites →https://doi.org/10.1016/0167-8396(91)90047-fopenalex-snapshot
On the stability of transformations between power and Bernstein polynomial forms
inferredcites →https://doi.org/10.1016/b978-0-12-208360-0.50008-5openalex-snapshot
Questions of Numerical Condition Related to Polynomials
inferredcites →https://doi.org/10.1016/c2009-0-22351-8openalex-snapshot
Curves and Surfaces for Computer-Aided Geometric Design
inferredcites →https://doi.org/10.1080/00029890.1961.11989812openalex-snapshot
MAA Studies in Mathematics
inferredcites →https://doi.org/10.1090/s0025-5718-1986-0842134-4openalex-snapshot
Root Neighborhoods of a Polynomial
inferredcites →https://doi.org/10.1090/s0025-5718-1990-1035933-0openalex-snapshot
On the numerical condition of Bernstein-Bézier subdivision processes
inferredcites →https://doi.org/10.1093/comjnl/15.1.71openalex-snapshot
Interactive Interpolation and Approximation by Bezier Polynomials
inferredcites →https://doi.org/10.1115/1.3424591openalex-snapshot
Catastrophe Theory and Its Applications
inferredcites →https://doi.org/10.1137/0703023openalex-snapshot
A Theory of Condition
inferredcites →https://doi.org/10.1145/321812.321824openalex-snapshot
Bernstein-Bézier Methods for the Computer-Aided Design of Free-Form Curves and Surfaces
inferredcites →https://doi.org/10.1201/9780203507643.ch7openalex-snapshot
Interpolation and Approximation
inferredcites →https://doi.org/10.12723/mjs.56.5openalex-snapshot
Bernstein Polynomials
inferredcites →https://doi.org/10.2307/2003558openalex-snapshot
The Algebraic Eigenvalue Problem
inferredcites →https://doi.org/10.2307/2003710openalex-snapshot
Elements of Numerical Analysis
inferredcites →https://doi.org/10.2307/2004299openalex-snapshot
Interpolation and Approximation
inferredcites →https://doi.org/10.2307/2987695openalex-snapshot
Catastrophe Theory and Its Applications.

What points at this work

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

inferred← citeshttps://doi.org/10.1006/aama.2001.0726openalex-snapshot
Generalized Bernstein Polynomials and Bézier Curves: An Application of Umbral Calculus to Computer Aided Geometric Design
inferred← citeshttps://doi.org/10.1007/bf03025873openalex-snapshot
Reviews
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00035-2openalex-snapshot
Approximating xn efficiently
inferred← citeshttps://doi.org/10.1016/j.cagd.2004.06.001openalex-snapshot
Recursive de Casteljau bisection and rounding errors
inferred← citeshttps://doi.org/10.1016/j.cagd.2012.03.001openalex-snapshot
The Bernstein polynomial basis: A centennial retrospective
inferred← citeshttps://doi.org/10.1016/j.cagd.2014.02.010openalex-snapshot
On a generalization of Bernstein polynomials and Bézier curves based on umbral calculus
inferred← citeshttps://doi.org/10.1016/j.cagd.2016.05.001openalex-snapshot
On a generalization of Bernstein polynomials and Bézier curves based on umbral calculus (III): Blossoming
inferred← citeshttps://doi.org/10.1016/j.cam.2007.06.027openalex-snapshot
A novel generalization of Bézier curve and surface
inferred← citeshttps://doi.org/10.1080/0025570x.2001.11953064openalex-snapshot
Using Less Calculus in Teaching Calculus: An Historical Approach
inferred← citeshttps://doi.org/10.1108/13552549610129782openalex-snapshot
Computational methods for rapid prototyping of analytic solid models
inferred← citeshttps://doi.org/10.1145/383738.383743openalex-snapshot
Algorithm 812: BPOLY
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.