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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A simple and versatile method is presented, which enhances the complex root finding process by eliminating branch cuts and branch… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 2
  • figure 4
Is this relevant?
2015
2015
A simple and flexible algorithm for finding zeros of a complex function is presented. An arbitrary-shaped search region can be… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
2015
2015
We introduce the Stochastic Monotone Aggregated Root-Finding (SMART) algorithm, a new randomized operator-splitting scheme for… (More)
  • table 4.1
Is this relevant?
Highly Cited
2010
Highly Cited
2010
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2002
Highly Cited
2002
To approximate all roots (zeros) of a univariate polynomial, we develop two effective algorithms and combine them in a single… (More)
Is this relevant?
2002
2002
We show that a generally convergent root-finding algorithm for cubic polynomials defined by C. McMullen is of order 3, and we… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2001
2001
A list decoding for an error-correcting code is a decoding algorithm that generates a list of codewords within a Hamming distance… (More)
Is this relevant?
2001
2001
We analyze an iterative algorithm that approximates all roots of a univariate polynomial. The algorithm is based on (hardware… (More)
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Finding polynomial roots rapidly and accurately is an important problem in many areas of signal processing. We present a program… (More)
  • figure 1
  • figure 2
Is this relevant?
1989
1989
We remark that no algorithm can solve the problem, uniformly in d and E, without assuming a compactness condition on the root… (More)
Is this relevant?