Foreword. What is numerical algebraic geometry?
From MaRDI portal
Publication:507158
DOI10.1016/j.jsc.2016.07.015zbMath1360.00098OpenAlexW2460491083MaRDI QIDQ507158
No author found.
Publication date: 3 February 2017
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2016.07.015
multiplicityhomotopy continuationpolynomial systemalgebraic setirreducible componentnumerical algebraic geometrynumber fieldprimary decompositionalgebraic varietywitness setgeneric pointcascade homotopynumerical irreducible decomposition
Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to numerical analysis (65-06) Proceedings, conferences, collections, etc. pertaining to algebraic geometry (14-06) Computational aspects in algebraic geometry (14Q99)
Related Items
Early Ending in Homotopy Path-Tracking for Real Roots, Schottky algorithms: Classical meets tropical, 96120 : The degree of the linear orbit of a cubic surface, Computing periods of hypersurfaces, On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization, Epsilon local rigidity and numerical algebraic geometry
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Isosingular sets and deflation
- Numerically deciding the arithmetically Cohen-Macaulayness of a projective scheme
- Decoupling highly structured polynomial systems
- Mixed cell computation in HOM4ps
- Parallel degree computation for binomial systems
- Critical points via monodromy and local methods
- Certifying solutions to square systems of polynomial-exponential equations
- A lifted square formulation for certifiable Schubert calculus
- Eliminating dual spaces
- 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
- Witness sets of projections
- Regenerative cascade homotopies for solving polynomial systems
- On a problem posed by Steve Smale
- Bernstein's theorem in affine space
- Irreducible decomposition of curves
- On location and approximation of clusters of zeros: Case of embedding dimension one
- Certified predictor-corrector tracking for Newton homotopies
- On Smale's 17th problem: a probabilistic positive solution
- Exceptional sets and fiber products
- HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
- A power series method for computing singular solutions to nonlinear analytic systems
- Computing singular solutions to polynomial systems
- Polyhedral end games for polynomial continuation
- Complexity of Bezout's theorem. V: Polynomial time
- The adjunction theory of complex projective varieties
- Numerical homotopies to compute generic points on positive dimensional algebraic sets
- Comparison of probabilistic algorithms for analyzing the components of an affine algebraic variety
- Quadratic Newton iteration for systems with multiplicity
- Robust certified numerical homotopy tracking
- Numerical algebraic geometry
- Complexity of Bezout's theorem. III: Condition number and packing
- An intrinsic homotopy for intersecting algebraic varieties
- Numerically intersecting algebraic varieties via witness sets
- Newton's method with deflation for isolated singularities of polynomial systems
- Computing singular solutions to nonlinear analytic systems
- Semi-numerical absolute factorization of polynomials with integer coefficients
- Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
- Numerical Local Irreducible Decomposition
- Numerically Testing Generically Reduced Projective Schemes for the Arithmetic Gorenstein Property
- Certifying Isolated Singular Points and their Multiplicity Structure
- Hom4PS-3: A Parallel Numerical Solver for Systems of Polynomial Equations Based on Polyhedral Homotopy Continuation Methods
- Computing Isolated Singular Solutions of Polynomial Systems: Case of Breadth One
- Certified Numerical Homotopy Tracking
- Algorithm 921
- Galois groups of Schubert problems via homotopy computation
- A Numerical Local Dimension Test for Points on the Solution Set of a System of Polynomial Equations
- Regeneration homotopies for solving systems of polynomials
- An a posteriori certification algorithm for Newton homotopies
- Adaptive Multiprecision Path Tracking
- Shorter Notes: A Proof of the Nonretractibility of a Cell Onto its Boundary
- The Homotopy Continuation Method: Numerically Implementable Topological Procedures
- The Solution of Systems of Piecewise Linear Equations
- Complexity of Bezout's Theorem I: Geometric Aspects
- Finding all solutions to polynomial systems and other systems of equations
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- Introduction to Numerical Continuation Methods
- Algorithm 795
- Homotopies for Intersecting Solution Components of Polynomial Systems
- Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- A Polyhedral Method for Solving Sparse Polynomial Systems
- Deflation and certified isolation of singular zeros of polynomial systems
- Computing the multiplicity structure in solving polynomial systems
- Recovering Exact Results from Inexact Numerical Data in Algebraic Geometry
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Multiplicity hunting and approximating multiple roots of polynomial systems
- The Approximation of Fixed Points of a Continuous Mapping
- SIMPLICIAL APPROXIMATION OF FIXED POINTS
