Award Abstract # 1460032
SI2-SSE: Collaborative Proposal: Symbolic-Numeric Approaches to Polynomials

NSF Org: OAC
Office of Advanced Cyberinfrastructure (OAC)
Recipient: UNIVERSITY OF NOTRE DAME DU LAC
Initial Amendment Date: September 4, 2014
Latest Amendment Date: September 4, 2014
Award Number: 1460032
Award Instrument: Standard Grant
Program Manager: Alan Sussman
OAC
 Office of Advanced Cyberinfrastructure (OAC)
CSE
 Directorate for Computer and Information Science and Engineering
Start Date: August 16, 2014
End Date: August 31, 2018 (Estimated)
Total Intended Award Amount: $149,995.00
Total Awarded Amount to Date: $149,995.00
Funds Obligated to Date: FY 2014 = $149,995.00
History of Investigator:
  • Jonathan Hauenstein (Principal Investigator)
    hauenstein@nd.edu
Recipient Sponsored Research Office: University of Notre Dame
940 GRACE HALL
NOTRE DAME
IN  US  46556-5708
(574)631-7432
Sponsor Congressional District: 02
Primary Place of Performance: University of Notre Dame
IN  US  46556-5708
Primary Place of Performance
Congressional District:
02
Unique Entity Identifier (UEI): FPU6XGFXMBE9
Parent UEI: FPU6XGFXMBE9
NSF Program(s): OFFICE OF MULTIDISCIPLINARY AC,
Software Institutes,
CDS&E-MSS
Primary Program Source: 01001415DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 7433, 8005, 8251
Program Element Code(s): 125300, 800400, 806900
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.070

ABSTRACT

Polynomial systems arise naturally in many areas of human endeavor. These include the modeling of tumor growth; the design of robotic devices; chemical systems arising in areas ranging from combustion to blood clotting; assorted problems in physics; plus many areas with mathematics. The solution of the polynomial systems answers questions critical to these endeavors. This research will be devoted to developing the next generation of Bertini, an open source software package, which has been used successfully by many researchers on many problems, which include all those mentioned above.

Bertini will be rewritten in C++ to be scriptable and modular, which will allow it to be interfaced transparently with symbolic software. The new Bertini will include tools allowing the user to construct and manipulate homotopies based on the output of Bertini. A major focus of the research will be given to systems of polynomials arising from the discretization of systems of differential equations. The great challenge of these very large systems of polynomials is balanced by the great potential impact new efficient and robust methods of solution will have.

PUBLICATIONS PRODUCED AS A RESULT OF THIS RESEARCH

Note:  When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

(Showing: 1 - 10 of 28)
Adam Mahdi, Claudio Pessoa, and Jonathan D. Hauenstein "A hybrid symbolic-numerical approach to the center-focus problem" Journal of Symbolic Computation , v.82 , 2017 , p.57 http://dx.doi.org/10.1016/j.jsc.2016.11.019
Alessandra Bernardi, Noah S. Daleo, Jonathan D. Hauenstein, and Bernard Mourrain "Tensor decomposition and homotopy continuation" Differential Geometry and its Applications , v.55 , 2017 , p.78 http://dx.doi.org/10.1016/j.difgeo.2017.07.009
D.A. Brake, J.D. Hauenstein, and A.C. Liddell, Jr. "Validating the completeness of the real solution set of a system of polynomial equations" Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation , 2016 , p.143 10.1145/2930889.2930910
D.A. Brake, J.D. Hauenstein, and A.C. Liddell, Jr., "Decomposing solution sets of polynomial systems using derivatives" LNCS , v.9725 , 2016 , p.127 10.1007/978-3-319-42432-3_16
D.A. Brake, J.D. Hauenstein, and A.J. Sommese "Numerical local irreducible decomposition" LNCS , v.9582 , 2016 , p.124 10.1007/978-3-319-32859-1_9
D.A. Brake, J.D. Hauenstein, and M.H. Regan "polyTop: Software for computing topology of smooth real surfaces" Lecture Notes in Computer Science , v.10931 , 2018 , p.397 DOI:10.1007/978-3-319-96418-8_47
D.A. Brake, J.D. Hauenstein, A.P. Murray, D.H. Myszka, and C.W. Wampler "The complete solution of Alt-Burmester synthesis problems for four-bar linkages" Journal of Mechanisms and Robotics , v.8 , 2016 , p.041018 10.1115/1.4033251
D.J. Bates, D.A. Brake, J.D. Hauenstein, A.J. Sommese, and C.W. Wampler "Homotopies for connected components of algebraic sets with application to computing critical sets" Lecture Notes in Computer Science , v.10693 , 2017 , p.107 DOI:10.1007/978-3-319-72453-9_8
F. Gesmundo, J.D. Hauenstein, C. Ikenmeyer, and J.M. Landsberg "Complexity of linear circuits and geometry" Foundations of Computaitonal Mathematics , v.16 , 2016 , p.599 10.1007/s10208-015-9258-8
F. Gesmundo, J.D. Hauenstein, C. Ikenmeyer, and J.M. Landsberg "Complexity of linear circuits and geometry" Foundations of Computational Mathematics , v.16 , 2016 , p.599 10.1007/s10208-015-9258-8
J.D. Hauenstein "Certification using Newton-invariant subspaces" Lecture Notes in Computer Science , v.10693 , 2017 , p.34 DOI:10.1007/978-3-319-72453-9_3
(Showing: 1 - 10 of 28)

PROJECT OUTCOMES REPORT

Disclaimer

This Project Outcomes Report for the General Public is displayed verbatim as submitted by the Principal Investigator (PI) for this award. Any opinions, findings, and conclusions or recommendations expressed in this Report are those of the PI and do not necessarily reflect the views of the National Science Foundation; NSF has not approved or endorsed its content.

Polynomial systems arise throughout mathematics, science, and engineering, making the solution of such problems a fundamental concern in computational mathematics.  The mathematical field called numerical algebraic geometry includes a wide range of techniques for computing numerical approximations of the solutions of polynomial systems.  The primary goal of this project was the construction of easily extensible and maintainable software for such computations.

More specifically, Bertini 2 is a re-implementation of the venerable Bertini 1 from C into C++ and Python.  The project, which is hosted publicly on GitHub and has a GPL3 open source license, currently consists of two major components.  The first is the core library, implementing symbolics and numerics in C++.  The second is PyBertini, consisting of the Python bindings for the core. The core provides a full set of tools for forming polynomial and non-polynomial systems directly in compiled code, as well as via parsed strings.  A system may be differentiated, evaluated, and queried for various properties, as well as made projective via homogenization and patching.  Numerical path tracking in double, multiple, and adaptive precisions are implemented, and extensible by overloading just a few functions.  The total degree start system is provided, as is the multihomogeneous which accepts arbitrary variable groupings.  The power series and Cauchy endgames are also provided. 

Taken together, a complete modern implementation of numerical homotopy continuation in a nice interface exists in the Bertini 2 core.  PyBertini exposes the C++ core to Python via compiled bindings.  Nearly the entire core is usable in Python, meaning that a user does not have to compile code to do numerical algebraic geometry, nor to they have to write or parse plain text data files.  The entire system is supported by an Autotools build system, automated testing, automatically built and uploaded documentation and tutorials, and a wiki site.  Distribution is handled via GitHub.  The code can currently be compiled from source, though the developers are considering additional distribution methods to ease the burden on users.


Last Modified: 10/21/2018
Modified by: Jonathan D Hauenstein

Please report errors in award information by writing to: awardsearch@nsf.gov.

Print this page

Back to Top of page