Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
From MaRDI portal
Publication:2399868
DOI10.1016/j.jsc.2017.03.004zbMath1415.65121arXiv1408.2721OpenAlexW2963876558WikidataQ47036991 ScholiaQ47036991MaRDI QIDQ2399868
Tulay Ayyildiz Akoglu, Jonathan D. Hauenstein, Agnes Szanto
Publication date: 24 August 2017
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.2721
rational univariate representationpolynomial systemsingular solutionscertificationoverdeterminedisosingular deflation
Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Nonlinear algebraic or transcendental equations (65H99)
Related Items
Certification for polynomial systems via square subsystems, A heuristic method for certifying isolated zeros of polynomial systems, Improved two-step Newton's method for computing simple multiple zeros of polynomial systems, A certified iterative method for isolated singular roots, VerifyRealRoots: a Matlab package for computing verified real solutions of polynomials systems of equations and inequalities, Two-step Newton's method for deflation-one singular zeros of analytic systems, Certified Hermite matrices from approximate roots, On isolation of simple multiple zeros and clusters of zeros of polynomial systems, Certified Hermite Matrices from Approximate Roots - Univariate Case
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Isosingular sets and deflation
- Verified error bounds for isolated singular solutions of polynomial systems: case of breadth one
- Modified deflation algorithm for the solution of singular problems. I. A system of nonlinear algebraic equations
- 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
- Certified predictor-corrector tracking for Newton homotopies
- Generalised characteristic polynomials
- EUROCAL '85. European Conference on Computer Algebra, Linz, Austria, April 1-3, 1985. Proceedings. Vol. 2: Research contributions
- A p-adic approach to the computation of Gröbner bases
- Factoring polynomials with rational coefficients
- Solving zero-dimensional systems through the rational univariate representation
- Lower bounds for diophantine approximations
- Straight-line programs in geometric elimination theory
- Interval solution of nonlinear equations using linear programming
- Modular algorithms for computing Gröbner bases.
- Sharp estimates for the arithmetic Nullstellensatz
- Bounds on factors in \(\mathbb Z[x\)]
- Robust certified numerical homotopy tracking
- Deformation techniques for efficient polynomial equation solving.
- Seven mutually touching infinite cylinders
- On the minimum of a positive polynomial over the standard simplex
- Computing sum of squares decompositions with rational coefficients
- Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin)
- Newton's method with deflation for isolated singularities of polynomial systems
- Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
- Certifying Isolated Singular Points and their Multiplicity Structure
- Modern Computer Algebra
- Lower bounds for zero-dimensional projections
- Certified Numerical Homotopy Tracking
- Verified Error Bounds for Isolated Singular Solutions of Polynomial Systems
- Verified error bounds for real solutions of positive-dimensional polynomial systems
- Algorithm 921
- Analysis of Newton’s Method at Irregular Singularities
- Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions
- On the Generation of Positivstellensatz Witnesses in Degenerate Cases
- An a posteriori certification algorithm for Newton homotopies
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
- Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
- A Test for Existence of Solutions to Nonlinear Systems
- Analysis of PSLQ, an integer relation finding algorithm
- On Rational Number Reconstruction and Approximation
- Sharp estimates for triangular sets
- Acceleration of Euclidean Algorithm and Rational Number Reconstruction
- Sur la complexité du principe de Tarski-Seidenberg
- Newton's method for overdetermined systems of equations
- Exact solutions to linear systems of equations using output sensitive lifting
- Formal Proofs for Nonlinear Optimization
- Vector rational number reconstruction
- Deflation and certified isolation of singular zeros of polynomial systems
- Computing the multiplicity structure in solving polynomial systems
- Half-GCD and fast rational recovery
- Recovering Exact Results from Inexact Numerical Data in Algebraic Geometry
- On the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set and Applications
- Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- A Gröbner free alternative for polynomial system solving
- Kronecker's and Newton's approaches to solving: a first comparison
- Verified error bounds for multiple roots of systems of nonlinear equations
