[图书][B] Numerically solving polynomial systems with Bertini

Systems of polynomial equations are a common occurrence in problem formulations in
engineering, science, and mathematics. Solution sets of such systems, ie, algebraic sets, are …

Numerical algebraic geometry for model selection and its application to the life sciences

E Gross, B Davis, KL Ho, DJ Bates… - Journal of The …, 2016 - royalsocietypublishing.org
Researchers working with mathematical models are often confronted by the related
problems of parameter estimation, model validation and model selection. These are all …

Exact symbolic–numeric computation of planar algebraic curves

E Berberich, P Emeliyanenko, A Kobel… - Theoretical Computer …, 2013 - Elsevier
We present a certified and complete algorithm to compute arrangements of real planar
algebraic curves. It computes the decomposition of the plane induced by a finite number of …

Finding points on real solution components and applications to differential polynomial systems

W Wu, G Reid - Proceedings of the 38th international symposium on …, 2013 - dl.acm.org
In this paper we extend complex homotopy methods to finding witness points on the
irreducible components of real varieties. In particular we construct such witness points as the …

Computing critical points for invariant algebraic systems

JC Faugère, G Labahn, MS El Din, É Schost… - Journal of Symbolic …, 2023 - Elsevier
Let K be a field and (f 1,…, fs, ϕ) be multivariate polynomials in K [x 1,…, xn](with s< n) each
invariant under the action of S n, the group of permutations of {1,…, n}. We consider the …

What is numerical algebraic geometry?

JD Hauenstein, AJ Sommese - Journal of Symbolic Computation, 2017 - Elsevier
The foundation of algebraic geometry is the solving of systems of polynomial equations.
When the equations to be considered are defined over a subfield of the complex numbers …

Unification and extension of intersection algorithms in numerical algebraic geometry

JD Hauenstein, CW Wampler - Applied Mathematics and Computation, 2017 - Elsevier
The solution set of a system of polynomial equations, called an algebraic set, can be
decomposed into finitely many irreducible components. In numerical algebraic geometry …

Homotopy techniques for solving sparse column support determinantal polynomial systems

G Labahn, MS El Din, É Schost, TX Vu - Journal of Complexity, 2021 - Elsevier
Let K be a field of characteristic zero with K¯ its algebraic closure. Given a sequence of
polynomials g=(g 1,…, gs)∈ K [x 1,…, xn] s and a polynomial matrix F=[fi, j]∈ K [x 1,…, xn] …

Algorithm 976: Bertini_real: numerical decomposition of real algebraic curves and surfaces

DA Brake, DJ Bates, W Hao, JD Hauenstein… - ACM Transactions on …, 2017 - dl.acm.org
Bertini_real is a compiled command line program for numerically decomposing the real
portion of a positive-dimensional complex component of an algebraic set. The software uses …

Computing the branches, singularity trace, and critical points of single degree-of-freedom, closed-loop linkages

DH Myszka, AP Murray… - Journal of …, 2014 - asmedigitalcollection.asme.org
This paper considers single degree-of-freedom (DOF), closed-loop linkages with a
designated input angle and one design parameter. For a fixed value of the design …