An a posteriori certification algorithm for Newton homotopies
From MaRDI portal
Publication:3452402
Recommendations
Cites work
- scientific article; zbMATH DE number 1952952 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
- Cylindrical algebraic decomposition using validated numerics
- Definability and decision problems in arithmetic
- On Computable Numbers, with an Application to the Entscheidungsproblem
- The Jordan Curve Theorem, Formally and Informally
Cited in
(13)- Computing complex and real tropical curves using monodromy
- Certification Using Newton-Invariant Subspaces
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization
- On the equations defining some Hilbert schemes
- Using monodromy to recover symmetries of polynomial systems
- An approach for certifying homotopy continuation paths. Univariate case
- A primal-dual formulation for certifiable computations in Schubert calculus
- Mixed cell computation in HOM4ps
- Foreword. What is numerical algebraic geometry?
- Numerical computation of Galois groups
- Certified predictor-corrector tracking for Newton homotopies
- Using monodromy to statistically estimate the number of solutions
This page was built for publication: An a posteriori certification algorithm for Newton homotopies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452402)