Pages that link to "Item:Q1659050"
From MaRDI portal
The following pages link to Efficient rational quadratic clipping method for computing roots of a polynomial (Q1659050):
Displaying 8 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)
- A quadratic clipping step with superquadratic convergence for bivariate polynomial systems (Q691650) (← links)
- Computing roots of polynomials by quadratic clipping (Q733402) (← links)
- A rational cubic clipping method for computing real roots of a polynomial (Q1632370) (← links)
- An improved rational cubic clipping method for computing real roots of a polynomial (Q2008914) (← links)
- Polynomials root-finding using a SLEFE-based clipping method (Q2397808) (← links)
- An efficient algorithm for computing the roots of general quadratic, cubic and quartic equations (Q5247640) (← links)