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