Unification and extension of intersection algorithms in numerical algebraic geometry
From MaRDI portal
Publication:1737155
DOI10.1016/j.amc.2016.08.023zbMath1411.65075OpenAlexW2511468977WikidataQ115997010 ScholiaQ115997010MaRDI QIDQ1737155
Jonathan D. Hauenstein, Charles W. Wampler
Publication date: 27 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2016.08.023
Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Computational aspects of higher-dimensional varieties (14Q15)
Related Items (10)
A Numerical Approach for Computing Euler Characteristics of Affine Varieties ⋮ Exceptional Stewart--Gough Platforms, Segre Embeddings, and the Special Euclidean Group ⋮ Tensor decomposition and homotopy continuation ⋮ Multiprojective witness sets and a trace test ⋮ \(u\)-generation: solving systems of polynomials equation-by-equation ⋮ A hybrid symbolic-numerical approach to the center-focus problem ⋮ Fiber product homotopy method for multiparameter eigenvalue problems ⋮ Computing complex and real tropical curves using monodromy ⋮ The numerical algebraic geometry of bottlenecks ⋮ Smooth points on semi-algebraic sets
Uses Software
Cites Work
- Isosingular sets and deflation
- Witness sets of projections
- Regenerative cascade homotopies for solving polynomial systems
- Exceptional sets and fiber products
- HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
- A homotopy for solving general polynomial systems that respects m- homogeneous structures
- Coefficient-parameter polynomial continuation
- A power series method for computing singular solutions to nonlinear analytic systems
- Computing singular solutions to polynomial systems
- Symbolic homotopy construction
- Polyhedral end games for polynomial continuation
- Numerical homotopies to compute generic points on positive dimensional algebraic sets
- Real solving for positive dimensional systems.
- Numerically computing real points on algebraic sets
- An intrinsic homotopy for intersecting algebraic varieties
- Cell decomposition of almost smooth real algebraic surfaces
- Numerically intersecting algebraic varieties via witness sets
- Membership tests for images of algebraic sets by linear projections
- Newton's method with deflation for isolated singularities of polynomial systems
- Singularities of differentiable maps
- Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
- The euclidean distance degree
- Verification methods: Rigorous results using floating-point arithmetic
- The Exponentially Convergent Trapezoidal Rule
- A Numerical Local Dimension Test for Points on the Solution Set of a System of Polynomial Equations
- Regeneration homotopies for solving systems of polynomials
- Deriving Finite Sphere Packings
- Algorithm 857
- A Course in Commutative Algebra
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- Finding all isolated solutions to polynomial systems using HOMPACK
- Algorithm 795
- Homotopies for Intersecting Solution Components of Polynomial Systems
- Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
- A Polyhedral Method for Solving Sparse Polynomial Systems
- Computing the multiplicity structure in solving polynomial systems
- Numerical primary decomposition
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- SINGULARITIES OF SMOOTH MAPPINGS
- Finding at least one point in each connected component of a real algebraic set defined by a single equation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Unification and extension of intersection algorithms in numerical algebraic geometry
