Sampling algebraic sets in local intrinsic coordinates

DOI10.1016/J.CAMWA.2011.09.013MaRDI QIDQ2429015zbMATH OpenOpenAlexFDO

Publication date 22 April 2012

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

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

condition numbers polynomial systems numerical algebraic geometry \texttt{Maple}path tracking generic points \texttt{PHCpack}local intrinsic coordinates

Mathematics Subject Classification ID

Semialgebraic sets and related spaces (14P10) Computational aspects of higher-dimensional varieties (14Q15) Nonlinear algebraic or transcendental equations (65H99)

Abstract: Numerical data structures for positive dimensional solution sets of polynomial systems are sets of generic points cut out by random planes of complimentary dimension. We may represent the linear spaces defined by those planes either by explicit linear equations or in parametric form. These descriptions are respectively called extrinsic and intrinsic representations. While intrinsic representations lower the cost of the linear algebra operations, we observe worse condition numbers. In this paper we describe the local adaptation of intrinsic coordinates to improve the numerical conditioning of sampling algebraic sets. Local intrinsic coordinates also lead to a better stepsize control. We illustrate our results with Maple experiments and computations with PHCpack on some benchmark polynomial systems.

Recommendations

Cites work

Describes a project that uses

Uses Software

This page was built for publication: Sampling algebraic sets in local intrinsic coordinates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2429015)