DOI10.1137/S0036142900372549zbMath1002.65060OpenAlexW2035352599MaRDI QIDQ2706398
Jan Verschelde, Charles W. Wampler, Andrew John Sommese
Publication date: 19 March 2001
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0036142900372549
Effective approximation of the solutions of algebraic equations,
Certified Numerical Homotopy Tracking,
Trace test,
Galois/Monodromy Groups for Decomposing Minimal Problems in 3D Reconstruction,
Perturbed homotopies for finding all isolated solutions of polynomial systems,
Computing Cox rings,
Recovering Exact Results from Inexact Numerical Data in Algebraic Geometry,
Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study,
Cell decomposition of almost smooth real algebraic surfaces,
Numerical irreducible decomposition over a number field,
Isosingular sets and deflation,
Deformation techniques to solve generalised Pham systems,
Numerical factorization of multivariate complex polynomials,
Chern numbers of smooth varieties via homotopy continuation and intersection theory,
A fast recursive orthogonalization scheme for the Macaulay matrix,
Using monodromy to recover symmetries of polynomial systems,
On the null spaces of the Macaulay matrix,
Sampling algebraic sets in local intrinsic coordinates,
Polyhedral homotopies in Cox coordinates,
Numerically computing real points on algebraic sets,
A numerical toolkit for multiprojective varieties,
Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers,
Generic properties of dispersion relations for discrete periodic operators,
Improving the efficiency of exclusion algorithms,
A Robust Numerical Path Tracking Algorithm for Polynomial Homotopy Continuation,
Unification and extension of intersection algorithms in numerical algebraic geometry,
Foreword. What is numerical algebraic geometry?,
On approximate triangular decompositions in dimension zero,
Numerical algorithms for detecting embedded components,
Determining dimension of the solution component that contains a computed zero of a polynomial system,
Symbolic-numeric sparse interpolation of multivariate polynomials,
Numerical Decomposition of the Rank-Deficiency Set of a Matrix of Multivariate Polynomials,
Numerical computation of the genus of an irreducible curve within an algebraic set,
Heuristics to accelerate the Dixon resultant,
Irreducible decomposition of curves,
Verifying topological indices for higher-order rank deficiencies,
Comparing acceleration techniques for the Dixon and Macaulay resultants,
A constrained homotopy technique for excluding unwanted solutions from polynomial equations arising in kinematics problems,
On computing absolutely irreducible components of algebraic varieties with parameters,
A Numerical Transcendental Method in Algebraic Geometry: Computation of Picard Groups and Related Invariants,
HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method,
A novel linear algorithm for \(P5P\) problem,
Regeneration homotopies for solving systems of polynomials,
Noetherian operators and primary decomposition,
Numerical algebraic geometry and algebraic kinematics,
Towards toric absolute factorization
