chapter three computational methods lecture note, Lecture notes of Computational Methods

lecture note on computational methods chapter three

Typology: Lecture notes

2020/2021

Uploaded on 06/02/2022

oliyad-dribssa
oliyad-dribssa 🇪🇹

5

(1)

2 documents

1 / 98

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Chapter 3
System of Linear Equations and
Matrices
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26
pf27
pf28
pf29
pf2a
pf2b
pf2c
pf2d
pf2e
pf2f
pf30
pf31
pf32
pf33
pf34
pf35
pf36
pf37
pf38
pf39
pf3a
pf3b
pf3c
pf3d
pf3e
pf3f
pf40
pf41
pf42
pf43
pf44
pf45
pf46
pf47
pf48
pf49
pf4a
pf4b
pf4c
pf4d
pf4e
pf4f
pf50
pf51
pf52
pf53
pf54
pf55
pf56
pf57
pf58
pf59
pf5a
pf5b
pf5c
pf5d
pf5e
pf5f
pf60
pf61
pf62

Partial preview of the text

Download chapter three computational methods lecture note and more Lecture notes Computational Methods in PDF only on Docsity!

Chapter 3

System of Linear Equations and

Matrices

3.1 Introduction to vectors and matrices

3.2 Existence and Uniqueness of Solutions

  • Matrix algebra is used to solve a system of simultaneous linear

equations. A general set of m linear equations and n unknowns,

A system of equations can be consistent or inconsistent. What does that
mean?
  • A system of equations [ A ][ X ]=[ C ] is consistent if there is a solution, and it is inconsistent if there is no solution. However, a consistent system of equations does not mean a unique solution, that is, a consistent system of equations may have a unique solution or infinite solutions. How can one distinguish between a consistent and inconsistent system of equations?
  • A system of equations [ A ][X]=[ C ] is consistent if the rank of A is equal to the rank of the augmented matrix [ A:C ].
  • A system of equations [ A ][X]=[ C ] is inconsistent if the rank of A is less than the rank of the augmented matrix [ A:C ].
  • But, what do you mean by rank of a matrix? The rank of a matrix is defined as the order of the largest square sub matrix whose determinant is not zero.
  • Example 1: What is the rank of
  • Hence the rank of the augmented matrix [ B ] is 3. Since [ A ] = [ D ] , the rank of [ A ] is 3. Since the rank of the augmented matrix [ B ] equals the rank of the coefficient matrix [A], the system of equations is consistent.
  • Example 3: Use the concept of rank to find if the equation is consistent or inconsistent.
  • Solution The augmented matrix is
  • Since there are no square sub matrices of order 4 x 4 as the augmented matrix [B] is a 4 x 3 matrix, the rank of the augmented matrix [ B ] is at most 3. So let us look at square sub matrices of the augmented matrix (B) of order 3 and see if any of the 3 x 3 sub matrices have a determinant not equal to zero.
  • So the rank of the coefficient matrix [ A ] is 2.
  • Since the rank of the coefficient matrix [ A ] is less than the rank of the augmented matrix [B] , the system of equations is inconsistent. Hence, no solution exists for [A ][ X ] = [ C ].

If a solution exists, how do we know whether it is unique?

  • Consistent systems of equations can only have a unique solution or infinite solutions. Can a system of equations have more than one but not infinite number of solutions? No, you can only have either a unique solution or infinite solutions.

3.3 Methods of solution of Linear Equations

3.3.1 Gaussian Elimination

How is a set of equations solved numerically?
  • One of the most popular techniques for solving simultaneous linear equations is the Gaussian elimination method. The approach is designed to solve a general set of n equations and n unknowns.
  • This is the end of the first step of forward elimination. Now for the second step of forward elimination, we start with the second equation as the pivot equation and a ’ 22 as the pivot