Brent's method

In numerical analysis, Brent's method is a hybrid root-finding algorithm combining the bisection method, the secant method and inverse quadratic interpolation. It has the reliability of bisection but it can be as quick as some of the less-reliable methods. The algorithm tries to use the potentially fast-converging secant method or inverse quadratic interpolation if possible, but it falls back to the more robust bisection method if necessary. Brent's method is due to Richard Brent and builds on an earlier algorithm by Theodorus Dekker. Consequently, the method is also known as the Brent–Dekker method.

Modern improvements on Brent's method include Chandrupatla's method, which is simpler and faster for functions that are flat around their roots; Ridders' method, which performs exponential interpolations instead of quadratic providing a simpler closed formula for the iterations; and the ITP method which is a hybrid between regula-falsi and bisection that achieves optimal worst-case and asymptotic guarantees.

Dekker's method

The idea to combine the bisection method with the secant method goes back to .

Suppose that one wants to solve the equation ''f''(''x'') = 0. As with the bisection method, one needs to initialize Dekker's method with two points, say ''a''₀ and ''b''₀, such that ''f''(''a''₀) and ''f''(''b''₀) have opposite signs. If ''f'' is continuous on 'a''₀, ''b''₀ the intermediate value theorem guarantees the existence of a solution between ''a''₀ and ''b''₀.

Three points are involved in every iteration:
* ''b''_''k'' is the current iterate, i.e., the current guess for the root of ''f''.
* ''a''_''k'' is the "contrapoint", i.e., a point such that ''f''(''a''_''k'') and ''f''(''b''_''k'') have opposite signs, so the interval 'a''_''k'', ''b''_''k''contains the solution. Furthermore, , ''f''(''b''_''k''), should be less than or equal to , ''f''(''a''_''k''), , so that ''b''_''k'' is a better guess for the unknown solution than ''a''_''k''.
* ''b''_''k''−1 is the previous iterate (for the first iteration, one sets ''b''_''k''−1 = ''a''₀).

Two provisional values for the next iterate are computed. The first one is given by linear interpolation, also known as the secant method:
::$s = \begin b_k - \frac f(b_k), & \mbox f(b_k)\neq f(b_) \\ m & \mbox \end$

and the second one is given by the bisection method
::$m = \frac.$
If the result of the secant method, ''s'', lies strictly between ''b''_''k'' and ''m'', then it becomes the next iterate (''b''_''k''+1 = ''s''), otherwise the midpoint is used (''b''_''k''+1 = ''m'').

Then, the value of the new contrapoint is chosen such that ''f''(''a''_''k''+1) and ''f''(''b''_''k''+1) have opposite signs. If ''f''(''a''_''k'') and ''f''(''b''_''k''+1) have opposite signs, then the contrapoint remains the same: ''a''_''k''+1 = ''a''_''k''. Otherwise, ''f''(''b''_''k''+1) and ''f''(''b''_''k'') have opposite signs, so the new contrapoint becomes ''a''_''k''+1 = ''b''_''k''.

Finally, if , ''f''(''a''_''k''+1), < , ''f''(''b''_''k''+1), , then ''a''_''k''+1 is probably a better guess for the solution than ''b''_''k''+1, and hence the values of ''a''_''k''+1 and ''b''_''k''+1 are exchanged.

This ends the description of a single iteration of Dekker's method.

Dekker's method performs well if the function ''f'' is reasonably well-behaved. However, there are circumstances in which every iteration employs the secant method, but the iterates ''b''_''k'' converge very slowly (in particular, , ''b''_''k'' − ''b''_''k''−1, may be arbitrarily small). Dekker's method requires far more iterations than the bisection method in this case.

Brent's method

proposed a small modification to avoid the problem with Dekker's method. He inserts an additional test which must be satisfied before the result of the secant method is accepted as the next iterate. Two inequalities must be simultaneously satisfied:

Given a specific numerical tolerance $\delta$, if the previous step used the bisection method, the inequality $, \delta, < , b_k - b_,$ must hold to perform interpolation, otherwise the bisection method is performed and its result used for the next iteration.

If the previous step performed interpolation, then the inequality $, \delta, < , b_ - b_,$ is used instead to perform the next action (to choose) interpolation (when inequality is true) or bisection method (when inequality is not true).

Also, if the previous step used the bisection method, the inequality $, s-b_k, < \begin \frac12 \end , b_k - b_,$
must hold, otherwise the bisection method is performed and its result used for the next iteration. If the previous step performed interpolation, then the inequality $, s-b_k, < \begin \frac12 \end , b_ - b_,$
is used instead.

This modification ensures that at the ''k''th iteration, a bisection step will be performed in at most $2\log_2(, b_-b_, /\delta)$ additional iterations, because the above conditions force consecutive interpolation step sizes to halve every two iterations, and after at most $2\log_2(, b_-b_, /\delta)$ iterations, the step size will be smaller than $\delta$, which invokes a bisection step. Brent proved that his method requires at most ''N''² iterations, where ''N'' denotes the number of iterations for the bisection method. If the function ''f'' is well-behaved, then Brent's method will usually proceed by either inverse quadratic or linear interpolation, in which case it will converge superlinearly.

Furthermore, Brent's method uses inverse quadratic interpolation instead of linear interpolation (as used by the secant method). If ''f''(''b''_''k''), ''f''(''a''_''k'') and ''f''(''b''_''k''−1) are distinct, it slightly increases the efficiency. As a consequence, the condition for accepting ''s'' (the value proposed by either linear interpolation or inverse quadratic interpolation) has to be changed: ''s'' has to lie between (3''a''_''k'' + ''b''_''k'') / 4 and ''b''_''k''.

Algorithm

input ''a'', ''b'', and (a pointer to) a function for ''f''
calculate ''f''(''a'')
calculate ''f''(''b'')
if ''f''(''a'')''f''(''b'') ≥ 0 then
exit function because the root is not bracketed.
end if
if , ''f''(''a''), < , ''f''(''b''), then
swap (''a'',''b'')
end if
''c'' := ''a''
set mflag
repeat until ''f''(''b'' or ''s'') = 0 or , ''b'' − ''a'', is small enough ''(convergence)''
if ''f''(''a'') ≠ ''f''(''c'') and ''f''(''b'') ≠ ''f''(''c'') then
''( inverse quadratic interpolation)''
else
''( secant method)''
end if
if ''(condition 1)'' ''s'' is not or
''(condition 2)'' (mflag is set and , ''s''−''b'', ≥ , ''b''−''c'', /2) or
''(condition 3)'' (mflag is cleared and , ''s''−''b'', ≥ , ''c''−''d'', /2) or
''(condition 4)'' (mflag is set and , ''b''−''c'', < , , ) or
''(condition 5)'' (mflag is cleared and , ''c''−''d'', < , , ) then
$s := \frac$ ''(bisection method)''
set mflag
else
clear mflag
end if
calculate ''f''(''s'')
''d'' := ''c'' ''(d is assigned for the first time here; it won't be used above on the first iteration because mflag is set)''
''c'' := ''b''
if ''f''(''a'')''f''(''s'') < 0 then
''b'' := ''s''
else
''a'' := ''s''
end if
if , ''f''(''a''), < , ''f''(''b''), then
swap (''a'',''b'')
end if
end repeat
output ''b'' ''or s (return the root)''

Example

Suppose that we are seeking a zero of the function defined by ''f''(''x'') = (''x'' + 3)(''x'' − 1)².

We take 'a''₀, ''b''₀= minus;4, 4/3'' as our initial interval.

We have ''f''(''a''₀) = −25 and ''f''(''b''₀) = 0.48148 (all numbers in this section are rounded), so the conditions ''f''(''a''₀) ''f''(''b''₀) < 0 and , ''f''(''b''₀), ≤ , ''f''(''a''₀), are satisfied.

# In the first iteration, we use linear interpolation between (''b''₋₁, ''f''(''b''₋₁)) = (''a''₀, ''f''(''a''₀)) = (−4, −25) and (''b''₀, ''f''(''b''₀)) = (1.33333, 0.48148), which yields ''s'' = 1.23256. This lies between (3''a''₀ + ''b''₀) / 4 and ''b''₀, so this value is accepted. Furthermore, ''f''(1.23256) = 0.22891, so we set ''a''₁ = ''a''₀ and ''b''₁ = ''s'' = 1.23256.
# In the second iteration, we use inverse quadratic interpolation between (''a''₁, ''f''(''a''₁)) = (−4, −25) and (''b''₀, ''f''(''b''₀)) = (1.33333, 0.48148) and (''b''₁, ''f''(''b''₁)) = (1.23256, 0.22891). This yields 1.14205, which lies between (3''a''₁ + ''b''₁) / 4 and ''b''₁. Furthermore, the inequality , 1.14205 − ''b''₁, ≤ , ''b''₀ − ''b''₋₁, / 2 is satisfied, so this value is accepted. Furthermore, ''f''(1.14205) = 0.083582, so we set ''a''₂ = ''a''₁ and ''b''₂ = 1.14205.
# In the third iteration, we use inverse quadratic interpolation between (''a''₂, ''f''(''a''₂)) = (−4, −25) and (''b''₁, ''f''(''b''₁)) = (1.23256, 0.22891) and (''b''₂, ''f''(''b''₂)) = (1.14205, 0.083582). This yields 1.09032, which lies between (3''a''₂ + ''b''₂) / 4 and ''b''₂. But here Brent's additional condition kicks in: the inequality , 1.09032 − ''b''₂, ≤ , ''b''₁ − ''b''₀, / 2 is not satisfied, so this value is rejected. Instead, the midpoint ''m'' = −1.42897 of the interval 'a''₂, ''b''₂is computed. We have ''f''(''m'') = 9.26891, so we set ''a''₃ = ''a''₂ and ''b''₃ = −1.42897.
# In the fourth iteration, we use inverse quadratic interpolation between (''a''₃, ''f''(''a''₃)) = (−4, −25) and (''b''₂, ''f''(''b''₂)) = (1.14205, 0.083582) and (''b''₃, ''f''(''b''₃)) = (−1.42897, 9.26891). This yields 1.15448, which is not in the interval between (3''a''₃ + ''b''₃) / 4 and ''b''₃). Hence, it is replaced by the midpoint ''m'' = −2.71449. We have ''f''(''m'') = 3.93934, so we set ''a''₄ = ''a''₃ and ''b''₄ = −2.71449.
# In the fifth iteration, inverse quadratic interpolation yields −3.45500, which lies in the required interval. However, the previous iteration was a bisection step, so the inequality , −3.45500 − ''b''₄, ≤ , ''b''₄ − ''b''₃, / 2 need to be satisfied. This inequality is false, so we use the midpoint ''m'' = −3.35724. We have ''f''(''m'') = −6.78239, so ''m'' becomes the new contrapoint (''a''₅ = −3.35724) and the iterate remains the same (''b''₅ = ''b''₄).
# In the sixth iteration, we cannot use inverse quadratic interpolation because ''b''₅ = ''b''₄. Hence, we use linear interpolation between (''a''₅, ''f''(''a''₅)) = (−3.35724, −6.78239) and (''b''₅, ''f''(''b''₅)) = (−2.71449, 3.93934). The result is ''s'' = −2.95064, which satisfies all the conditions. But since the iterate did not change in the previous step, we reject this result and fall back to bisection. We update ''s'' = -3.03587, and ''f''(''s'') = -0.58418.
# In the seventh iteration, we can again use inverse quadratic interpolation. The result is ''s'' = −3.00219, which satisfies all the conditions. Now, ''f''(''s'') = −0.03515, so we set ''a''₇ = ''b''₆ and ''b''₇ = −3.00219 (''a''₇ and ''b''₇ are exchanged so that the condition , ''f''(''b''₇), ≤ , ''f''(''a''₇), is satisfied). (''Correct'' : linear interpolation )
# In the eighth iteration, we cannot use inverse quadratic interpolation because ''a''₇ = ''b''₆. Linear interpolation yields ''s'' = −2.99994, which is accepted. (''Correct'' : )
# In the following iterations, the root ''x'' = −3 is approached rapidly: ''b''₉ = −3 + 6·10⁻⁸ and ''b''₁₀ = −3 − 3·10⁻¹⁵. (''Correct'' : Iter 9 : ''f''(''s'') = −1.4 × 10⁻⁷, Iter 10 : ''f''(''s'') = 6.96 × 10⁻¹²)

Implementations

* published an Algol 60 implementation.
* Netlib contains a Fortran translation of this implementation with slight modifications.
* The PARI/GP method implements the method.
* Other implementations of the algorithm (in C++, C, and Fortran) can be found in the Numerical Recipes books.
* The Apache Commons Math library implements the algorithm in Java.
* The SciPy optimize module implements the algorithm in Python (programming language)
* The Modelica Standard Library implements the algorithm in Modelica.
* The function implements the algorithm in R (software).
* The function implements the algorithm in MATLAB.
* The Boost (C++ libraries) implements two algorithms based on Brent's method in C++ in the Math toolkit:
*# Function minimization a
minima.hpp
with an exampl


*# Root finding implements the newer TOMS748, a more modern and efficient algorithm than Brent's original, a
TOMS748
an

tha

wit
examples

* Th
Optim.jl
package implements the algorithm in Julia (programming language)
* Th
Emmy
computer algebra system (written in Clojure (programming language)) implements a variant of the algorithm designed for univariate function minimization.

Root-Finding in C#
library hosted in Code Project.

References

*
*

Further reading

*
*
*

External links

zeroin.f
at Netlib.

module brent in C++ (also C, Fortran, Matlab)
by John Burkardt


implementation.


implementation.


implementation

{{Root-finding algorithms

Root-finding algorithms