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 5 items.
- 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)
