Multidimensional Root Finding
Multidimensional Root Finding is a numerical method for determining the set of values at which a system of multivariate functions simultaneously evaluates to zero, distinguished from univariate root finding by its requirement to solve multiple interdependent equations in higher-dimensional spaces.
17
Publications
470
Citations
43
Authors
27
Institutions
Publications per year
2017–2026
3
Parents
17
Nélio Henderson, Wagner F. Sacco, Gustavo Mendes Platt · Process Safety and Environmental Protection · 2009 · 30 citations
Computing selected solutions of polynomial equations
Dinesh Manocha · 1994 · 28 citations
1–5 of 17
43
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 43
27
Scientific Methods (United States)
Granger, United States
1 h-index
1 publications
13 citations

Johannes Kepler University of Linz
Linz, Austria
1 h-index
1 publications
20 citations
Michigan State University
East Lansing, United States
1 h-index
1 publications
11 citations

Budapest University of Technology and Economics
Budapest, Hungary
1 h-index
1 publications
96 citations
University of Nis
Niš, Serbia
1 h-index
1 publications
14 citations
Derby College
Derby, United Kingdom
1 h-index
1 publications
13 citations
Northwestern University
Evanston, United States
1 h-index
2 publications
24 citations
University of Utah
Salt Lake City, United States
1 h-index
2 publications
40 citations
1–8 of 27
1 publications · 76 citations
1
h-index
1 publications · 14 citations
1
h-index
1 publications · 44 citations
1
h-index
1 publications · 13 citations
1
h-index
1 publications · 11 citations
1
h-index
1–5