A heuristic method for certifying isolated zeros of polynomial systems
From MaRDI portal
By transforming the given over-determined system into a square one, the authors provide necessary and sufficient conditions to certify the simple roots of the over-determined system by certifying the simple roots of the square system. Based on their previous research, the authors propose a heuristic method for certifying not only the isolated singular zeros of polynomial systems, but also the multiplicity structures of the isolated singular zeros. Various numerical examples are presented.
Recommendations
- An algorithm for finding all isolated zeros of polynomial systems
- Certifying simple zeros of over-determined polynomial systems
- A new deflation method for verifying the isolated singular zeros of polynomial systems
- scientific article; zbMATH DE number 4080774
- Deflation and certified isolation of singular zeros of polynomial systems
- On some methods for the simultaneous determination of polynomial zeros
- A generic position based method for real root isolation of zero-dimensional polynomial systems
- On isolation of simple multiple zeros and clusters of zeros of polynomial systems
- scientific article; zbMATH DE number 834504
- A new algorithm for computing certified numerical approximations of the roots of a zero-dimensional system
Cites work
- A new deflation method for verifying the isolated singular zeros of polynomial systems
- A numerical method for branch points of a system of nonlinear algebraic equations
- A Test for Existence of Solutions to Nonlinear Systems
- Algorithm 921: alphaCertified: certifying solutions to polynomial systems
- Certifying isolated singular points and their multiplicity structure
- Certifying simple zeros of over-determined polynomial systems
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- Computing multiple roots of inexact polynomials
- Computing rational points in convex semialgebraic sets and sum of squares decompositions
- Computing sum of squares decompositions with rational coefficients
- Computing the multiplicity structure in solving polynomial systems
- Deflation algorithm for the multiple roots of a system of nonlinear equations
- Deflation and certified isolation of singular zeros of polynomial systems
- Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
- Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars
- Formal Proofs for Nonlinear Optimization
- scientific article; zbMATH DE number 3963074 (Why is no real title available?)
- scientific article; zbMATH DE number 1372782 (Why is no real title available?)
- scientific article; zbMATH DE number 3992817 (Why is no real title available?)
- Interval solution of nonlinear equations using linear programming
- Isosingular sets and deflation
- Multiple zeros of nonlinear systems
- Newton's method for overdetermined systems of equations
- Newton's method with deflation for isolated singularities of polynomial systems
- On deflation and multiplicity structure
- On location and approximation of clusters of zeros: Case of embedding dimension one
- On the Generation of Positivstellensatz Witnesses in Degenerate Cases
- Positive Definiteness and Stability of Interval Matrices
- Verified error bounds for isolated singular solutions of polynomial systems
- Verified error bounds for multiple roots of systems of nonlinear equations
Cited in
(4)
This page was built for publication: A heuristic method for certifying isolated zeros of polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1634514)
