Download presentation

Presentation is loading. Please wait.

Published byTaylor Challis Modified about 1 year ago

1
CHAPTER 1 Section 1.6 إعداد د. هيله العودان (وضعت باذن معدة العرض)

2
A BASIC THEOREM Theorem Every system of linear equations has either no solutions, exactly one solution, or infinitely many solutions.

3
SOLVING LINEAR SYSTEMS BY MATRIX INVERSION Theorem If A is an invertible n × n matrix, then for each n × 1 matrix b, the system of equations Ax = b has exactly one solution, namely, x= Aˉ¹ b.

4
Example 1 Consider the system of linear equations x x x 3 = 5 2 x x x 3 = 3 x x 3 = 17 In matrix form this system can be written as A x= b, where A= x = b = x1x2x3x1x2x

5
In Example 4 of the preceding section we showed that A is invertible and Aˉ¹= By Theorem the solution of the system is x = Aˉ¹ b== or x 1 =1, x 2 =-1, x 3 =

6
SOLVING MULTIPLE LINEAR SYSTEMS WITH A COMMON COEFFICENT MATRIX A x = b 1, A x = b 2, A x = b 3,..., A x = b k x 1 = A ˉ¹ b 1, x 2 = A ˉ¹ b 2, x 3 = A ˉ¹ b 3,..., x k = A ˉ¹ b k [ A ¦ b 1 ¦ b 2 ¦∙∙∙ ¦ b k ] (1) In which the coefficient matrix A is “augmented” by all k of the matrices b 1, b 2,...., b k. By reducing (1) to reduced row-echelon from we can solve all k systems at once by Gauss-Jordan elimination. This method has the added advantage that it applies even when A is not invertible.

7
Example 2 Solve the systems (a) x 1 +2 x 2 +3 x 3 =4 (b) x 1 +2 x 2 +3 x 3 =1 2 x 1 +5 x 2 +3 x 3 =5 2 x 1 +5 x 2 +3 x 3 =6 x 1 +8 x 3 =9 x 1 +8 x 3 =-6

8
Solution The two systems have the same coefficient matrix. If we augment this coefficient matrix with the columns of constants on the right sides of these systems, we obtain Reducing this matrix to reduced row-echelon form yields(verify) It follows from the last two column that the solution of system (a) is x 1 =1, x 2 =0, x 3 =1 and of system (b) is x 1 =2, x 2 =1, x 3 = ¦ 4 ¦ ¦ 5 ¦ ¦ 9 ¦ ¦ 1 ¦ ¦ 0 ¦ ¦ 1 ¦ -1

9
PROPERTIES OF INVERTIBLE MATRICES Theorem Let A be a square matrix. (a)If B is a square matrix satisfying BA=I, then B=Aˉ ¹. (b)If B is a square matrix satisfying AB=I, then B=Aˉ ¹.

10
Theorem If A is an n × n matrix then, the following are equivalent. (a) A is invertible. (b) Ax=0 has only the trivial solution. (c) The reduced row-echelon from of A is I n. (d) A is expressible as product of elementary matrices. (e) Ax= b is consistent for every n×1 matrix b. (f) Ax= b has exactly one solution for every n×1 matrix b.

11
Example 3 what conditions must b1, b2, and b3 satisfy in order for the system of equations x 1 + x 2 +2 x 3 = b 1 x 1 + x 3 = b 2 2 x 1 + x 2 +3 x 3 = b 3 to be consistent?

12
Solution. The augmented matrix is Which can be reduced to row-echelon form as follows b b b b b 2 - b b 3 -2 b b b 1 - b b 3 -2 b 1 -1 times the first row was added to the second and -2 times the first row was added to the third. The second row was Multiplied by -1.

13
It is now evident form the third row in the matrix that the system has a solution if and only if b 1, b 2, and b 3 satisfy the condition b 3 - b 2 - b 1 =0or b 3 = b 1 + b 2 To express this condition another way, Ax=b is consistent if and only if b is a matrix of the form b =where b 1 and b 2 are arbitrary b b 1 - b b 3 -b 2 - b 1 The second row was Added to the third. b1b2b1+b2b1b2b1+b2

14
DIAGONAL MATRICES A square matrix in which all of the entries off the main diagonal are zero is called a diagonal matrix ; some examples are A general n × n diagonal matrix D can be written as D= d 1 0 · · · 0 0 d 2 · · · 0 · · · 0 0 · · · d n

15
A diagonal matrix is invertible if and only if all of its diagonal entries are nonzero; in this case the inverse of (1) is Dˉ¹= 1/d 1 0 · · · 0 0 1/ d 2 · · · 0 · · · 0 0 · · · 1/ d n

16
The reader should verify that DD ˉ¹=D ˉ¹D=I Powers of diagonal matrices are easy to computer; we leave it for the reader to verify that if D is the diagonal matrix (1) and k is a positive integer, then D = d 1 0 · · · 0 0 d 2 · · · 0 · · · 0 0 · · · d n k k k k

17
Example 1 If A= Then Aˉ¹=A=A=

Similar presentations

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google