first part of the algorithm:
-reduces a given system to row echelon form, from which one can tell whether there are no solutions, a unique solution, or infinitely many solutions.
-also called LU decomposition
second part of the algorithm:
-continues to use row operations until the solution is found; in other words, it puts the matrix into reduced row echelon form.
Row operations
- Type 1: Swap the positions of two rows.
- Type 2: Multiply a row by a nonzero scalar.
- Type 3: Add to one row a scalar multiple of another.
| System of equations | Row operations | Augmented matrix |
|---|---|---|
 | ![\left[ \begin{array}{ccc|c}2 & 1 & -1 & 8 \\-3 & -1 & 2 & -11 \\-2 & 1 & 2 & -3\end{array} \right]](http://upload.wikimedia.org/math/a/e/c/aec68ce94e1b6e1ff6ceec8b101fb1a8.png) | |
 |   |
|
 |  | ![\left[ \begin{array}{ccc|c}2 & 1 & -1 & 8 \\0 & 1/2 & 1/2 & 1 \\0 & 0 & -1 & 1\end{array} \right]](http://upload.wikimedia.org/math/e/d/4/ed4fb494ed6599b52c52c3bfe3f7c673.png) |
| The matrix is now in echelon form (also called triangular form) | ||
 |   | ![\left[ \begin{array}{ccc|c}2 & 1 & 0 & 7 \\0 & 1/2 & 0 & 3/2 \\0 & 0 & -1 & 1\end{array} \right]](http://upload.wikimedia.org/math/4/9/1/491158718c1449be531702c4f1ff6148.png) |
 |   | ![\left[ \begin{array}{ccc|c}2 & 1 & 0 & 7 \\0 & 1 & 0 & 3 \\0 & 0 & 1 & -1\end{array} \right]](http://upload.wikimedia.org/math/1/1/2/112996a5509b59899c23258ec75df1a6.png) |
 |   | ![\left[ \begin{array}{ccc|c}1 & 0 & 0 & 2 \\0 & 1 & 0 & 3 \\0 & 0 & 1 & -1\end{array} \right]](http://upload.wikimedia.org/math/f/2/9/f2981fd8dffb705698e90dbcfcea25d5.png) |
![\left[ \begin{array}{ccc|c}2 & 1 & -1 & 8 \\0 & 1/2 & 1/2 & 1 \\0 & 2 & 1 & 5\end{array} \right]](http://upload.wikimedia.org/math/5/3/4/534bf79202eee563c9e155177799278a.png)
1067
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
