|
|
| Line 1: |
Line 1: |
| In [[linear algebra]], an '''augmented matrix''' is a [[matrix (mathematics)|matrix]] obtained by appending the columns of two given matrices, usually for the purpose of performing the same [[elementary row operations]] on each of the given matrices.
| | I would like to introduce myself to you, I am Andrew and my wife doesn't like it at all. For many years he's been residing in Alaska and he doesn't strategy on changing it. Distributing production has been his profession for some time. To play lacross is the thing I love most of all.<br><br>Also visit my webpage: phone psychic - [http://help.ksu.edu.sa/node/65129 supplemental resources], |
| | |
| Given the matrices ''A'' and ''B'', where
| |
| | |
| <math>
| |
| A =
| |
| \begin{bmatrix}
| |
| 1 & 3 & 2 \\
| |
| 2 & 0 & 1 \\
| |
| 5 & 2 & 2
| |
| \end{bmatrix}
| |
| , \quad
| |
| B =
| |
| \begin{bmatrix}
| |
| 4 \\
| |
| 3 \\
| |
| 1
| |
| \end{bmatrix},
| |
| </math>
| |
| | |
| the augmented matrix (''A''|''B'') is written as
| |
| | |
| <math>
| |
| (A|B)=
| |
| \left[\begin{array}{ccc|c}
| |
| 1 & 3 & 2 & 4 \\
| |
| 2 & 0 & 1 & 3 \\
| |
| 5 & 2 & 2 & 1
| |
| \end{array}\right].
| |
| </math>
| |
| | |
| This is useful when solving [[system of linear equations|systems of linear equations]].
| |
| | |
| For a given number of unknowns, the number of solutions to a system of linear equations depends only on the rank of the matrix representing the system and the rank of the corresponding augmented matrix. Specifically, according to the [[Rouché–Capelli theorem]], any system of linear equations is [[System of linear equations#Consistency|inconsistent]] (has no solutions) if the [[rank (linear algebra)|rank]] of the augmented matrix is greater than the rank of the [[coefficient matrix]]; if, on the other hand, the ranks of these two matrices are equal, the system must have at least one solution. The solution is unique if and only if the rank equals the number of variables. Otherwise the general solution has ''k'' free parameters where ''k'' is the difference between the number of variables and the rank; hence in such a case there are an infinitude of solutions.
| |
| | |
| An augmented matrix may also be used to find the inverse of a matrix by combining it with the [[identity matrix]].
| |
| | |
| == Examples ==
| |
| ===Matrix inverse===
| |
| Let ''C'' be the square 2×2 matrix
| |
| :<math>
| |
| C =
| |
| \begin{bmatrix}
| |
| 1 & 3 \\
| |
| -5 & 0
| |
| \end{bmatrix}.
| |
| </math>
| |
| | |
| To find the inverse of C we create (''C''|''I'') where I is the 2×2 [[identity matrix]]. We then reduce the part of (''C''|''I'') corresponding to ''C'' to the identity matrix using only [[elementary row operations]] on (''C''|''I'').
| |
| | |
| :<math>
| |
| (C|I) =
| |
| \left[\begin{array}{cc|cc}
| |
| 1 & 3 & 1 & 0\\
| |
| -5 & 0 & 0 & 1
| |
| \end{array}\right]
| |
| </math> | |
| | |
| :<math> | |
| (I|C^{-1}) =
| |
| \left[\begin{array}{cc|cc}
| |
| 1 & 0 & 0 & -\frac{1}{5} \\
| |
| 0 & 1 & \frac{1}{3} & \frac{1}{15}
| |
| \end{array}\right]
| |
| </math>,
| |
| | |
| the right part of which is the inverse of the original matrix.
| |
| | |
| ===Existence and number of solutions===
| |
| | |
| Consider the system of equations
| |
| | |
| :''x'' + ''y'' + 2''z'' = 3 | |
| :''x'' + ''y'' + ''z'' = 1
| |
| :2''x'' + 2''y'' + 2''z'' = 2.
| |
| | |
| The coefficient matrix is
| |
| | |
| :<math>
| |
| A =
| |
| \begin{bmatrix}
| |
| 1 & 1 & 2 \\
| |
| 1 & 1 & 1 \\
| |
| 2 & 2 & 2 \\
| |
| \end{bmatrix},
| |
| </math>
| |
| | |
| and the augmented matrix is
| |
| | |
| :<math>
| |
| (A|B) =
| |
| \left[\begin{array}{ccc|c}
| |
| 1 & 1 & 2 & 3\\
| |
| 1 & 1 & 1 & 1 \\
| |
| 2 & 2 & 2 & 2
| |
| \end{array}\right].
| |
| </math>
| |
| | |
| Since both of these have the same rank, namely 2, there exists at least one solution; and since their rank is less than the number of unknowns, the latter being 3, there are an infinite number of solutions.
| |
| | |
| In contrast, consider the system
| |
| | |
| :''x'' + ''y'' + 2''z'' = 3
| |
| :''x'' + ''y'' + ''z'' = 1
| |
| :2''x'' + 2''y'' + 2''z'' = 5.
| |
| | |
| The coefficient matrix is
| |
| | |
| :<math>
| |
| A =
| |
| \begin{bmatrix}
| |
| 1 & 1 & 2 \\
| |
| 1 & 1 & 1 \\
| |
| 2 & 2 & 2 \\
| |
| \end{bmatrix},
| |
| </math>
| |
| | |
| and the augmented matrix is
| |
| | |
| :<math>
| |
| (A|B) =
| |
| \left[\begin{array}{ccc|c}
| |
| 1 & 1 & 2 & 3\\
| |
| 1 & 1 & 1 & 1 \\
| |
| 2 & 2 & 2 & 5
| |
| \end{array}\right].
| |
| </math>
| |
| | |
| In this example the coefficient matrix has rank 2 while the augmented matrix has rank 3; so this system of equations has no solution. Indeed, an increase in the number of linearly independent rows has made the system of equations '''inconsistent'''.
| |
| | |
| ===Solution of a linear system===
| |
| As used in linear algebra, an augmented matrix is used to represent the [[coefficients]] and the [[solution vector]] of each equation set.
| |
| For the set of equations
| |
| | |
| :<math>
| |
| \begin{align}
| |
| x + 2y + 3z &= 0 \\
| |
| 3x + 4y + 7z &= 2 \\
| |
| 6x + 5y + 9z &= 11
| |
| \end{align}
| |
| </math>
| |
| | |
| the coefficients and constant terms give the matrices
| |
| | |
| :<math>
| |
| A =
| |
| \begin{bmatrix}
| |
| 1 & 2 & 3 \\
| |
| 3 & 4 & 7 \\
| |
| 6 & 5 & 9
| |
| \end{bmatrix}
| |
| , \quad
| |
| B =
| |
| \begin{bmatrix}
| |
| 0 \\
| |
| 2 \\
| |
| 11
| |
| \end{bmatrix},
| |
| </math>
| |
| | |
| and hence give the augmented matrix
| |
| | |
| :<math>
| |
| (A|B) =
| |
| \left[\begin{array}{ccc|c}
| |
| 1 & 2 & 3 & 0 \\
| |
| 3 & 4 & 7 & 2 \\
| |
| 6 & 5 & 9 & 11
| |
| \end{array}\right]
| |
| </math>.
| |
| | |
| Note that the rank of the coefficient matrix, which is 3, equals the rank of the augmented matrix, so at least one solution exists; and since this rank equals the number of unknowns, there is exactly one solution.
| |
| | |
| To obtain the solution, row operations can be performed on the augmented matrix to obtain the identity matrix on the left side, yielding
| |
| | |
| :<math>
| |
| \left[\begin{array}{ccc|c}
| |
| 1 & 0 & 0 & 4 \\
| |
| 0 & 1 & 0 & 1 \\
| |
| 0 & 0 & 1 & -2 \\
| |
| \end{array}\right],
| |
| </math>
| |
| | |
| so the solution of the system is (''x'', ''y'', ''z'') = (4, 1, -2).
| |
| | |
| ==References==
| |
| * Marvin Marcus and Henryk Minc, ''A survey of matrix theory and matrix inequalities'', [[Dover Publications]], 1992, ISBN 0-486-67102-X. Page 31.
| |
| | |
| [[Category:Matrices]]
| |
I would like to introduce myself to you, I am Andrew and my wife doesn't like it at all. For many years he's been residing in Alaska and he doesn't strategy on changing it. Distributing production has been his profession for some time. To play lacross is the thing I love most of all.
Also visit my webpage: phone psychic - supplemental resources,