Real Root Isolation of Polynomial Equations Based on Hybrid Computation
From MaRDI portal
Abstract: A new algorithm for real root isolation of polynomial equations based on hybrid computation is presented in this paper. Firstly, the approximate (complex) zeros of the given polynomial equations are obtained via homotopy continuation method. Then, for each approximate zero, an initial box relying on the Kantorovich theorem is constructed, which contains the corresponding accurate zero. Finally, the Krawczyk interval iteration with interval arithmetic is applied to the initial boxes so as to check whether or not the corresponding approximate zeros are real and to obtain the real root isolation boxes. Meanwhile, an empirical construction of initial box is provided for higher performance. Our experiments on many benchmarks show that the new hybrid method is more efficient, compared with the traditional symbolic approaches.
Recommendations
- scientific article; zbMATH DE number 1253988
- An improved algorithm for real root isolation of univariate polynomials
- scientific article; zbMATH DE number 1263299
- A new method for real root isolation of univariate polynomials
- Certified numerical real root isolation for bivariate polynomial systems
- Polynomial real root isolation by means of root radii approximation
- Real root isolation of multi-exponential polynomials with application
- scientific article; zbMATH DE number 1263360
- An efficient real root isolation algorithm for a zero-dimensional triangular polynomial system
- Efficient isolation of polynomial's real roots.
Cites work
- Algorithm 921: alphaCertified: certifying solutions to polynomial systems
- An algorithm for isolating the real solutions of semi-algebraic systems
- Certified numerical homotopy tracking
- scientific article; zbMATH DE number 1096865 (Why is no real title available?)
- Introduction to Interval Analysis
- Multiple zeros of nonlinear systems
- Newton's method with deflation for isolated singularities of polynomial systems
- On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers
- Optimal Error Bounds for the Newton–Kantorovich Theorem
- Real solution isolation using interval arithmetic
- Robust certified numerical homotopy tracking
- Root isolation of zero-dimensional polynomial systems with linear univariate representation
- Solving Real Polynomial Systems with Real Homotopies
- Solving zero-dimensional systems through the rational univariate representation
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Verification methods: rigorous results using floating-point arithmetic
Cited in
(9)- A hybrid procedure for finding real points on a real algebraic set
- Visualizing planar and space implicit real algebraic curves with singularities
- Real root isolation of regular chains
- scientific article; zbMATH DE number 1253988 (Why is no real title available?)
- scientific article; zbMATH DE number 1263299 (Why is no real title available?)
- On the maximum computing time of the bisection method for real root isolation
- Bound the number of limit cycles bifurcating from center of polynomial Hamiltonian system via interval analysis
- VerifyRealRoots: a Matlab package for computing verified real solutions of polynomials systems of equations and inequalities
- Early Ending in Homotopy Path-Tracking for Real Roots
This page was built for publication: Real Root Isolation of Polynomial Equations Based on Hybrid Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2799571)
