Gaussian Elimination - Linear Algebra
- What are the three elementary row operations?
- Swap two rows, multiply a row by a nonzero constant, and add a multiple of one row to another row.
- What is the goal of Gaussian elimination on an augmented matrix?
- To reach a row echelon form using row operations, then solve the resulting triangular system by back substitution.
- Row 1 has pivot and the entry below it in row 2 is . Which row operation clears that entry?
- . The multiplier is .
- When the entry in a pivot position is but an entry below it in the same column is nonzero, which row operation is used?
- A row swap, which moves a row with a nonzero entry into the pivot position.
- What do elementary row operations preserve about a linear system?
- Its solution set. Row-equivalent augmented matrices represent systems with exactly the same solutions.
- Apply to the augmented rows and . What is the new row 2, and what is ?
- The new row 2 is , so and .
- For which does elimination on , leave no pivot in the column?
- . gives ; at this reads , so there is no solution.
- Solve by back substitution: , , .
- . From , , then .
- How does Gauss-Jordan elimination go further than Gaussian elimination?
- It continues to reduced row echelon form: every pivot is scaled to and the entries above each pivot are also cleared.
- What is a pivot position in a matrix?
- A location that holds a leading entry in an echelon form of the matrix; its column is a pivot column.
- What three conditions define row echelon form?
- Zero rows are at the bottom, each leading entry lies to the right of the leading entry above it, and all entries below a leading entry are zero.
- Why is multiplying a row by not an allowed row operation?
- It cannot be reversed and it erases an equation, which can enlarge the solution set.