Jonathan D. Hauenstein

2.7k total citations
89 papers, 1.2k citations indexed

About

Jonathan D. Hauenstein is a scholar working on Computational Theory and Mathematics, Computational Mechanics and Algebra and Number Theory. According to data from OpenAlex, Jonathan D. Hauenstein has authored 89 papers receiving a total of 1.2k indexed citations (citations by other indexed papers that have themselves been cited), including 54 papers in Computational Theory and Mathematics, 40 papers in Computational Mechanics and 17 papers in Algebra and Number Theory. Recurrent topics in Jonathan D. Hauenstein's work include Polynomial and algebraic computation (46 papers), Advanced Numerical Analysis Techniques (39 papers) and Commutative Algebra and Its Applications (17 papers). Jonathan D. Hauenstein is often cited by papers focused on Polynomial and algebraic computation (46 papers), Advanced Numerical Analysis Techniques (39 papers) and Commutative Algebra and Its Applications (17 papers). Jonathan D. Hauenstein collaborates with scholars based in United States, United Kingdom and France. Jonathan D. Hauenstein's co-authors include Andrew J. Sommese, Charles W. Wampler, Daniel J. Bates, Wenrui Hao, Dhagash Mehta, Bei Hu, Frank Sottile, Chris Peterson, Michael Kästner and Yong‐Tao Zhang and has published in prestigious journals such as The Journal of Chemical Physics, PLoS ONE and IEEE Transactions on Pattern Analysis and Machine Intelligence.

In The Last Decade

Jonathan D. Hauenstein

85 papers receiving 1.1k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Jonathan D. Hauenstein United States 22 613 432 205 168 164 89 1.2k
Jöran Bergh Sweden 8 595 1.0× 406 0.9× 340 1.7× 252 1.5× 68 0.4× 13 3.2k
Hans Munthe–Kaas Norway 15 370 0.6× 445 1.0× 271 1.3× 937 5.6× 181 1.1× 43 1.5k
Jan Verschelde United States 17 1.0k 1.6× 632 1.5× 170 0.8× 195 1.2× 268 1.6× 59 1.3k
M. Gasca Spain 16 860 1.4× 522 1.2× 54 0.3× 377 2.2× 185 1.1× 45 1.5k
W. Allegretto Canada 23 774 1.3× 180 0.4× 179 0.9× 212 1.3× 31 0.2× 118 1.6k
Bernd Silbermann Germany 25 956 1.6× 199 0.5× 64 0.3× 321 1.9× 398 2.4× 140 2.9k
Harold R. Parks United States 12 294 0.5× 161 0.4× 149 0.7× 135 0.8× 51 0.3× 37 1.3k
Jiu Ding United States 21 685 1.1× 96 0.2× 74 0.4× 195 1.2× 335 2.0× 132 1.4k
Linzhang Lu China 17 793 1.3× 289 0.7× 77 0.4× 494 2.9× 43 0.3× 98 1.1k
J. C. Mason United Kingdom 12 178 0.3× 161 0.4× 100 0.5× 288 1.7× 84 0.5× 42 1.3k

Countries citing papers authored by Jonathan D. Hauenstein

Since Specialization
Citations

This map shows the geographic impact of Jonathan D. Hauenstein's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jonathan D. Hauenstein with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jonathan D. Hauenstein more than expected).

Fields of papers citing papers by Jonathan D. Hauenstein

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jonathan D. Hauenstein. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jonathan D. Hauenstein. The network helps show where Jonathan D. Hauenstein may publish in the future.

Co-authorship network of co-authors of Jonathan D. Hauenstein

This figure shows the co-authorship network connecting the top 25 collaborators of Jonathan D. Hauenstein. A scholar is included among the top collaborators of Jonathan D. Hauenstein based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Jonathan D. Hauenstein. Jonathan D. Hauenstein is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Hauenstein, Jonathan D., et al.. (2025). Branch points of homotopies: Distribution and probability of failure. Applied Mathematics and Computation. 493. 129273–129273.
2.
3.
Plecnik, Mark, et al.. (2024). A numerical continuation approach using monodromy to solve the forward kinematics of cable-driven parallel robots with sagging cables. Mechanism and Machine Theory. 195. 105609–105609. 4 indexed citations
4.
Plecnik, Mark, et al.. (2024). Computing complete solution sets for approximate four-bar path synthesis. Mechanism and Machine Theory. 196. 105628–105628. 1 indexed citations
5.
You, Suya, et al.. (2023). Efficient hyperparameter optimization for ATR using homotopy parametrization. 6–6. 2 indexed citations
6.
Plecnik, Mark, et al.. (2023). Finding straight line generators through the approximate synthesis of symmetric four-bar coupler curves. Mechanism and Machine Theory. 188. 105310–105310. 3 indexed citations
7.
Plecnik, Mark, et al.. (2022). Computing saddle graphs via homotopy continuation for the approximate synthesis of mechanisms. Mechanism and Machine Theory. 176. 104932–104932. 3 indexed citations
8.
Hauenstein, Jonathan D., et al.. (2021). Advances in the Theory of Planar Curve Cognates. Journal of Mechanisms and Robotics. 14(3). 1 indexed citations
9.
Hauenstein, Jonathan D., Luke Oeding, Giorgio Ottaviani, & Andrew J. Sommese. (2019). Homotopy techniques for tensor decomposition and perfect identifiability. Florence Research (University of Florence). 19 indexed citations
10.
Bates, Daniel J., Jonathan D. Hauenstein, & Nicolette Meshkat. (2019). Identifiability and numerical algebraic geometry. PLoS ONE. 14(12). e0226299–e0226299. 11 indexed citations
11.
Hauenstein, Jonathan D., et al.. (2017). Certifying solutions to overdetermined and singular polynomial systems over Q. Journal of Symbolic Computation. 84. 147–171. 6 indexed citations
12.
Hauenstein, Jonathan D., Bernard Mourrain, & Ágnes Szántó. (2016). On deflation and multiplicity structure. Journal of Symbolic Computation. 83. 228–253. 11 indexed citations
13.
Hauenstein, Jonathan D. & Viktor Levandovskyy. (2016). Certifying solutions to square systems of polynomial-exponential equations. Journal of Symbolic Computation. 79. 575–593. 6 indexed citations
14.
Hauenstein, Jonathan D., et al.. (2015). Numerically deciding the arithmetically Cohen–Macaulayness of a projective scheme. Journal of Symbolic Computation. 72. 128–146. 4 indexed citations
15.
Mehta, Dhagash, et al.. (2015). Energy landscape of the finite-size mean-field 2-spin spherical model and topology trivialization. Physical Review E. 91(2). 22133–22133. 5 indexed citations
16.
Hauenstein, Jonathan D., et al.. (2015). A hybrid symbolic-numeric approach to exceptional sets of generically zero-dimensional systems. 53–60. 2 indexed citations
17.
Hao, Wenrui, Jonathan D. Hauenstein, Bei Hu, & Andrew J. Sommese. (2013). A bootstrapping approach for computing multiple solutions of differential equations. Journal of Computational and Applied Mathematics. 258. 181–190. 28 indexed citations
18.
Bates, Daniel J., et al.. (2013). Recovering Exact Results from Inexact Numerical Data in Algebraic Geometry. Experimental Mathematics. 22(1). 38–50. 13 indexed citations
19.
Hao, Wenrui, Jonathan D. Hauenstein, Chi‐Wang Shu, et al.. (2013). A homotopy method based on WENO schemes for solving steady state problems of hyperbolic conservation laws. Journal of Computational Physics. 250. 332–346. 30 indexed citations
20.
Hao, Wenrui, et al.. (2012). Computing steady-state solutions for a free boundary problem modeling tumor growth by Stokes equation. Journal of Computational and Applied Mathematics. 237(1). 326–334. 24 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026