1.2 Gaussian Elimination and Gauss-Jordan Elimination Flashcards
Define matrix
A rectangular array denoted by m x n. m and n are positive integers defining number of rows and columns respectively. Normally named using capital letters.
entry
Number in a matrix. Denoted by aij, where index i is the row subscript and j is the column subscript
real matrix
A matrix in which each entry is a real number
Size of the matrix
Number of rows x number of columns
Square matrix
A matrix with the same # of rows and columns
A matrix with 4 rows and columns is ______ 4. The main diagonal entries of such a matrix would be ________.
square of order; a11, a22, a33, a44
The matrix containing only the coefficients of the system
coefficient matrix
The matrix derived from the coefficients and constant terms of a system of linear equations
augmented matrix
Name and list the matrix equivalent of the three operations that produce equivalent systems of linear equations
elementary row operations:
- Interchange two rows.
- Multiply a row by a nonzero constant.
- Add a multiple of a row to another row.
List the properties of a matrix in row-echelon form
- Any rows consisting entirely of zeros occur at the bottom of the matrix.
- For each row that does not consist entirely of zeros, the first nonzero entry is (called a leading 1).
- For two successive (nonzero) rows, the leading 1 in the higher row is farther to the left than the leading 1 in the lower row.
A matrix in row-echelon form is in reduced row-echelon form when every column that has a leading 1 has zeros in every position ________its leading 1
above and below
(T/F) Every matrix is row-equivalent to a matrix in row-echelon form
True
Describe the three steps involved in Gaussian Elimination with back-substitution
- Write the augmented matrix of the system of linear equations.
- Use elementary row operations to rewrite the matrix in row-echelon form.
- Write the system of linear equations corresponding to the matrix in row-echelon form, and use back-substitution to find the solution.
During Gaussian Elimination with back-substitution, you should operate _______ by _________ to obtain 0s in entries directly below leading 1s
left to right; columns
If during Gaussian Elimination you obtain a row of all zeros except for the last entry, you should conclude _________
The system has no solution, and is inconsistent