Pages that link to "Item:Q1632370"
From MaRDI portal
The following pages link to A rational cubic clipping method for computing real roots of a polynomial (Q1632370):
Displaying 10 items.
- Fast approach for computing roots of polynomials using cubic clipping (Q625270) (← links)
- Rational cubic clipping with linear complexity for computing roots of polynomials (Q668578) (← links)
- Computing roots of polynomials by quadratic clipping (Q733402) (← links)
- Revisiting the problem of zeros of univariate scalar Béziers (Q1632405) (← links)
- Efficient rational quadratic clipping method for computing roots of a polynomial (Q1659050) (← links)
- An improved rational cubic clipping method for computing real roots of a polynomial (Q2008914) (← links)
- Piecewise quadratic bounding functions for finding real roots of polynomials (Q2146436) (← links)
- Convergence analysis on a second order algorithm for orthogonal projection onto curves (Q2333415) (← links)
- Polynomials root-finding using a SLEFE-based clipping method (Q2397808) (← links)
- The Computation of Multiple Roots of a Bernstein Basis Polynomial (Q5216781) (← links)