Math 2250-010
Fri Jan 31
, Superquiz to start! Then ...
3.1-3.2 In Chapters 3-4 we divert to matrix algebra and linear algebra, to give us the foundations for
studying higher order differential equations and systems of differential equations, in the subsequent
chapters. In the first several sections of Chapter 3 we review linear systems of (algebraic) equations and
how to solve them via Gaussian elimination and the reduced row echelon form of augmented matrices.
Exercise 1: Check our homework problem on Simpson's rule, by setting up and solving the system of
three linear algebraic equations for the coefficients a, b, c of a quadratic function p x = a x2 C b x C c so
that for some fixed h O 0 the graph y = p x goes through the three points
Kh, y0 , 0, y1 , h, y2
For example, the graph of p x =Kx2 C x C 2 interpolates the three points K1, 0 , 0, 2 , 1, 2 :
quadratic fit to three points
(-1,0),(0,2),(1,2)
2
1
K1
K0.5
0
0.5
x
1
In 3.1-3.2 our goal is to understand systematic ways to solve simultaneous linear equations. Although we
used a, b, c for the unknowns in the previous problem, this is not our standard way of labeling.
, We'll often call the unknowns x1 , x2 ,... xn , or write them as elements in a vector
x = x1 , x2 , ... xn .
, Then the general linear system (LS) of m equations in the n unknowns can be written as
a11 x1 C a12 x2 C... C a1 n xn = b1
a21 x1 C a22 x2 C... C a2 n xn = b2
:
: :
am1 x1 C am2 x2 C... C am n xn = bm
where the coefficients ai j and the right-side number bj are known. The goal is to find values for the vector
x so that all equations are true. (Thus this is often called finding "simultaneous" solutions to the linear
system, because all equations will be true at once.)
Notice that we use two subscripts for the coefficients ai j and that the first one indicates which equation it
appears in, and the second one indicates which variable its multiplying; in the corresponding coefficient
matrix A , this numbering corresponds to the row and column of ai j :
a11 a12 a13 ...
Ad
a1 n
a21 a22 a23 ... a2 n
:
:
am1 am2 am3 ... am n
Let's start small, where geometric reasoning will help us understand what's going on:
Exercise 2: Describe the solution set of each single equation below; describe and sketch its geometric
realization in the indicated Euclidean spaces.
2a) 3 x = 5 , for x 2 = .
2b) 2 x C 3 y = 6, for x, y 2 =2 .
2c) 2 x C 3 y C 4 z = 12, for x, y, z 2 =3 .
2 linear equations in 2 unknowns:
a11 x C a12 y = b1
a21 x C a22 y = b2
goal: find all x, y making both of these equations true. So geometrically you can interpret this problem
as looking for the intersection of two lines.
Exercise 3: Consider the system of two equations E1 , E2 :
E1
5 xC3 y = 1
E2
x K2 y = 8
3a) Sketch the solution set in =2 , as the point of intersection between two lines.
3b) Use the following three "elementary equation operations" to systematically reduce the system E1 , E2
to an equivalent system (i.e. one that has the same solution set), but of the form
1 x C 0 y = c1
0 x C 1 y = c2
(so that the solution is x = c1 , y = c2 ). Make sketches of the intersecting lines, at each stage.
The three types of elementary equation operation are below. Can you explain why the solution set to the
modified system is the same as the solution set before you make the modification?
, interchange the order of the equations
, multiply one of the equations by a non-zero constant
, replace an equation with its sum with a multiple of a different equation.
3c) Look at your work in 3b. Notice that you could have save a lot of writing by doing this computation
"synthetically", i.e. by just keeping track of the coefficients and right-side values. Using R1 , R2 as
symbols for the rows, your work might look like the computation below. Notice that when you operate
synthetically the "elementary equation operations" correspond to "elementary row operations":
, interchange two rows
, multiply a row by a non-zero number
, replace a row by its sum with a multiple of another row.
3d) What are the possible geometric solutions sets to 1, 2, 3, 4 or any number of linear equations in two
unknowns?
Solutions to linear equations in 3 unknowns:
What is the geometric question you're answering?
Exercise 4) Consider the system
xC2 yCz = 4
3 x C 8 y C 7 z = 20
2 x C 7 y C 9 z = 23 .
Use elementary equation operations (or if you prefer, elementary row operations in the synthetic version)
to find the solution set to this system. There's a systematic way to do this, which we'll talk about. It's
called Gaussian elimination.
Hint: The solution set is a single point, x, y, z = 5,K2, 3 .
Exercise 5 There are other possibilities. In the two systems below we kept all of the coeffients the same
as in Exercise 4, except for a33 , and we changed the right side in the third equation, for 4a. Work out
what happens in each case.
5a)
xC2 yCz = 4
3 x C 8 y C 7 z = 20
2 x C 7 y C 8 z = 20 .
5b)
xC2 yCz = 4
3 x C 8 y C 7 z = 20
2 x C 7 y C 8 z = 23 .
5c) What are the possible solution sets (and geometric configurations) for 1, 2, 3, 4,... equations in 3
unknowns?
Summary of the systematic method known as Gaussian elimination, for solving linear systems of
(algebraic) equations
We write the linear system (LS) of m equations for the vector x = x1 , x2 ,...xn
a11 x1 C a12 x2 C... C a1 n xn = b1
a21 x1 C a22 x2 C... C a2 n xn = b2
:
: :
am1 x1 C am2 x2 C... C am n xn = bm
T
of the n unknowns as
The matrix that we get by adjoining (augmenting) the right-side b-vector to the coefficient matrix
A = ai j is called the augmented matrix A b :
a11 a12 a13 ...
a1 n
b1
a21 a22 a23 ... a2 n
b2
:
:
:
am1 am2 am3 ... am n bm
Our goal is to find all the solution vectors x to the system - i.e. the solution set .
There are three types of elementary equation operations that don't change the solution set to the linear
system. They are
,
,
,
interchange two of equations
multiply one of the equations by a non-zero constant
replace an equation with its sum with a multiple of a different equation.
And that when working with the augmented matrix A b these correspond to the three types of
elementary row operations:
,
,
,
interchange ("swap") two rows
multiply one of the rows by a non-zero constant
replace a row by its sum with a multiple of a different row.
Gaussian elimination: Use elementary row operations and work column by column (from left to right) and
row by row (from top to bottom) to first get the augmented matrix for an equivalent system of equations
which is in
row-echelon form:
(1) All "zero" rows (having all entries = 0) lie beneath the non-zero rows.
(2) The leading (first) non-zero entry in each non-zero row lies strictly to the right of the one above
it.
(At this stage you could "backsolve" to find all solutions.)
Next, continue but by working from bottom to top and from right to left instead, so that you end with an
augmented matrix that is in
reduced row echelon form: (1),(2), together with
(3) Each leading non-zero row entry has value 1 . Such entries are called "leading 1's "
(4) Each column that has (a row's) leading 1 has 0's in all the other entries.
Finally, read off how to explicitly specify the solution set, by "backsolving" from the reduced row echelon
form.
Note: There are lots of row-echelon forms for a matrix, but only one reduced row-echelon form. All
mathematical software will have a command to find the reduced row echelon form of a matrix.
Exercise 6 Find all solutions to the system of 3 linear equations in 5 unknowns
x1 K 2 x2 C 3 x3 C 2 x4 C x5 = 10
2 x1 K 4 x2 C 8 x3 C 3 x4 C 10 x5 = 7
3 x1 K 6 x2 C 10 x3 C 6 x4 C 5 x5 = 27 .
Here's the augmented matrix:
1 K2
3 2
1 10
2 K4
8 3 10
7
3 K6 10 6 5 27
Find the reduced row echelon form of this augmented matrix and then backsolve to explicitly parameterize
the solution set. (Hint: it's a two-dimensional plane in =5 , if that helps. :-) )
Maple says:
> with LinearAlgebra : # matrix and linear algebra library
> A d Matrix 3, 5, 1,K2, 3, 2, 1,
2,K4, 8, 3, 10,
3,K6, 10, 6, 5 :
b d Vector 10, 7, 27 :
Ab ;
# the mathematical augmented matrix doesn't actually have
# a vertical line between the end of A and the start of b
ReducedRowEchelonForm A b ;
1 K2
3 2
1 10
2 K4
8 3 10
7
3 K6 10 6
5 27
1 K2 0 0
3
0
0 1 0
2 K3
0
0 0 1 K4
5
7
> LinearSolve A, b ;
# this command will actually write down the general solution, using
# Maple's way of writing free parameters, which actually makes
# some sense. Generally when there are free parameters involved,
# there will be equivalent ways to express the solution that may
# look different. But usually Maple's version will look like yours,
# because it's using the same algorithm and choosing the free parameters
# the same way too.
>
(1)