2.techniques of Solving Algebraic Equations

I I TECHNI QUES OF SOLVI NG
ALGEBRAI C EQUATI ONS

Techniques of Solving Algebraic Equations
Reference : Croft, A., & Davison, R. (2008). Mathematics for
Engineers - A Modern Interactive Approach, Pearson
Education.

Page 1
TYPES OF SOLUTIONS TO SYSTEM OF LINEAR EQUATIONS
When a system of linear equations is solved, there are 3
possible outcomes:

i.
i. a unique solution
ii. an infinite number of solutions
iii. no solution
Page 2
) (
1
3
1
3
1 0
3 2
1 0
3 3 2
solution unique
y
x
y x
y x
=
=
|
|
.
|
\
|
= +
= +
ii.

iii.

) solutions of number infinite (
0
3
0 0
3 2
6 6 4
3 3 2
|
|
.
|
\
|
= +
= +
y x
y x
) (
1
3
0 0
3 2
1 0 0
3 3 2
solution no
y x
y x
|
|
.
|
\
|
= +
= +
Page 3
CRAMERS RULE
Reference : Croft & Davison, Chapter 13, Blocks 1, 2

Cramers rule is a method that uses determinants to solve a
system of linear equations.
i. Two equations in 2 unknowns

If

then

0 , ,
2 2
1 1
2 2
1 1
2 2
1 1
2 2
1 1
2 2
1 1
= =
b a
b a
that provided
b a
b a
k a
k a
y
b a
b a
b k
b k
x
= +
= +
2 2 2
1 1 1
k y b x a
k y b x a
Page 4
ii. 3 equations in 3 unknowns

If where

then
= + +
= + +
= + +
3 3 3 3
2 2 2 2
1 1 1 1
k z c y b x a
k z c y b x a
k z c y b x a
3 3 3
2 2 2
1 1 1
3 3 3
2 2 2
1 1 1
3 3 3
2 2 2
1 1 1
3 3 3
2 2 2
1 1 1
3 3 3
2 2 2
1 1 1
3 3 3
2 2 2
1 1 1
, ,
c b a
c b a
c b a
k b a
k b a
k b a
z
c b a
c b a
c b a
c k a
c k a
c k a
y
c b a
c b a
c b a
c b k
c b k
c b k
x = = =
0
3 3 3
2 2 2
1 1 1
c b a
c b a
c b a
Page 5
e.g.1 Using Cramers rule, solve for x, y.
=
= +
9 2 7
3 5 2
y x
y x
Page 6
e.g.2 Using Cramers rule, solve for x, y and z.
= +
=
= + +
10 2 2 3
12 3 5 2
35 4 3 5
z y x
z y x
z y x
Page 7
INVERSE MATRIX METHOD
Writing System of Equations in Matrix Form

Note that

can be written as

This is called the matrix form of the simultaneous equations.
= +
= +
2 2 2
1 1 1
k y b x a
k y b x a
|
.
|
\
|
= |
.
|
\
|
|
.
|
\
|
2
1
2 2
1 1
k
k
y
x
b a
b a
Page 8
i.e. the general matrix form of a system of equations:

where A, X and B are matrices.
AX = B
Similarly,

can also be written as
= + +
= + +
= + +
3 3 3 3
2 2 2 2
1 1 1 1
k z c y b x a
k z c y b x a
k z c y b x a
|
|
|
.
|
\
|
=
|
|
|
.
|
\
|
|
|
|
.
|
\
|
3
2
1
3 3 3
2 2 2
1 1 1
k
k
k
z
y
x
c b a
c b a
c b a
Page 9
Solving Equations Using the Inverse Matrix Method
Consider the matrix form: AX = B
A
-1
AX = A
-1
B
I X = A
-1
B
X = A
-1
B
i.e. X can be found if A
-1
exists.
Page 10
e.g.3 Redo example 1 and example 2 using the inverse
matrix method.
Page 11
GAUSSIAN ELIMINATION
Reference : Croft & Davison, Chapter 13, Block 3

Introduction
Gaussian Elimination is a systematic way of simplifying a
system of equations.
A matrix, called an augmented matrix, which captures all the
properties of the equations, is used.
A sequence of elementary row operations on this matrix
eventually brings it into a form known as echelon form (to be
discussed in Page 32).
From this, the solution to the original equations is easily found.
Page 12
Augmented Matrix

Consider the system of equations,

it can be represented by an augmented matrix:
= +
= +
2 2 2
1 1 1
k y b x a
k y b x a
constants
ts coefficien
k
k
b a
b a
|
|
.
|
\
|
2
1
2 2
1 1

this vertical line can be
omitted as in your textbook
Page 13
Similarly, the following system of equations:

can also be written as an augmented matrix:
= + +
= + +
= + +
3 3 3 3
2 2 2 2
1 1 1 1
k z c y b x a
k z c y b x a
k z c y b x a
|
|
|
.
|
\
|
3
2
1
3 3 3
2 2 2
1 1 1
k
k
k
c b a
c b a
c b a
Page 14
e.g.1 Write down the augmented matrices for the followings

a.

b.

c.
=
= +
23 12 7
7 9 3
y x
y x
= + +
= +
= +
7 3 22 4
64 2 12 5
15 65 7 9
z y x
z y x
z y x
= +
= +
= +
7 5 3
12 3 8 4
6 3 17
z y
z y x
y x
Page 15
e.g.2 Solve the system with the augmented matrix:

a.

b.
|
|
.
|
\
|
2
15
1 0
7 1
|
|
|
.
|
\
|

1
1
5
1 0 0
3 1 0
1 2 1
Page 16
Row-Echelon Form of an Augmented Matrix
For a matrix to be in row-echelon form:
i. Any rows that consist entirely of zeros are the last rows of
the matrix.
ii. For a row that is not all zeros, the first non-zero element is a
one, called a leading 1.
iii. While moving down the rows of the matrix, the leading 1s
move progressively to the right.

Page 17
e.g.1 Determine which of the following matrices are in row-
echelon form.

a. b.
|
|
|
.
|
\
|
22
14
78
1 0 0
8 1 0
5 2 1
|
|
|
.
|
\
|
27
2
5
1 1 0
1 0 0
1 4 1
Page 18
Elementary Row Operations
The elementary operations that change a system but leave
the solution unaltered are:
i. Interchange the order of the equations.
ii. Multiply or divide an equation by a non-zero constant.
iii. Add, or subtract, a multiple of one equation to, or from,
another equation.
Page 19
Note that a row of an augmented matrix corresponds to an
equation of the system of equations.
When the above elementary operations are applied to the
rows of such a matrix, they do not change the solution of the
system.
They are called elementary row operations.
Page 20
Gaussian Elimination to Solve a System of Equations
i. write down the augmented matrix.
ii. apply elementary row operations to get row-echelon form.
iii. solve the system.

Page 21
Page 22
e.g.2 Use Gaussian Elimination to solve

The augmented matrix is

Interchange row 1 and row 2
= +
= +
= + +
1 2 4
4 3 3
8 2 2
z y x
z y x
z y x
|
|
|
.
|
\
|

1 1 2 4
4 3 3 1
8 2 1 2
|
|
|
.
|
\
|

1 1 2 4
8 2 1 2
4 3 3 1
|
|
|
.
|
\
|

17 13 14 0
16 4 7 0
4 3 3 1
row 2 2*row 1
row 3 4*row 1
Page 23
|
|
|
.
|
\
|

15 5 0 0
16 4 7 0
4 3 3 1
row 3 2*row 2

row 2 / 7
row 3 / -5
|
|
|
.
|
\
|

3 1 0 0
7
16
7
4
1 0
4 3 3 1
Hence

The solution is
1 or 4 3 3
4 or
7
16
7
4
3
= = +
= =
=
x z y x
y z y
z
{ } { }
T T
z y x 3 4 1 =
e.g.3 Use Gaussian elimination to solve
=
= +
3 2 3
5 3 4
y x
y x
Page 24
e.g.4 Use Gaussian elimination to solve
= + +
= +
= +
2 2 3
8 5 3 2
12 4 2
z y x
y x z
z y x
Page 25
Gaussian Elimination to find the Inverse of a Matrix
i. write down in a form of .
ii. apply a sequence of elementary row operations to
reduce A to I.
iii. Performing this same sequence of elementary row
operations on I, we obtain A
-1
.

Page 26
] [ I A
Page 27
|
|
|
.
|
\
|

=
|
|
|
.
|
\
|

|
|
|
.
|
\
|

|
|
|
.
|
\
|

|
|
|
.
|
\
|
|
|
|
.
|
\
|
|
|
|
.
|
\
|
1 3 5
2 5 8
6 16 27
Hence
1 3 5 1 0 0
2 5 8 0 1 0
6 16 27 0 0 1
1 3 5 1 0 0
2 5 8 0 1 0
2 6 11 0 2 1
1 3 5 1 0 0
0 1 2 2 1 0
0 0 1 2 2 1
1 0 1 5 3 0
0 1 2 2 1 0
0 0 1 2 2 1
1 0 0 7 1 1
0 1 0 6 3 2
0 0 1 2 2 1

7 1 1
6 3 2
2 2 1
Suppose
1
A
A

2.techniques of Solving Algebraic Equations

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

2.techniques of Solving Algebraic Equations

Uploaded by

Copyright:

Available Formats

I I TECHNI QUES OF SOLVI NG

ALGEBRAI C EQUATI ONS

You might also like