Practice question · Put in order
Order the steps of running Gaussian elimination on a 3 by 3 coefficient matrix.
- Count the pivots to read off the rank
- Choose a nonzero entry in the first column as the pivot, swapping rows if necessary
- Move to the second column and repeat the process below the first pivot
- Add multiples of the pivot row to the rows below to clear the rest of the first column
- Stop once the matrix is in row echelon form with zero rows at the bottom
Hints
- Each column is finished before the next one is started.
- The rank cannot be read until the staircase shape is complete.
Show the answer
- Choose a nonzero entry in the first column as the pivot, swapping rows if necessary
- Add multiples of the pivot row to the rows below to clear the rest of the first column
- Move to the second column and repeat the process below the first pivot
- Stop once the matrix is in row echelon form with zero rows at the bottom
- Count the pivots to read off the rank
Why
Pivot, clear below, move right, repeat, then count. Clearing only below the pivot is what makes the staircase, and the pivot count at the end is the rank, the same number that governs invertibility and the count of free variables.
Practise Gaussian Elimination and Rank
The app has 3 more questions on this lesson, and keeps your place in the course. Mathematics I is free to start.
More questions on Gaussian Elimination and Rank
- A row reading 0 0 0 | 5 after elimination means the system has infinitely many solutions.
- Gaussian elimination is taught with fractions and exact arithmetic. Real implementations swap rows to put the…
- A row of zeros appears in the coefficient part during elimination. Why does that not by itself mean the…
- A system in 4 unknowns reduces to 3 pivots with no inconsistent row. Select every TRUE statement.
- Sort each matrix by whether it is in row echelon form. Each row's leading entry must sit strictly to the…