Omniadisce

Applied maths 10.5: Solving linear systems on a computer

Lesson Intermediate

Join free to take this lesson

Anyone can look around, but taking a lesson needs a free account. With one, your answers are checked step by step and your progress is saved, so you can stop and pick up where you left off on any device.

12 steps ยท about 18 min

By the end you can

  • Explain LU factorisation and predict how its cost grows with the size of the system
  • Choose a pivot by partial pivoting, and say why it matters
  • Use the condition number to judge how many digits of a solution to trust
  • Carry out Jacobi and Gauss-Seidel steps, and say when they converge

Who it is for: You can solve linear systems by elimination (unit 7) and know lesson 10.1.

The steps

  1. Double the size
  2. Elimination is LU
  3. Predict the cost
  4. Pivoting
  5. Pick the pivot
  6. The condition number
  7. Digits you can trust
  8. Iterative methods: Jacobi and Gauss-Seidel
  9. Two Jacobi steps
  10. A Gauss-Seidel step
  11. Which one converges?
  12. Five hundred load cases

Discussion 0 comments

Log in to join the discussion.

× Enlarged view