Brent's Method

For Brent's Minimization Method visit here.

The video covering the Brent-Dekker Method can be found here https://youtu.be/-bLSRiokgFk. Example code is given in the BrentDekker.hs file, written in Haskell, it compares Bisection, Secant Method, Dekker's Method, Inverse Quadratic Interpolation, and Brent's Method. You can run the program via CodingGround. To run the program locally have Haskell installed (Haskell.org) then type ghci BrentDekker.hsin the terminal in the directory where BrentDekker.hs is saved then type main to run. If you'd rather not use the terminal use an IDE instead like Haskell Platform or Geany to open, compile, and run the program.

Reference links:

• Cleve’s Corner MATLAB fzero https://blogs.mathworks.com/cleve/2015/10/12/zeroin-part-1-dekkers-algorithm/
• Dekker’s paper https://dl.acm.org/citation.cfm?id=355659
• Brent’s paper https://academic.oup.com/comjnl/article/14/4/422/325237
• Knuth’s paper https://dl.acm.org/citation.cfm?doid=361532.361538
• Cleve’s Corner George Forsythe https://blogs.mathworks.com/cleve/2013/01/07/george-forsythe/
• Code written by Richard Brent zeroin.f