Pages that link to "Item:Q625270"
From MaRDI portal
The following pages link to Fast approach for computing roots of polynomials using cubic clipping (Q625270):
Displaying 11 items.
- Bézier representation of the constrained dual Bernstein polynomials (Q427030) (← links)
- Rational cubic clipping with linear complexity for computing roots of polynomials (Q668578) (← links)
- Real-time rendering of algebraic B-spline surfaces via Bézier point insertion (Q893616) (← links)
- A rational cubic clipping method for computing real roots of a polynomial (Q1632370) (← links)
- Revisiting the problem of zeros of univariate scalar Béziers (Q1632405) (← links)
- An improved rational cubic clipping method for computing real roots of a polynomial (Q2008914) (← links)
- Simple algorithms for computing the Bézier coefficients of the constrained dual Bernstein polynomials (Q2017918) (← links)
- Fast and accurate evaluation of dual Bernstein polynomials (Q2035506) (← links)
- Differential-recurrence properties of dual Bernstein polynomials (Q2335780) (← links)
- Polynomials root-finding using a SLEFE-based clipping method (Q2397808) (← links)
- Construction of dual \(B\)-spline functions (Q2511206) (← links)
