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

Related topics

Related topics

50 relations
Bairstow's methodBisection methodBrent's methodBroyden's method
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
On root finding algorithms for complex functions with branch cuts
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
Complex Root Finding Algorithm Based on Delaunay Triangulation
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
SMART : The Stochastic Monotone Aggregated Root-Finding Algorithm
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
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Univariate Polynomials: Nearly Optimal Algorithms for Numerical Factorization and Root-finding
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
MCMULLEN’S ROOT-FINDING ALGORITHM FOR CUBIC POLYNOMIALS
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
Efficient root-finding algorithm with application to list decoding of Algebraic-Geometric codes
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
Polynomial root finding using iterated Eigenvalue computation
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
Polynomial root finding
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
Topological complexity of a root finding algorithm
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?