Scribd
Upload
78 views11 pages

Matrices and Gaussian Elimination

The document provides an introduction to matrices and Gaussian elimination. It defines linear combinations and linear equations. It then introduces systems of linear equations and shows how Gaussian elimination can be used to solve such systems by eliminating variables one at a time. Several examples are worked through step-by-step to demonstrate the elimination method.

Uploaded by

Luton Gregory
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
78 views11 pages

Matrices and Gaussian Elimination

The document provides an introduction to matrices and Gaussian elimination. It defines linear combinations and linear equations. It then introduces systems of linear equations and shows how Gaussian elimination can be used to solve such systems by eliminating variables one at a time. Several examples are worked through step-by-step to demonstrate the elimination method.

Uploaded by

Luton Gregory
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

Chapter 1

Matrices and Gaussian Elimination


1.1 Introduction
Definition A linear combination of x1 , x2 ,, xn has
the form
a1 x1  a2 x2   an xn
where the numbers a1 , a2 , , an are the combination’s
coefficients.
A linear equation in the variables x1 , x2 ,, xn has the form
a1 x1  a2 x2   an xn  d
where d is the constant.
Example The combination 3 x1  2 x2 of x1 , x2 is
linear.

The combination 3 x1  2 x2 is not a linear function


2

of x1 , x2 .
A system of linear equations

 a11 x1  a12 x2    a1n xn  b1


a x  a x   a x  b
 21 1 22 2 2n n 2

 
 an1 x1  an 2 x2    ann xn  bn
2x  3 y  1  2x  3 y  1
   5 x  16, x  3.2, y  1.8
 x y  5  3 x  3 y  15

8  22  41
z  2x  3 y
( 4)
Two equations 1x + 2y = 3 -4x -8y = -12
Two unknowns 4x + 5y = 6

1. Elimination
(equation 2) +(- 4)(equation 1) -3y = -6 y=2

Back-substitution 1x+2(2) = 3 x = -1

Finding the set of all solutions is solving the system. This


algorithm is Gauss’s Method (or Gaussian elimination or linear
elimination).
 x3  3
 3 x3  9

 x1  5 x2  2 x3  2
1  x1  5 x2  8 x2  1
 x1  2 x2 3 
3  x1  6 x2  9
x1  3
 x1  5 x2  6  2

 1
 3 x1  2 x2  3

 3 x3  9  a1 x1  a2 x2  a3 x3  b1
 
 x1  5 x2  2 x3  2  a4 x2  a5 x3  b2
1  a6 x3  b3
 x1  2 x2 3 
3

 3 x3  9 1
 x1  2 x2 3
 3
 1
x  5 x  2 x  2 swap row 1 with row 3 
1
2 3
 x1  5 x2  2 x3  2
 x1  2 x2 3  3 x3  9
3 1  3 
3 
1
multiply row 1 by 3 x1  3 x2  1 x3  3
add  1 times row 1

 x1  6 x2  9 to row 2  x1  6 x2 9
 
 x1  5 x2  2 x3  2   x2  2 x3  7
 3 x3  9  3 x3  9
 2  1 
 x y 0
 x y 0 2  21 

2x  y  3z  3   3 y  3z  3
 x  2y  z  3 3  1  3  2
   3 y  z  3

 x y 0 x1
 y  1
  3 y  3z  3
  4z  0 z0

 x  3y  1 2  21  x  3y  1
   x  3 y  1
 2 x  y  3   5 y   5  5 y  5
 2 x  2 y  2 3  21  4 y  4 
  y 1
 x  3y  1 2  21  x  3y  1 x  2
 
 2 x  y  3  5 y  5
 2x  2 y  0 3  21  4 y  2
 x  3y  1
 

4  5 y  5
3  2 
no solution 5 02

You might also like