General Root Computation

Given a real continuous function, compute one of the roots.

Parameters

  • ϵ\epsilon: (additive) tolerance error
  • a,ba, b: endpoint values, with b>ab>a
  • nmaxn_{max}: maximum number of iterations

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Displaying 11 of 11 algorithms

See more
Ridder's method1979O(nmax)O(n_{max})O(1)O(1)
Anderson–Björck algorithm1973O(n_max)O(1)
Brent-Dekker Method1973O(n_max)O(1)
Illinois Algorithm1971O(n_max)O(1)
Muller's method1956O(nmax)O(n_{max})O(1)O(1)
Steffensen's method1940()O(n_max)O(1)
Inverse quadratic interpolation1940()O(n_max)O(1)
Secant method1940O(nmax)O(n_{max})O(1)O(1)
ITP Method1940O(n_0+log((b-a)/epsilon))O(1)
Bisection method1820O(nmax)O(n_{max})O(1)O(1)
False position method1690O(nmax)O(n_{max})O(1)O(1)

Reductions Table

Insuffient Data to display table

Other relevant algorithms

Insuffient Data to display table