Robust Numerical Algebraic Geometry
<|reference_start|>Robust Numerical Algebraic Geometry: The field of numerical algebraic geometry consists of algorithms for numerically solving systems of polynomial equations. When the system is exact, such as having rational coefficients, the solution set is well-defined. However, for a member of a parameterized family of polynomial systems where the parameter values may be measured with imprecision or arise from prior numerical computations, uncertainty may arise in the structure of the solution set, including the number of isolated solutions, the existence of higher dimensional solution components, and the number of irreducible components along with their multiplicities. The loci where these structures change form a stratification of exceptional algebraic sets in the space of parameters. We describe methodologies for making the interpretation of numerical results more robust by searching for nearby parameter values on an exceptional set. We demonstrate these techniques on several illustrative examples and then treat several more substantial problems arising from the kinematics of mechanisms and robots.<|reference_end|>
@article{cobian2024robust,
    title={Robust Numerical Algebraic Geometry},
    author={Emma R. Cobian, Jonathan D. Hauenstein, Charles W. Wampler},
    journal={arXiv preprint arXiv:2403.18749},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.18749},
    primaryClass={math.NA cs.NA}
}