A quadratic clipping step with superquadratic convergence for bivariate polynomial systems
DOI10.1007/S11786-011-0091-4zbMATH Open1254.65062OpenAlexW2039189438MaRDI QIDQ691650FDOQ691650
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
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
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)
Cites Work
- Efficient isolation of polynomial's real roots.
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Title not available (Why is that?)
- On the optimal stability of the Bernstein basis
- Nearest multivariate system with given root multiplicities
- Solving zero-dimensional systems through the rational univariate representation
- Quadratic Newton iteration for systems with multiplicity
- Title not available (Why is that?)
- Deflation algorithm for the multiple roots of a system of nonlinear equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers
- Investigation of a subdivision based algorithm for solving systems of polynomial equations.
- Deflation and certified isolation of singular zeros of polynomial systems
- On location and approximation of clusters of zeros: Case of embedding dimension one
- Subdivision methods for solving polynomial equations
- Complexity of real root isolation using continued fractions
- On the complexity of real root isolation using continued fractions
- Verified error bounds for multiple roots of systems of nonlinear equations
- Computation of the solutions of nonlinear polynomial systems
- Computing roots of polynomials by quadratic clipping
- Optimized refinable enclosures of multivariate polynomial pieces
- Evaluation algorithms for multivariate polynomials in Bernstein-Bézier form
- Symbolic-numeric methods for solving polynomial equations and applications
Cited In (2)
Uses Software
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)
