An improved rational cubic clipping method for computing real roots of a polynomial
From MaRDI portal
Publication:2008914
Recommendations
- A rational cubic clipping method for computing real roots of a polynomial
- Rational cubic clipping with linear complexity for computing roots of polynomials
- Efficient rational quadratic clipping method for computing roots of a polynomial
- Fast approach for computing roots of polynomials using cubic clipping
- Computing roots of polynomials by quadratic clipping
Cites work
- A rational cubic clipping method for computing real roots of a polynomial
- Computing roots of polynomials by quadratic clipping
- Curve intersection using Bézier clipping
- Fast approach for computing roots of polynomials using cubic clipping
- On the optimal stability of the Bernstein basis
- Parallel robots.
- Rational cubic clipping with linear complexity for computing roots of polynomials
- The dual basis functions for the Bernstein polynomials
Cited in
(7)- A rational cubic clipping method for computing real roots of a polynomial
- Efficient rational quadratic clipping method for computing roots of a polynomial
- Polynomials root-finding using a SLEFE-based clipping method
- Explicit formulae for progressively computing a real root of the smooth function
- Fast approach for computing roots of polynomials using cubic clipping
- Rational cubic clipping with linear complexity for computing roots of polynomials
- Progressive explicit formulae for root-finding problems based on reparameterization
This page was built for publication: An improved rational cubic clipping method for computing real roots of a polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2008914)