Introduction Information in science, business, and mathematics is often organized into rows and...
Preview:
Citation preview
- Slide 1
- Slide 2
- Introduction Information in science, business, and mathematics
is often organized into rows and columns to form rectangular arrays
called matrices (plural of matrix). Matrices often appear as tables
of numerical data that arise from physical observations, but they
occur in various mathematical contexts as well. Example:
- Slide 3
- Linear Equations A line in a 2D plane (or x-y coordinate
system) can be represented as And a line in a 3D plane as The
following are examples of linear equations The following are NOT
linear equations
- Slide 4
- A finite set of linear equations are called linear systems (or
systems of linear equations) The variables are our unknowns A
general linear system of m equations in the n unknowns are written
as
- Slide 5
- 2 & 3 Unknowns in Linear Systems Linear systems in two
unknowns arise in connection with intersections of lines. For
example, consider the linear system in which the graphs of the
equations are lines in the xy-plane. Each solution (x, y) of this
system corresponds to a point of intersection of the lines, so
there are three possibilities
- Slide 6
- In general we say that the linear system is consistent if it
has 1 solution No solutions means the linear system is
inconsistent
- Slide 7
- Slide 8
- Slide 9
- Slide 10
- Slide 11
- Slide 12
- Slide 13
- Slide 14
- Slide 15
- Slide 16
- Augmented Matrices As the number of equations and unknowns
increase, so does the complexity of solving the system of linear
equations. We can abbreviate the linear system by partitioned
matrixaugmented matrix
- Slide 17
- What are Augmented Matrices? An augmented matrix of a system of
linear equations is really just that system without the variables
and signs (+ - x / =) The augmented matrix for
- Slide 18
- Elementary Row Operations The basic method for solving a linear
system is to perform appropriate algebraic operations on the system
that do not alter the solution set The 3 common row operations
performed on a matrix: Multiply a row through by a nonzero constant
Switch two distinct rows Add one row to another row
- Slide 19
- Example
- Slide 20
- Slide 21
- Slide 22
- Slide 23
- Slide 24
- Slide 25
- Slide 26
- Slide 27
- Slide 28
- Slide 29
- Slide 30
- Introduction to Elimination In this section we will develop a
systematic procedure for solving systems of linear equations. The
procedure is based on the idea of performing operations on rows of
augmented matrix that simplify it to a form from which the solution
to that system can be found. Almost all of the methods that are
used for solving large systems of equations are based on the simple
laws that we will develop here.
- Slide 31
- Reduced Row Echelon Form (RREF) To be RREF a matrix must have:
If a row does not consist entirely of zeros then the first nonzero
number in the row is a 1. If there are any rows that consist
entirely of zeros then they are grouped together @ bottom of matrix
In any 2 successive rows that do not consist entirely of zeros the
leading 1 in the lower row occurs farther to the right than the
leading 1 in the higher row Each column that contains a leading 1
has zeros everywhere else in that column
- Slide 32
- A matrix that has the first 3 properties is in ROW ECHELON
FORM. A matrix that has all 4 properties is in REDUCED ROW ECHELON
FORM.
- Slide 33
- Example: More on REF | RREF
- Slide 34
- Slide 35
- Definitions General Solution = A set of parametric equations
from which all solutions can be obtained by assigning numerical
values to the parameters. Applicable only when a linear system has
many solutions. An m X n matrix is a rectangular array of numbers
with m rows and n columns Size and arrangement matters
- Slide 36
- Slide 37
- Slide 38
- Slide 39
- Examples of matrices in REF
- Slide 40
- Examples of matrices NOT in REF
- Slide 41
- The 3 Elementary Row Operations 1. Scale a row by a non-zero
real number 2. Add a non-zero multiple of one row to another 3.
Exchange two rows Example of how to do this is shown on next
slide
- Slide 42
- Slide 43
- Slide 44
- Just keep doing Steps 1 4 for all the other rows
- Slide 45
- Slide 46
- Just keep doing Steps 1 4 for all the other rows Note: some
steps are missing and the final result is shown below
- Slide 47
- Determining solutions from REF of augmented matrix We use
Gaussian elimination to put the augmented matrix of a system of
linear equations in REF (row echelon form). If the augmented matrix
of a system is in row echelon form, we can determine the solutions
using substitution, starting with the last equation and working
upward. This is method of back-substitution
- Slide 48
- Possibilities for solutions The system has no solution =
therefore the system is inconsistent The system has a unique
solution = therefore the system is consistent The system has
infinitely many solutions THEOREM: If a REF of the augmented matrix
of a system of equations has a leading 1 in the final column then
the system is inconsistent & has no solutions.
- Slide 49
- Example of the Theorem
- Slide 50
- More on the Theorem If the row echelon form of the augmented
matrix of a system of linear equations does not have a leading 1 in
the final column then the system has a solution.
- Slide 51
- Variables and Parameters Leading variables = the variables
corresponding to the columns which contain a leading 1 Free
variables = variables that are free to take on any value. We
usually assign them an arbitrary constant. Parameters = The
arbitrary constants given to the free variables Different free
variables can have different values so you need to represent their
values with different symbols.
- Slide 52
- Slide 53
- Slide 54
- Slide 55
- Slide 56
- Gauss Jordan Elimination Gauss-Jordan elimination is an
extension of Gaussian elimination. Once a matrix is in row echelon
form, suitable multiples of lower rows are added to upper rows to
put zeros above each leading 1 starting with the leading 1 in the
lowest row and working upwards.
- Slide 57
- Slide 58
- Slide 59
- Matrices and RREF A matrix is said to be in reduced row echelon
form (RREF) is it is in row echelon form and any column containing
a leading 1 has zeros everywhere else in that column. Gauss-Jordan
Elimination will always result in a matrix in RREF
- Slide 60
- Slide 61
- Slide 62
- Slide 63
- Slide 64
- Slide 65
- Slide 66
- Slide 67
- Slide 68
- Slide 69
- Slide 70
- Slide 71
- Slide 72
- Slide 73
- Properties of Products If A and B are m x n matrices and x and
y are n x 1 column matrices and k is a real number then:
- Slide 74
- Slide 75
- Slide 76
- Slide 77
- For First Column: For Second Column: For Third Column:
Therefore
- Slide 78
- KNOW THIS !!!
- Slide 79
- Slide 80
- Slide 81
- Slide 82
- Slide 83
- Slide 84
- Slide 85
- Slide 86
- Slide 87
- Symmetric Matrices
- Slide 88
- Slide 89
- Identity Matrix
- Slide 90
- Theorem:
- Slide 91
- Slide 92
- Slide 93
- Slide 94
- Slide 95
- Properties of Matrices
- Slide 96
- Slide 97
- Slide 98
- Slide 99
- Slide 100
- Slide 101
- Slide 102
- Slide 103
- Slide 104
- Slide 105
- Slide 106
- Slide 107
- Slide 108
- Slide 109
- Slide 110
- Slide 111
- Slide 112
- Slide 113
- Slide 114
- Slide 115
- Slide 116
- Slide 117
- Slide 118
- Theorem of Invertible Matrices:
- Slide 119
- Slide 120
- Slide 121
- Slide 122
- Questions to Get Done Suggested practice problems (11th
edition) Section 1.1 #7, 11, 13 Section 1.2 #1, 3, 9, 11, 17, 19,
21, 25 Section 1.3 #3(a)-(h), 5(a)-(h), 7-15 odd, 23 Section 1.4:
#1, 3, 37, 39, 45, 49 Section 1.5: #1-7 odd, 9-17 odd, 19, 23, 25
Section 1.6: #1-17 odd