maths.free › Numerical Methods › Root finding: bisection and Newton's method

Root finding: bisection and Newton's method

Finding where f(x) = 0 to any accuracy, and how fast each method gets there.

Bisection halves an interval that brackets a root: slow but unfailing. Newton follows the tangent line to the axis, quadratic convergence when it works. Picture it: each tangent line landing closer to the root; the points x₀, x₁, x₂ are marked on the graph. Think it: Newton is a fixed-point iteration of x − f/f′, and its speed comes from that map having zero derivative at the root.

작업 예제 · newton's method on x^2 - 2 from 1

Numerical-Methods · Root-Finding

Newton's method on x^2 - 2

x^{2} - 2

단계별로

  1. f(x) = x^{2} - 2,\quad x_0 = 1

    Newton's method: x_{n+1} = x_n − f(x_n)/f′(x_n). Follow the tangent line down to the axis, repeat.

  2. f'(x) = 2 x

    Differentiate once; the same derivative serves every iteration.

  3. x_{1} = 1.0 - \frac{-1.0}{2.0} = 1.5

    Iteration 1.

  4. x_{2} = 1.5 - \frac{0.25}{3.0} = 1.41666667

    Iteration 2.

  5. x_{3} = 1.41666667 - \frac{0.00694444}{2.83333349} = 1.41421569

    Iteration 3.

  6. x_{4} = 1.41421569 - \frac{6.01 \cdot 10^{-6}}{2.82843161} = 1.41421356

    Iteration 4.

  7. x_{5} = 1.41421356 - \frac{0.0}{2.82842731} = 1.41421356

    Iteration 5.

  8. x_{6} = 1.41421356 - \frac{0.0}{2.82842731} = 1.41421356

    Iteration 6.

  9. \text{converged}

    The iterates have stopped changing to 12 decimal places.

  10. x \approx 1.41421356

    Quadratic convergence: the number of correct digits roughly doubles each step.

답을 드러내세요
x \approx 1.41421356

이제 너 문제를 선택하거나, 타이핑하거나, 자신만의 문제를 그려보세요. 모든 단계는 그림으로 표시되며, 답은 질문을 할 때까지 숨겨져 있습니다.

자신의 작업을 유지

무료 계정은 모든 수업에 노트를 추가, 당신이 완료 한 기록, 당신이 해결 한 문제를 한 곳에, 그리고 당신이이 페이지에 대해 물어 수업 지도자. 수학 자체는 모두에게 열려 있습니다, 로그인 여부.

가입하기 로그인

여기서 사용된 기호

기호를 탭하면 전체 정의, 이미지 및 각 문자의 의미를 확인할 수 있습니다.

어떻게: Root finding: bisection and Newton's method

  1. Bracket the root: find a and b with f(a) and f(b) of opposite sign.
  2. For bisection, halve the interval keeping the sign change; each step gains one bit.
  3. For Newton, start inside the bracket and iterate x − f(x)/f′(x).
  4. Stop when successive iterates agree to the precision you need, and confirm f is tiny there.

사람들이 묻는 질문

Why not just solve exactly?

Most equations have no closed-form solution at all, and many that do are unusable in practice. A numerical method delivers as many correct digits as you need, and a good one tells you how many that is.

Why can Newton's method fail?

If it starts where the tangent is nearly flat it shoots far away; near a repeated root it slows to a crawl; and with several roots it may land on the wrong one. A bracketing method like bisection is slower but cannot fail.

에 더 Numerical Methods

Numerical integration: trapezoid and SimpsonInterpolation and Taylor approximationFloating point and error