Computing roots of polynomials by quadratic clipping
From MaRDI portal
Recommendations
- Fast approach for computing roots of polynomials using cubic clipping
- Efficient rational quadratic clipping method for computing roots of a polynomial
- A quadratic clipping step with superquadratic convergence for bivariate polynomial systems
- A rational cubic clipping method for computing real roots of a polynomial
- Rational cubic clipping with linear complexity for computing roots of polynomials
Cites work
- A bibliography on roots of polynomials
- Computation of the solutions of nonlinear polynomial systems
- Constrained polynomial degree reduction in the \(L_2\)-norm equals best weighted Euclidean approximation of Bézier coefficients
- Curve intersection using Bézier clipping
- Degree reduction of Bézier curves
- Efficient topology determination of implicitly defined algebraic plane curves.
- scientific article; zbMATH DE number 1716506 (Why is no real title available?)
- scientific article; zbMATH DE number 1813012 (Why is no real title available?)
- scientific article; zbMATH DE number 491264 (Why is no real title available?)
- scientific article; zbMATH DE number 1061412 (Why is no real title available?)
- scientific article; zbMATH DE number 2064526 (Why is no real title available?)
- scientific article; zbMATH DE number 2149738 (Why is no real title available?)
- scientific article; zbMATH DE number 2109418 (Why is no real title available?)
- Matrix representation for multi-degree reduction of Bézier curves
- On the optimal stability of the Bernstein basis
- Polynomial degree reduction in the L₂-norm equals best Euclidean approximation of Bézier coefficients
- The B-spline basis in a space of algebraic polynomials
- The dual basis functions for the Bernstein polynomials
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
Cited in
(28)- A rational cubic clipping method for computing real roots of a polynomial
- Revisiting the problem of zeros of univariate scalar Béziers
- Efficient rational quadratic clipping method for computing roots of a polynomial
- 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
- Fast and accurate evaluation of dual Bernstein polynomials
- 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
- Revisiting the stability of computing the roots of a quadratic polynomial
- Polynomials root-finding using a SLEFE-based clipping method
- Improved subdivision scheme for the root computation of univariate polynomial equations
- Construction of dual B-spline functions
- Real roots of quadratic interval polynomials
- Bézier representation of the constrained dual Bernstein polynomials
- Fat Arcs for Implicitly Defined Curves
- The computation of multiple roots of a Bernstein basis polynomial
- On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers
- Bézier clipping is quadratically convergent
- Fast approach for computing roots of polynomials using cubic clipping
- An Algorithm for the Intersection Problem of Planar Parametric Curves
- Rational cubic clipping with linear complexity for computing roots of polynomials
- Progressive explicit formulae for root-finding problems based on reparameterization
- A quadratic clipping step with superquadratic convergence for bivariate polynomial systems
- A reliable method for finding intersections of 2D NURBS curves
- Dual Gauss-Legendre polynomials
- Real-time rendering of algebraic B-spline surfaces via Bézier point insertion
This page was built for publication: Computing roots of polynomials by quadratic clipping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733402)
