HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Earth and Environmental Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Notes
  2. /Numerical Solution of Equations: Quick Revision
Mathematics

Numerical Solution of Equations: Quick Revision

A brief note on locating roots by a change of sign, bisection and its step count, fixed-point iteration and its convergence rule, and Newton's method with its failures.

StemPy LabWritten by StemPy Lab
Log in to save

A brief note on Numerical Solution of Equations. Read it before a test. Try each question at the end before you open its answer.

Locating and bisecting

  • Change of sign: a continuous fff with f(a)f(b)<0f(a)f(b) < 0f(a)f(b)<0 has a root in (a,b)(a, b)(a,b).
  • Traps: a break in the graph, a touching root, two roots close together.
  • To ddd places: test the ends of the rounding interval.
  • Bisection width: b−a2n\dfrac{b - a}{2^n}2nb−a​ after nnn steps.

Iteration

  • Fixed point: g(α)=αg(\alpha) = \alphag(α)=α; iterate xn+1=g(xn)x_{n+1} = g(x_n)xn+1​=g(xn​).
  • Errors: en+1≈g′(α) ene_{n+1} \approx g'(\alpha)\,e_nen+1​≈g′(α)en​, linear speed.
  • Rule: converges when ∣g′(α)∣<1|g'(\alpha)| < 1∣g′(α)∣<1.
  • Shapes: staircase for g′>0g' > 0g′>0, cobweb for g′<0g' < 0g′<0.

Newton's method

  • Step: xn+1=xn−f(xn)f′(xn)x_{n+1} = x_n - \dfrac{f(x_n)}{f'(x_n)}xn+1​=xn​−f′(xn​)f(xn​)​.
  • Square root: xn+1=12(xn+Nxn)x_{n+1} = \tfrac{1}{2}\left(x_n + \tfrac{N}{x_n}\right)xn+1​=21​(xn​+xn​N​).
  • Speed: en+1≈Cen2e_{n+1} \approx C e_n^2en+1​≈Cen2​ at a simple root.
  • Failures: flat tangents, cycles, x3\sqrt[3]{x}3x​, slow at repeated roots.

A worked example

Find 6\sqrt{6}6​ by Newton's method from x0=2x_0 = 2x0​=2.

  1. First step. x1=12(2+3)=2.5x_1 = \tfrac{1}{2}(2 + 3) = 2.5x1​=21​(2+3)=2.5.
  2. Second step. x2=12(2.5+2.4)=2.45x_2 = \tfrac{1}{2}(2.5 + 2.4) = 2.45x2​=21​(2.5+2.4)=2.45.
  3. Check. 2.452=6.00252.45^2 = 6.00252.452=6.0025, already close to 666.

Practice with new numbers

A program to try

The program finds the root of x=cos⁡xx = \cos xx=cosx in two ways, by iteration and by Newton's method, and counts the steps of each.

Read it first. Then run it. Which method needs fewer steps?

1. Change tol to 1e-14. How do the two counts change?

Mistakes to avoid

  • A sign change across a break proves nothing.
  • The slope at x0x_0x0​ does not decide convergence; the slope at α\alphaα does.
  • Dividing by fff instead of f′f'f′ in Newton's step.
  • Degrees in place of radians.

Check yourself

  1. Show that x3+x−1=0x^3 + x - 1 = 0x3+x−1=0 has a root in (0,1)(0, 1)(0,1).
  1. How many bisection steps take the width of [0,1][0, 1][0,1] below 0.010.010.01?
  1. Does xn+1=2cos⁡xnx_{n+1} = 2\cos x_nxn+1​=2cosxn​ converge to its fixed point near 1.031.031.03?
  1. Write Newton's step for x3=4x^3 = 4x3=4.
  1. Why is Newton's method slow at a double root?

Sources

  • OpenStax, Calculus Volume 1, Section 4.9, Newton's Method.
← All Notes
← Hyperbolic Functions: Quick RevisionNumerical Integration: Quick Revision →
More onNumerical Methods

Discussion (0)

Log in to join the discussion.

Loading…

On this page

  1. Locating and bisecting
  2. Iteration
  3. Newton's method
  4. A worked example
  5. Practice with new numbers
  6. A program to try
  7. Mistakes to avoid
  8. Check yourself
  9. Sources

Goes with the lesson

  1. The Newton-Raphson methodNumerical Solution of Equations

More notes on this topic

  1. Numerical Integration: Quick Revision
All notes on this topic →