A heuristic method for certifying isolated zeros of polynomial systems
From MaRDI portal
Publication:1634514
DOI10.3390/math6090166zbMath1405.65073OpenAlexW2883255855MaRDI QIDQ1634514
Publication date: 18 December 2018
Published in: Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/math6090166
Uses Software
Cites Work
- Isosingular sets and deflation
- Deflation algorithm for the multiple roots of a system of nonlinear equations
- Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
- On location and approximation of clusters of zeros: Case of embedding dimension one
- A numerical method for branch points of a system of nonlinear algebraic equations
- Interval solution of nonlinear equations using linear programming
- Certifying simple zeros of over-determined polynomial systems
- A new deflation method for verifying the isolated singular zeros of polynomial systems
- Computing sum of squares decompositions with rational coefficients
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- Newton's method with deflation for isolated singularities of polynomial systems
- On deflation and multiplicity structure
- Certifying Isolated Singular Points and their Multiplicity Structure
- Verified Error Bounds for Isolated Singular Solutions of Polynomial Systems
- Algorithm 921
- Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions
- On the Generation of Positivstellensatz Witnesses in Degenerate Cases
- Multiple zeros of nonlinear systems
- A Test for Existence of Solutions to Nonlinear Systems
- Positive Definiteness and Stability of Interval Matrices
- Computing multiple roots of inexact polynomials
- Newton's method for overdetermined systems of equations
- Formal Proofs for Nonlinear Optimization
- Deflation and certified isolation of singular zeros of polynomial systems
- Computing the multiplicity structure in solving polynomial systems
- Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars
- Verified error bounds for multiple roots of systems of nonlinear equations
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A heuristic method for certifying isolated zeros of polynomial systems
