Eliminating dual spaces

DOI10.1016/j.jsc.2016.07.022zbMath1359.14052arXiv1503.02038OpenAlexW2962808178MaRDI QIDQ507167

Anton Leykin, Robert Krone

Publication date: 3 February 2017

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.02038

zbMATH Keywords

numerical algebraic geometryembedded pointsMacaulay dual spaces

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational aspects of algebraic curves (14Q05) Computational aspects in algebraic geometry (14Qxx)

Related Items

Foreword. What is numerical algebraic geometry? ⋮ Numerical algorithms for detecting embedded components ⋮ Noetherian operators and primary decomposition ⋮ Effective algorithm for computing Noetherian operators of zero-dimensional ideals

Uses Software

• Macaulay2
• SINGULAR

Cites Work

• Unnamed Item
• Unnamed Item
• Isosingular sets and deflation
• Numerical algorithms for detecting embedded components
• Isolated points, duality and residues
• Power sums, Gorenstein algebras, and determinantal loci. With an appendix `The Gotzmann theorems and the Hilbert scheme' by Anthony Iarrobino and Steven L. Kleiman
• Quadratic Newton iteration for systems with multiplicity
• Newton's method with deflation for isolated singularities of polynomial systems
• A Numerical Local Dimension Test for Points on the Solution Set of a System of Polynomial Equations
• A counter example to an ideal membership test
• A Singular Introduction to Commutative Algebra
• On multiplicities in polynomial system solving
• NUMERICAL ALGORITHMS FOR DUAL BASES OF POSITIVE-DIMENSIONAL IDEALS
• Numerical Computation of the Hilbert Function and Regularity of a Zero Dimensional Scheme
• Computing the multiplicity structure in solving polynomial systems
• Numerical primary decomposition
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science