maths.free › Linear Algebra › Row reduction

Row reduction

Gaussian elimination, rank and solving Ax = b.

Three row operations — swap, scale, add a multiple of one row to another — bring any matrix to reduced row-echelon form. The number of pivots is the rank; the reduced form of an augmented matrix reads out the solution of a linear system.

Przykład pracownika: rref [[1,2,3],[4,5,6],[7,8,9]]

Linear-Algebra · Row-Reduction

Rref [[1,2,3],[4,5,6],[7,8,9]]

\left[\begin{matrix}1 & 2 & 3\\4 & 5 & 6\\7 & 8 & 9\end{matrix}\right]

Krok po kroku

  1. \left[\begin{matrix}1 & 2 & 3\\4 & 5 & 6\\7 & 8 & 9\end{matrix}\right]

    Gauss–Jordan elimination.

  2. \left[\begin{matrix}1 & 2 & 3\\0 & -3 & -6\\7 & 8 & 9\end{matrix}\right]

    R2 ← R2 − (4)·R1 to clear column 1.

  3. \left[\begin{matrix}1 & 2 & 3\\0 & -3 & -6\\0 & -6 & -12\end{matrix}\right]

    R3 ← R3 − (7)·R1 to clear column 1.

  4. \left[\begin{matrix}1 & 2 & 3\\0 & 1 & 2\\0 & -6 & -12\end{matrix}\right]

    R2 ← R2 / -3 to make the pivot 1.

  5. \left[\begin{matrix}1 & 0 & -1\\0 & 1 & 2\\0 & -6 & -12\end{matrix}\right]

    R1 ← R1 − (2)·R2 to clear column 2.

  6. \left[\begin{matrix}1 & 0 & -1\\0 & 1 & 2\\0 & 0 & 0\end{matrix}\right]

    R3 ← R3 − (-6)·R2 to clear column 2.

  7. \left[\begin{matrix}1 & 0 & -1\\0 & 1 & 2\\0 & 0 & 0\end{matrix}\right]

    Reduced row-echelon form.

Odkryj odpowiedź
\left[\begin{matrix}1 & 0 & -1\\0 & 1 & 2\\0 & 0 & 0\end{matrix}\right]

Spróbuj sam.

Więcej w Linear Algebra

DeterminantsMatrix inverseEigenvalues and eigenvectorsMatrix multiplication