Applied and Computational Mathematics and Statistics
Search criteria:
List of files deposited in CurateND that match your search criteria

 Creator(s):
 Dan Bates, David Eklund, Jonathan Hauenstein, Chris Peterson
 Description:
A fundamental problem in algebraic geometry is to decompose the solution set of a given polynomial system. A numerical description of this solution set is called a numerical irreducible decomposition and currently all standard algorithms use a sequence of homotopies forming a dimensionbydimension approach. In this article, we pair a classical result to compute a smooth point on every irreducible component in every dimension using a single homotopy together with the theory of isosingular s…
 Date Created:
 20190426

2
Doctoral Dissertation

3
Doctoral Dissertation

4
Doctoral Dissertation

 Creator(s):
 Jonathan Hauenstein, Alan Liddell, Yi Zhang
 Description:
Standard interior point methods in semidefinite programming track a solution path for a homotopy defined by a system of polynomial equations. By viewing this in the context of numerical algebraic geometry, we are able to employ techniques to handle various cases which can arise. Adaptive precision path tracking techniques can help navigate around illconditioned areas. When the optimizer is singular with respect to the firstorder optimality conditions, endgames can be used to efficiently and…
 Date Created:
 20180410

 Creator(s):
 Jonathan Hauenstein
 Description:
A common problem when analyzing models, such as a mathematical modeling of a biological process, is to determine if the unknown parameters of the model can be determined from given inputoutput data. Identifiable models are models such that the unknown parameters can be determined to have a finite number of values given inputoutput data. The total number of such values over the complex numbers is called the identifiability degree of the model. Unidentifiable models are models such that th…
 Date Created:
 20180309

 Creator(s):
 Samantha Sherman, Jonathan Hauenstein
 Description:
Computational tools in numerical algebraic geometry can be used to numerically approximate solutions to a system of polynomial equations. If the system is wellconstrained (i.e., square), Newton’s method is locally quadratically convergent near each nonsingular solution. In such cases, Smale’s alpha theory can be used to certify that a given point is in the quadratic convergence basin of some solution. This was extended to certifiably determine the reality of the corresponding sol…
 Date Created:
 20180308

 Creator(s):
 Margaret Regan, Jonathan Hauenstein
 Description:
A common computational problem is to compute topological information about a real surface defined by a system of polynomial equations. Our software, called polyTop, leverages numerical algebraic geometry computations from Bertini and Bertini_real with topological computations in javaPlex to compute the Euler characteristic, genus, Betti numbers, and generators of the fundamental group of a real surface. Several examples are used to demonstrate this new software.
 Date Created:
 20180302

 Author(s):
 Michael Hildreth
 Abstract:
This report is a direct result of consultation with the research communities funded by the Mathematical and Physical Sciences (MPS) Directorate at the National Science Foundation (NSF). The goal of this effort is to provide feedback to NSF on current best practices with regard to research data curation, discovery, access, preservation, and reuse, and suggestions for areas of improvement and investment that could facilitate broader curation of, access to, and reuse of research data in the fu…
 Date Created:
 20170831