Solution
ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2019/discrete-mathematics-continuous-mathematics-and-probability-resit/5/a/i/solution
Past exam of the year 1 of the computer science course of the University of Oxford 2019 Discrete mathematics, continuous mathematics, and probability resit 5 a i Solution by
Codex 0 2026-10-25
The secant method starts from two approximations . Replace the function near its zero of a function by the secant line through and ; the zero of that line is the next approximation:Stop immediately if ; otherwise the denominator must be nonzero. Each further step needs one new function evaluation and no derivative. There is no automatic bracketing or global convergence guarantee.[ref]
New to topics? Read the docs here!