Gale duality, decoupling, parameter homotopies, and monodromy

2014 Spring.Numerical Algebraic Geometry (NAG) has recently seen significantly increased application among scientists and mathematicians as a tool that can be used to solve nonlinear systems of equations, particularly polynomial systems. With the many recent advances in the field, we can now routinely solve problems that could not have been solved even 10 years ago. We will give an introduction and overview of numerical algebraic geometry and homotopy continuation methods; discuss heuristics for preconditioning fewnomial systems, as well as provide a hybrid symbolic-numerical algorithm for computing the solutions of these types of polynomials and associated software called galeDuality; describe a software module of bertini named paramotopy that is scientific software specifically designed for large-scale parameter homotopy runs; give two examples that are parametric polynomial systems on which the aforementioned software is used; and finally describe two novel algorithms, decoupling and a heuristic that makes use of monodromy

Applications of monodromy in solving polynomial systems

Polynomial systems of equations that occur in applications frequently have a special structure. Part of that structure can be captured by an associated Galois/monodromy group. This makes numerical homotopy continuation methods that exploit this monodromy action an attractive choice for solving these systems; by contrast, other symbolic-numeric techniques do not generally see this structure. Naturally, there are trade-offs when monodromy is chosen over other methods. Nevertheless, there is a growing literature demonstrating that the trade can be worthwhile in practice. In this thesis, we consider a framework for efficient monodromy computation which rivals the state-of-the-art in homotopy continuation methods. We show how its implementation in the package MonodromySolver can be used to efficiently solve challenging systems of polynomial equations. Among many applications, we apply monodromy to computer vision---specifically, the study and classification of minimal problems used in RANSAC-based 3D reconstruction pipelines. As a byproduct of numerically computing their Galois/monodromy groups, we observe that several of these problems have a decomposition into algebraic subproblems. Although precise knowledge of such a decomposition is hard to obtain in general, we determine it in some novel cases.Ph.D

Numerical Algebraic Geometry: A New Perspective on String and Gauge Theories

The interplay rich between algebraic geometry and string and gauge theories has recently been immensely aided by advances in computational algebra. However, these symbolic (Gr\"{o}bner) methods are severely limited by algorithmic issues such as exponential space complexity and being highly sequential. In this paper, we introduce a novel paradigm of numerical algebraic geometry which in a plethora of situations overcomes these short-comings. Its so-called 'embarrassing parallelizability' allows us to solve many problems and extract physical information which elude the symbolic methods. We describe the method and then use it to solve various problems arising from physics which could not be otherwise solved.Comment: 36 page

Sampling algebraic sets in local intrinsic coordinates

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.Comment: 13 pages, 2 figures, 2 algorithms, 2 table

Polynomial continuation in the design of deployable structures

Polynomial continuation, a branch of numerical continuation, has been applied to several primary problems in kinematic geometry. The objective of the research presented in this document was to explore the possible extensions of the application of polynomial continuation, especially in the field of deployable structure design. The power of polynomial continuation as a design tool lies in its ability to find all solutions of a system of polynomial equations (even positive dimensional solution sets). A linkage design problem posed in polynomial form can be made to yield every possible feasible outcome, many of which may never otherwise have been found. Methods of polynomial continuation based design are illustrated here by way of various examples. In particular, the types of deployable structures which form planar rings, or frames, in their deployed configurations are used as design cases. Polynomial continuation is shown to be a powerful component of an equation-based design process. A polyhedral homotopy method, particularly suited to solving problems in kinematics, was synthesised from several researchers’ published continuation techniques, and augmented with modern, freely available mathematical computing algorithms. Special adaptations were made in the areas of level-k subface identification, lifting value balancing, and path-following. Techniques of forming closure/compatibility equations by direct use of symmetry, or by use of transfer matrices to enforce loop closure, were developed as appropriate for each example. The geometry of a plane symmetric (rectangular) 6R foldable frame was examined and classified in terms of Denavit-Hartenberg Parameters. Its design parameters were then grouped into feasible and non-feasible regions, before continuation was used as a design tool; generating the design parameters required to build a foldable frame which meets certain configurational specifications. iv Two further deployable ring/frame classes were then used as design cases: (a) rings which form (planar) regular polygons when deployed, and (b) rings which are doubly plane symmetric and planar when deployed. The governing equations used in the continuation design process are based on symmetry compatibility and transfer matrices respectively. Finally, the 6, 7 and 8-link versions of N-loops were subjected to a witness set analysis, illustrating the way in which continuation can reveal the nature of the mobility of an unknown linkage. Key features of the results are that polynomial continuation was able to provide complete sets of feasible options to a number of practical design problems, and also to reveal the nature of the mobility of a real overconstrained linkage

Computing Periods of Hypersurfaces

We give an algorithm to compute the periods of smooth projective hypersurfaces of any dimension. This is an improvement over existing algorithms which could only compute the periods of plane curves. Our algorithm reduces the evaluation of period integrals to an initial value problem for ordinary differential equations of Picard-Fuchs type. In this way, the periods can be computed to extreme-precision in order to study their arithmetic properties. The initial conditions are obtained by an exact determination of the cohomology pairing on Fermat hypersurfaces with respect to a natural basis.Comment: 33 pages; Final version. Fixed typos, minor expository changes. Changed code repository lin