Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Root-finding algorithm

Known as: Root finding equation, Root-finding method, Root-finding algorithms 
A root-finding algorithm is a numerical method, or algorithm, for finding a value x such that f(x) = 0, for a given function f. Such an x is called a… Expand
Wikipedia

Related topics

Related topics

50 relations
Bairstow's methodBisection methodBrent's methodBroyden's method
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Polynomial root finding technique for joint DOA DOD estimation in bistatic MIMO radar
In this paper, we propose a new technique to transform the 2-D direction finding in the bistatic MIMO radar into a double 1-D… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Idiosyncratic Risk and the Cross-Section of Expected Stock Returns
Theories such as Merton [1987. A simple model of capital market equilibrium with incomplete information. Journal of Finance 42… Expand
Is this relevant?
Highly Cited
2008
Highly Cited
2008
How Well Do Coupled Models Simulate Today's Climate?
Coupled climate models are sophisticated tools designed to simulate the Earth climate system and the complex interactions between… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Influences of species, latitudes and methodologies on estimates of phenological response to global warming
New analyses are presented addressing the global impacts of recent climate change on phenology of plant and animal species. A… Expand
  • table 1
  • figure 1
  • figure 2
  • table 2
  • figure 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
A handbook of protocols for standardised and easy measurement of plant functional traits worldwide
There is growing recognition that classifying terrestrial plant species on the basis of their function (into 'functional types… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Univariate Polynomials: Nearly Optimal Algorithms for Numerical Factorization and Root-finding
  • V. Pan
  • J. Symb. Comput.
  • 2002
    • Corpus ID: 1674540
To approximate all roots (zeros) of a univariate polynomial, we develop two effective algorithms and combine them in a single… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization
In the first part of this thesis, we introduce a specific class of Linear Matrix Inequalities (LMI) whose optimal solution can be… Expand
  • figure 3.1
  • table 3.1
  • figure 3.2
  • table 3.2
  • figure 3.3
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Robust Control: The Parametric Approach
Abstract This paper presents the development of a new coarse in the control curriculum dealing with the control of systems… Expand
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Performance analysis of Root-Music
  • B. Rao, K. Hari
  • IEEE Trans. Acoust. Speech Signal Process.
  • 1989
    • Corpus ID: 35641010
The authors analyze the performance of Root-Music, a variation of the MUSIC algorithm, for estimating the direction of arrival… Expand
Is this relevant?
Highly Cited
1954
Highly Cited
1954
Finite Unitary Reflection Groups
Any finite group of linear transformations on n variables leaves invariant a positive definite Hermitian form, and can therefore… Expand
  • table I
  • table II
  • table III
  • table IV
  • table V
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE