Je bent je ingevulde velden bij deze pagina aan het verwijderen. Ben je zeker dat je dit wilt doen?
You are erasing your filled-in fields on this page. Are you sure that is what you want?
Nieuwe Versie BeschikbaarNew Version Available
Er is een update van deze pagina. Als je update naar de meest recente versie, verlies je mogelijk je huidige antwoorden voor deze pagina. Hoe wil je verdergaan ?
There is an updated version of this page. If you update to the most recent version, then your current progress on this page will be erased. Regardless, your record of completion will remain. How would you like to proceed?
or as a matrix equation as \(A \vec {x} = \vec {0}\).
Identity matrix
A square matrix with ones as diagonal entries and zeros for the remaining entries.
Inverse of a square matrix
Let \(A\) be an \(n\times n\) matrix. An \(n\times n\) matrix \(B\) is called an inverse of \(A\) if
\[AB=BA=I\]
where \(I\) is an \(n\times n\) identity matrix. If such an inverse matrix exists, we say that \(A\) is invertible. If an inverse does not exist, we say that
\(A\) is not invertible. The inverse of \(A\) is denoted by \(A^{-1}\).
LU factorization
A factorization \(A=LU\) where \(L\) is lower triangular and \(U\) is upper triangular with ones on the diagonal (called unit
upper triangluar). It is useful for solving \(Ax=b\).
Matrix
A rectangular array of numbers. It has \(m\) rows and \(n\) columns for some positive integers \(m\) and \(n\).
Matrix addition
Let \(A=\begin{bmatrix} a_{ij}\end{bmatrix} \) and \(B=\begin{bmatrix} b_{ij}\end{bmatrix}\) be two \(m\times n\) matrices. Then the sum of matrices\(A\) and \(B\), denoted by \(A+B\), is an \(m \times n\) matrix given
by
\[A+B=\begin{bmatrix}a_{ij}+b_{ij}\end{bmatrix}\]
Matrix factorization
Representing a matrix as a product of two or more matrices.
Matrix multiplication
Let \(A\) be an \(m\times n\) matrix whose rows are vectors \(\vec {r}_1\), \(\vec {r}_2,\ldots ,\vec {r}_n\). Let \(B\) be an \(n\times p\) matrix with columns \(\vec {b}_1, \vec {b}_2, \ldots , \vec {b}_p\). Then the matrix product \(AB\)
is an \(m \times p\) matrix with entries given by the dot products
If \(A\) is a square matrix then we can define \(A^k\) to be the result of multiplying \(A\) by itself \(k\) times.
Negative of a matrix
The additive inverse of a matrix, formed by multiplying the matrix by the scalar \(-1\).
Nonsingular matrix
A square matrix \(A\) is said to be nonsingular provided that \(\mbox {rref}(A)=I\). Otherwise we say that \(A\) is singular.
Partitioned matrices - block multiplication
Subdividing a matrix into submatrices using imaginary horizontal and vertical lines -
used to multiply matrices more efficiently.
Permutation matrix
A matrix formed by permuting the rows of the identity matrix.
Properties of matrix algebra
Addition and scalar multiplication of matrices have many nice properties. Matrix multiplication is
not commutative, but the associative and distributive laws hold. The inverse and transpose operations of a product follow the
"shoes and socks" rule.
Row matrix
A matrix with only \(1\) row and \(n\) columns.
Scalar multiple of a matrix
If \(A=\begin{bmatrix} a_{ij}\end{bmatrix} \) and \(k\) is a scalar, then \(kA=\begin{bmatrix} ka_{ij}\end{bmatrix}\).
Singular matrix
A square matrix \(A\) is said to be singular provided that \(\mbox {rref}(A)\) is NOT the identity matrix. If instead \(\mbox {rref}(A)=I\), we say that \(A\) is
nonsingular.
Square matrix
A matrix with the same number of rows and columns.
Symmetric matrix
An \(n\times n\) matrix \(A\) is said to be symmetric if \(A=A^{T}.\) It is said to be skew symmetric if \(A=-A^{T}.\)
Transpose of a matrix
Let \(A=\begin{bmatrix} a _{ij}\end{bmatrix}\) be an \(m\times n\) matrix. Then the transpose of \(A\), denoted by \(A^{T}\), is the \(n\times m\) matrix given by switching the rows and
columns:
\[ A^{T} = \begin{bmatrix} a _{ij}\end{bmatrix}^{T}= \begin{bmatrix} a_{ji} \end{bmatrix} \]
Zero matrix
The \(m\times n\)zero matrix is the \(m\times n\) matrix having every entry equal to zero. The zero matrix is denoted by \(O\).