A quadratic clipping step with superquadratic convergence for bivariate polynomial systems

DOI10.1007/S11786-011-0091-4MaRDI QIDQ691650zbMATH OpenOpenAlexFDO

Authors M. C. Fu

Publication date 3 December 2012

Published in Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11786-011-0091-4

zbMATH Keywords

polynomialroot findingBézier clipping

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of roots of polynomial equations (65H04)

Recommendations

• Computing roots of polynomials by quadratic clipping
• Fast approach for computing roots of polynomials using cubic clipping
• Certified numerical real root isolation for bivariate polynomial systems
• Efficient rational quadratic clipping method for computing roots of a polynomial
• A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis

Cites work

• scientific article; zbMATH DE number 491264 (Why is no real title available?)
• scientific article; zbMATH DE number 2151220 (Why is no real title available?)
• scientific article; zbMATH DE number 5019917 (Why is no real title available?)
• scientific article; zbMATH DE number 5245181 (Why is no real title available?)
• A new efficient algorithm for computing Gröbner bases (F₄)
• Complexity of real root isolation using continued fractions
• Computation of the solutions of nonlinear polynomial systems
• Computing roots of polynomials by quadratic clipping
• Deflation algorithm for the multiple roots of a system of nonlinear equations
• Deflation and certified isolation of singular zeros of polynomial systems
• Efficient isolation of polynomial's real roots.
• Evaluation algorithms for multivariate polynomials in Bernstein-Bézier form
• Investigation of a subdivision based algorithm for solving systems of polynomial equations.
• Nearest multivariate system with given root multiplicities
• On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers
• On location and approximation of clusters of zeros: Case of embedding dimension one
• On the complexity of real root isolation using continued fractions
• On the optimal stability of the Bernstein basis
• Optimized refinable enclosures of multivariate polynomial pieces
• Quadratic Newton iteration for systems with multiplicity
• Solving zero-dimensional systems through the rational univariate representation
• Subdivision methods for solving polynomial equations
• Symbolic-numeric methods for solving polynomial equations and applications
• Verified error bounds for multiple roots of systems of nonlinear equations

Cited in

(2)

• Computing roots of polynomials by quadratic clipping
• Bézier clipping is quadratically convergent

Describes a project that uses

Uses Software

• ISOLATE

This page was built for publication: A quadratic clipping step with superquadratic convergence for bivariate polynomial systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691650)