Pages that link to "Item:Q668578"
From MaRDI portal
The following pages link to Rational cubic clipping with linear complexity for computing roots of polynomials (Q668578):
Displaying 10 items.
- Bézier clipping is quadratically convergent (Q625153) (← links)
- Fast approach for computing roots of polynomials using cubic clipping (Q625270) (← links)
- Computing roots of polynomials by quadratic clipping (Q733402) (← links)
- A rational cubic clipping method for computing real roots of a polynomial (Q1632370) (← 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)
- An approach to computing multipoint inversion and multiray surface intersection on parametric surface (Q2298351) (← 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)