Computing roots of polynomials by quadratic clipping
From MaRDI portal
Publication:733402
DOI10.1016/j.cagd.2007.01.003zbMath1171.65395OpenAlexW1998665561MaRDI QIDQ733402
Publication date: 16 October 2009
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cagd.2007.01.003
Related Items
A rational cubic clipping method for computing real roots of a polynomial ⋮ Revisiting the problem of zeros of univariate scalar Béziers ⋮ Polynomials root-finding using a SLEFE-based clipping method ⋮ Real-time rendering of algebraic B-spline surfaces via Bézier point insertion ⋮ Bézier clipping is quadratically convergent ⋮ Fast approach for computing roots of polynomials using cubic clipping ⋮ Bézier representation of the constrained dual Bernstein polynomials ⋮ Improved subdivision scheme for the root computation of univariate polynomial equations ⋮ Rational cubic clipping with linear complexity for computing roots of polynomials ⋮ A quadratic clipping step with superquadratic convergence for bivariate polynomial systems ⋮ On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers ⋮ An improved rational cubic clipping method for computing real roots of a polynomial ⋮ Simple algorithms for computing the Bézier coefficients of the constrained dual Bernstein polynomials ⋮ Fat Arcs for Implicitly Defined Curves ⋮ Construction of dual \(B\)-spline functions ⋮ Fast and accurate evaluation of dual Bernstein polynomials ⋮ The Computation of Multiple Roots of a Bernstein Basis Polynomial ⋮ Some new symmetric equilateral embeddings of Platonic and Archimedean polyhedra ⋮ Differential-recurrence properties of dual Bernstein polynomials ⋮ Extending the usage of Newton's method with applications to the solution of Bratu's equation ⋮ Hybrid second order method for orthogonal projection onto parametric curve in \(n\)-dimensional Euclidean space
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Curve intersection using Bézier clipping
- The dual basis functions for the Bernstein polynomials
- A bibliography on roots of polynomials
- Computation of the solutions of nonlinear polynomial systems
- Polynomial degree reduction in the \(L_2\)-norm equals best Euclidean approximation of Bézier coefficients
- The B-spline basis in a space of algebraic polynomials
- Efficient topology determination of implicitly defined algebraic plane curves.
- Constrained polynomial degree reduction in the \(L_2\)-norm equals best weighted Euclidean approximation of Bézier coefficients
- Matrix representation for multi-degree reduction of Bézier curves
- On the optimal stability of the Bernstein basis
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Degree reduction of Bézier curves
