Decomposing Solution Sets of Polynomial Systems Using Derivatives

@inproceedings{Brake2016DecomposingSS,
  title={Decomposing Solution Sets of Polynomial Systems Using Derivatives},
  author={Daniel A. Brake and Jonathan D. Hauenstein and Alan C. Liddell},
  booktitle={International Congress on Mathematical Software},
  year={2016}
}
A core computation in numerical algebraic geometry is the decomposition of the solution set of a system of polynomial equations into irreducible components, called the numerical irreducible decomposition. One approach to validate a decomposition is what has come to be known as the “trace test.” This test, described by Sommese, Verschelde, and Wampler in 2002, relies upon path tracking and hence could be called the “tracking trace test.” We present a new approach which replaces path tracking… 

Numerical irreducible decomposition of multiprojective varieties

In the field of numerical algebraic geometry, positive-dimensional solution sets of systems of polynomial equations are described by witness sets. In this paper, we define multiprojective witness

Trace Test

The trace test in numerical algebraic geometry verifies the completeness of a witness set of an irreducible variety in affine or projective space. We give a brief derivation of the trace test and

Using monodromy to statistically estimate the number of solutions

The new approach extends previous work on success ratios of parameter homotopies to using monodromy loops as well as the addition of a trace test that provides a stopping criterion for validating that all solutions have been found.

Identifiability and numerical algebraic geometry

Numerical algebraic geometry is used to determine if a model given by polynomial or rational ordinary differential equations is identifiable or unidentifiable, and a novel approach to compute the identifiability degree is presented.

Multiprojective witness sets and a trace test

Abstract In the field of numerical algebraic geometry, positive-dimensional solution sets of systems of polynomial equations are described by witness sets. In this paper, we define multiprojective

References

SHOWING 1-10 OF 16 REFERENCES

Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems

This paper proves theoretically and demonstrates in practice that linear traces suffice for this verification step, and shows how to do so more efficiently by building a structured grid of samples, using divided differences, and applying symmetric functions.

Using Monodromy to Decompose Solution Sets of Polynomial Systems into Irreducible Components

To decompose solution sets of polynomial systems into irreducible components, homotopy continuation methods generate the action of a natural monodromy group which partially classifles generic points

Numerical irreducible decomposition of multiprojective varieties

In the field of numerical algebraic geometry, positive-dimensional solution sets of systems of polynomial equations are described by witness sets. In this paper, we define multiprojective witness

The numerical solution of systems of polynomials - arising in engineering and science

Background: Polynomial Systems Homotopy Continuation Projective Spaces Probability One Polynomials of One Variable Other Methods Isolated Solutions: Coefficient-Parameter Homotopy Polynomial

Isosingular Sets and Deflation

This article introduces a strong form of deflation and defines deflation sequences, which, in a different context, are the sequences arising in Thom–Boardman singularity theory, and defines isosingular sets in terms of deflation sequences.

Equations for Lower Bounds on Border Rank

It is shown that these newly obtained polynomials do not vanish on the matrix multiplication operator M 2, which gives a new proof that the border rank of the multiplication of 2×2 matrices is seven.

Witness sets of projections

The Complete Solution of Alt–Burmester Synthesis Problems for Four-Bar Linkages

Precision-point synthesis problems for design of four-bar linkages have typically been formulated using two approaches. The exclusive use of path-points is known as “path synthesis”, whereas the use

The NumPy Array: A Structure for Efficient Numerical Computation

This effort shows, NumPy performance can be improved through three techniques: vectorizing calculations, avoiding copying data in memory, and minimizing operation counts.

Über die Erzeugung gegebener ebener

  • Kurven mit Hilfe des Gelenkvierecks. ZAMM,
  • 1923