default search action
Daniel J. Bates
Person information
- affiliation: US Naval Academy, Annapolis, MD, USA
- affiliation (former): Colorado State University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i3]Daniel J. Bates, Paul Breiding, Tianran Chen, Jonathan D. Hauenstein, Anton Leykin, Frank Sottile:
Numerical Nonlinear Algebra. CoRR abs/2302.08585 (2023) - 2021
- [c8]Daniel J. Bates, David Eklund, Jonathan D. Hauenstein, Chris Peterson:
Excess intersections and numerical irreducible decompositions. SYNASC 2021: 52-60 - 2020
- [j18]Kee-Myoung Nam
, Benjamin M. Gyori
Robustness and parameter geography in post-translational modification systems. PLoS Comput. Biol. 16(5) (2020)
2010 – 2019
- 2018
- [c7]Daniel J. Bates, Danielle A. Brake
Paramotopy: Parameter Homotopies in Parallel. ICMS 2018: 28-35 - 2017
- [j17]Daniel A. Brake
Algorithm 976: Bertini_real: Numerical Decomposition of Real Algebraic Curves and Surfaces. ACM Trans. Math. Softw. 44(1): 10:1-10:30 (2017) - [c6]Daniel J. Bates, Daniel A. Brake
Homotopies for Connected Components of Algebraic Sets with Application to Computing Critical Sets. MACIS 2017: 107-120 - 2016
- [j16]Daniel J. Bates, Andrew J. Newell
BertiniLab: A MATLAB interface for solving systems of polynomial equations. Numer. Algorithms 71(1): 229-244 (2016) - [j15]Daniel J. Bates, Jonathan D. Hauenstein, Matthew E. Niemerg, Frank Sottile:
Software for the Gale transform of fewnomial systems and a Descartes rule for fewnomials. Numer. Algorithms 73(1): 281-304 (2016) - 2015
- [j14]Daniel J. Bates, Brent R. Davis, Michael Kirby, Justin Marks, Chris Peterson:
The max-length-vector line of best fit to a set of vector subspaces and an optimization problem over a set of hyperellipsoids. Numer. Linear Algebra Appl. 22(3): 453-464 (2015) - [c5]Daniel A. Brake
Workspace Multiplicity and Fault Tolerance of Cooperating Robots. MACIS 2015: 109-123 - [i2]Daniel J. Bates, Jonathan D. Hauenstein, Matthew E. Niemerg, Frank Sottile:
Software for the Gale transform of fewnomial systems and a Descartes rule for fewnomials. CoRR abs/1505.05241 (2015) - 2014
- [j13]Daniel J. Bates, Wolfram Decker, Jonathan D. Hauenstein
Comparison of probabilistic algorithms for analyzing the components of an affine algebraic variety. Appl. Math. Comput. 231: 619-633 (2014) - [j12]Daniel J. Bates, Brent R. Davis, David Eklund
Perturbed homotopies for finding all isolated solutions of polynomial systems. Appl. Math. Comput. 247: 301-311 (2014) - [j11]Daniel J. Bates, Andrew J. Newell, Matthew E. Niemerg:
Decoupling Highly Structured Polynomial Systems. ACM Commun. Comput. Algebra 48(3/4): 133 (2014) - [j10]Daniel J. Bates, Matthew E. Niemerg:
Using Monodromy to Avoid High Precision in Homotopy Continuation. Math. Comput. Sci. 8(2): 253-262 (2014) - [c4]Daniel A. Brake
Bertini_real: Software for One- and Two-Dimensional Real Algebraic Sets. ICMS 2014: 175-182 - [c3]Daniel J. Bates, Daniel A. Brake
On Computing a Cell Decomposition of a Real Surface Containing Infinitely Many Singularities. ICMS 2014: 246-252 - 2013
- [b1]Daniel J. Bates, Andrew J. Sommese, Jonathan D. Hauenstein, Charles W. Wampler:
Numerically Solving Polynomial Systems with Bertini. Software, environments, tools 25, SIAM 2013, ISBN 978-1-611972-69-6, pp. I-XX, 1-352 - [j9]Daniel J. Bates, Jonathan D. Hauenstein
Recovering Exact Results from Inexact Numerical Data in Algebraic Geometry. Exp. Math. 22(1): 38-50 (2013) - [j8]Daniel J. Bates, David Eklund
Computing intersection numbers of Chern classes. J. Symb. Comput. 50: 493-507 (2013) - [i1]Daniel J. Bates, Elizabeth Gross, Anton Leykin, Jose Israel Rodriguez:
Bertini for Macaulay2. CoRR abs/1310.3297 (2013) - 2011
- [j7]Daniel J. Bates, Luke Oeding
Toward a Salmon Conjecture. Exp. Math. 20(3): 358-370 (2011) - [j6]Daniel J. Bates, Frank Sottile:
Khovanskii-Rolle Continuation for Real Solutions. Found. Comput. Math. 11(5): 563-587 (2011) - [j5]Daniel J. Bates, Jonathan D. Hauenstein
Efficient path tracking methods. Numer. Algorithms 58(4): 451-459 (2011) - [j4]Philipp Rostalski, Ioannis A. Fotiou, Daniel J. Bates, A. Giovanni Beccuti, Manfred Morari:
Numerical Algebraic Geometry for Optimal Control Applications. SIAM J. Optim. 21(2): 417-437 (2011)
2000 – 2009
- 2009
- [j3]Daniel J. Bates, Jonathan D. Hauenstein
A Numerical Local Dimension Test for Points on the Solution Set of a System of Polynomial Equations. SIAM J. Numer. Anal. 47(5): 3608-3623 (2009) - 2008
- [j2]Daniel J. Bates, Jonathan D. Hauenstein
Adaptive Multiprecision Path Tracking. SIAM J. Numer. Anal. 46(2): 722-746 (2008) - [c2]Daniel J. Bates, A. Giovanni Beccuti, Ioannis A. Fotiou, Manfred Morari:
An optimal control application in power electronics using numerical algebraic geometry. ACC 2008: 2221-2226 - 2007
- [c1]Daniel J. Bates, Ioannis A. Fotiou, Philipp Rostalski:
A numerical algebraic geometry approach to nonlinear constrained optimal control. CDC 2007: 6256-6261 - 2006
- [j1]Daniel J. Bates, Chris Peterson, Andrew J. Sommese:
A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set. J. Complex. 22(4): 475-489 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: