- Linear Algebra
- System of Linear Equations
- بحث رياضيات
- Introduction to Matlab Application to Electrical Engineering Part II
- exam1
- PBS - Matrices
- Petroleum Reservoir Simulation - Khalid Aziz
- Worksheet 1
- Sparse Madasatrix Sudoku
- Sood 1979
- mccoy creative problem solving lesson
- Systems of Equations Test #1
- Num Linear
- Golub Flyer
- Cegep Linear Algebra Problems
- 1403.3148
- dynamic&approximation.pdf
- Final Assignment
- Key Concepts
- create equation present
- 9789814368940_Excerpt_001
- math2250syllabus
- Tutorial 7 Solution
- Gaussian Belief Propagation Theory and Application
- Unique 1
- Fatode Technical Report
- Solver Tutorial Solutions
- 01216163
- Argila Bruta
- Heat Transfer in a Composite Wall
- Lecture 18 Gaussian Elimination Part 3 (Infinite Solns)
- Lecture 19 Gaussian Elimination Applications (1)
- Lecture 20 Matrix Operations (1)
- MATH1231 II Integration Slides Summer 2014 (1)
- Lecture 16 Gaussian Elimination Part 1

**GAUSSIAN ELIMINATION PART 2
**

Any Augmented matrix may be reduced to echelon form via the row operations

Ri = Ri ± αRj

and

Ri ↔ Rj

**We can pivot off γ above to kill below by using Ri = Ri − Rj .
**

γ

Once in echelon form the system may be solved via back-substitution.

An inconsistent equation at any stage of the process indicates that there is no

solution and you may stop. Else

The presence of a non-leading column on the LHS of the echelon form indicates

infinite solutions with the non-leading variables serving as parameters.

**We saw in the last lecture how reduction to echelon form followed by back-substitution
**

could be used to solve 3 equations in 3 unknowns. We will see today that the number of

equations and unknowns is of no particular consequence and Gaussian elimination glides

along regardless.

We will also carefully examine the signals which indicate no solution and infinite solutions and how infinite solutions are presented. The nature of solution is not apparent

until echelon form has been achieved but it is then quite obvious how many solutions

there are and what you should do to find them.

Be aware that Gaussian elimination will never fail to work! This is one of the great

algorithms of mathematics.

Example 1: Solve the following system of linear equations and interpret the problem

geometrically.

3x − y

x+y

x−y

6x − 3y

=

=

=

=

4

8

−2

3

(1)

(2)

(3)

(4)

**Remember that our technique is to present the system as an augmented matrix [A| b]
**

and then use row operations Ri = Ri ± αRj and Ri ↔ Rj to reduce the system to echelon

form.

1

**Moving to the augmented matrix we
**

3

1

1

6

have:

−1

4

1

8

−1 −2

3

−3

**Applying the row ops:
**

R2 = R2 − 13 R1

R3 = R3 − 31 R1

R4 = R4 − 2R1

and

−1

4

4

20

0

3

3

10

2

−

0 −

3

3

0 −1

−5

3

yields

**But this is already a disaster because of all the fractions. Pressing forward will yield
**

the correct answer however the calculations will be dreadful. We have a sneaky trick to

avoid all this trouble. Let’s go back to the original matrix and start instead with the row

swap R1 ↔ R2 .

**Observe that it is always nicest to be pivoting off a 1.
**

F

2

**4 lines in R intersecting at a common point
**

2

x

y

=

3

5

F

**Note carefully from the above example that the presence of zero rows in the echelon
**

form DOES NOT imply infinite solutions.

We have swapped rows to simplify our calculations. Sometimes we have no choice but

to swap rows if we want echelon form.

Example 2: Solve the following system of linear equations.

x+y+z

x + y + 3z

2x + 3y + 4z

−x + 2y + z

=

=

=

=

6

14

23

11

F

x

−1

y = 3 . This is 4 planes intersecting at a common point in R3

y

4

3

F

**Instead of reducing to echelon form and back-substituting it is also possible to reduce
**

much further to what is called reduced row echelon form where every leading element

is 1 and only leading elements appear on the LHS of the echelon form. This is generally

inefficient but it is true that the solution if unique will appear on the RHS.

Example 3: Carry on the above reduction till reduced echelon form is produced. Hence

find the solution.

4

**We turn now to the issue of systems which have no solution and systems which have
**

an infinite number of solution. First note that it is not immediately obvious that we have

trouble and that the true nature of the system is only apparent when we are looking at

the echelon form.

The situation where there is no solution is simple. If at any stage you get zero equals

something non-zero you can stop and claim no solution. If there is no solution the problem

cannot hide forever and eventually the reduction will tease the issue out.

Example 4: Solve the following system of linear equations and interpret the problem

geometrically.

3x + 2y + 4z = 1

5x − y + 3z = 2

8x + y + 7z = 4

**We begin with a technical problem. The usual row operations we would use here are
**

5

8

kill

R2 = R2 − R1 and R3 = R3 − R1 (that is Ri = Ri −

Rj ).

3

3

use

But all the resulting fractions greatly increase the chance of an error being made! You

should never have to deal with fractions in row reduction. It is possible to use instead

R2 = 3R2 − 5R1 and R3 = 3R3 − 8R1 . These row operations are a little dodgy and

although they cause no problems here they will be inappropriate later on in the theory

of determinants......but they are OK for Gaussian elimination and we tend to use them

when there are no 1’s to pivot off. So :

F

**No solution. Three planes in R3 with no common point.
**

5

F

**The situation for infinite solutions is much trickier and very important for our later
**

work. The signal for infinitely many solutions is the presence of non-leading columns on

the LHS of the echelon form. The non-leading variables are assigned to be parameters

before back-substituting.

Example 5: Show that the following system of linear equations has infinitely many

solutions and express these solutions in parametric vector form. Explicitly find and check

three of these solutions. Describe the system geometrically.

x + 3y + 5z = 7

x + 4y + 7z = 11

2x + 7y + 12z = 18

F

F

x

−5

1

y = 4 + −2 t ; t ∈ R F

z

0

1

**Three planes in R3 intersecting along a common line.
**

6

F

**Example 6: For the following systems in echelon form describe the nature of solution
**

and identify which variables will need to be assigned as parameters when infinite solutions

exist.

1 4

7 4

5 0 0 14

6

a) 0 3 −1 5

b) 0 2 1

0 0

8 2

0 0 8

7

0 5

1

0 0 −1

c)

0 0

0

4

6

5

1 2

0

0 0 −1

d)

0 0

0

e)

3 5

1 0 2

0 0 −1 8 1

4

6

f)

1

0

0

0

0

1

1

0

0

0

4

6

0

8

5

0

0

0

**Recall that f) above was our first example today. Lots of zero rows but a unique
**

solution since every column on the left leads !

Remember: !!! ZERO ROWS DO NOT IMPLY INFINITE SOLUTIONS !!!

a), b), f) unique solutions and c) no solution.

F

d) ∞ solutions with x2 = t e) ∞ solutions with x2 = µ, x4 = λ, x5 = t

F

F

F

7

- Linear AlgebraUploaded byranaateeq
- System of Linear EquationsUploaded bymadihaahmad
- بحث رياضياتUploaded byhf
- Introduction to Matlab Application to Electrical Engineering Part IIUploaded byTrương Đức
- exam1Uploaded byVenkataramanan Suresh
- PBS - MatricesUploaded byZeroCRH
- Petroleum Reservoir Simulation - Khalid AzizUploaded byagusnurcahyo
- Worksheet 1Uploaded bypolipoli345
- Sparse Madasatrix SudokuUploaded bynkapre
- Sood 1979Uploaded byFernando Nicolas Ureta Godoy
- mccoy creative problem solving lessonUploaded byapi-256995276
- Systems of Equations Test #1Uploaded bySarah Wallace Bailey
- Num LinearUploaded byAnonymous fp9Kgglz
- Golub FlyerUploaded bySaher
- Cegep Linear Algebra ProblemsUploaded byham.karim
- 1403.3148Uploaded byRahman Hafeezul
- dynamic&approximation.pdfUploaded bydamu
- Final AssignmentUploaded byNafis M. Zaman
- Key ConceptsUploaded byJonathan Quintano
- create equation presentUploaded byapi-300252239
- 9789814368940_Excerpt_001Uploaded byroronoa_zorro11
- math2250syllabusUploaded byapi-246758620
- Tutorial 7 SolutionUploaded byIshika Singh
- Gaussian Belief Propagation Theory and ApplicationUploaded bycmmahon2001
- Unique 1Uploaded byChris Swim Lee
- Fatode Technical ReportUploaded bysfofoby
- Solver Tutorial SolutionsUploaded byRalf Sander
- 01216163Uploaded byKishan Bhushan Sahay
- Argila BrutaUploaded byPauliane Nogueira
- Heat Transfer in a Composite WallUploaded byravidahiwala

- Lecture 18 Gaussian Elimination Part 3 (Infinite Solns)Uploaded byffskdjfdkfjjk
- Lecture 19 Gaussian Elimination Applications (1)Uploaded byffskdjfdkfjjk
- Lecture 20 Matrix Operations (1)Uploaded byffskdjfdkfjjk
- MATH1231 II Integration Slides Summer 2014 (1)Uploaded byffskdjfdkfjjk
- Lecture 16 Gaussian Elimination Part 1Uploaded byffskdjfdkfjjk