• 沒有找到結果。

Matrix II I.

N/A
N/A
Protected

Academic year: 2022

Share "Matrix II I."

Copied!
5
0
0

加載中.... (立即查看全文)

全文

(1)

Matrix II

I. Key mathematical terms

Terms Symbol Chinese translation

Reciprocal

Inverse Matrix

Transpose

II. Inverse Matrix

I

n real numbers, ifa0there exists a unique reciprocalb 1

a which satisfies

"abba1".

Definition:(Inverse Matrix)

Let A be a n×n square matrix. We say A is invertible (or nonsingular) if there exists a n×n square matrix B such that

ABBAIn

If such matrix B exists, we say B is” the inverse of A” and denoted asBA1. If no such inverse B exists for a matrix A, we say A is non-invertible (or singular).

<key> There can only exist at most one inverse.

<key>The matrix is singular if and only if det(A) = 0.

Example1.

3 2 2 1

1 1 , 2 1

A   B  

   

For each of the matrices A and B determine whether the matrix is singular. If the matrix is non-singular, find its inverse.

(Hint: You can use Cramer’s rule to solve the linear equation.)

(1) 3 2

A  1 1

  

(2) 2 1

B 2 1

  

 

(2)

Inverse of 2x2 Matrix

W

e can fine the inverse of any non-singular matrix.

The inverse of a matrix M is the matrixM1such thatMM1M M1I . In the case of 2x2 matrix A a b

c d

 

  

  a simple formula exists to find its inverse:

If A a b c d

 

  

  then 1 1 1

det( )

d b d b

A ad bc c a A c a

       

<key>

(1) If det(A)=0, then A is noninvertible.

(2) If det(A)≠0, then A is invertible.

<proof>

To varify the formula above, suppose B x u y v

 

  

  such thatABBAI2.

2

1 0

= 0 1 AB I

a b x u c d y v

    

     

    

We can get two systems of linear equations.

1 0

and

0 1

ax by au bv

cx dy cu dv

     

       We can use Cramer’s rule to solve these

equations.

(1) 1

0 ax by cx dy

 

  

(2) 0

1 au bv

cu dv

 

  

Finally we have:

ForA a b

c d

 

  

 

1 1 1

A     

   

(3)

Example2.

5 3 7 8

Given ,

2 1 4 5

A  B   (1) Find the inverse matrix of A.

(2) If AX=AB, Find X

III. Solving systems of equations by using matrices

We can use the inverse of n×n matrix to solve a system of n simultaneous linear equations in n unknowns. We will introduce how to solve the 2 simultaneous linear equations in 2 unknowns in our class.

If x and is non-singular, then x 1 .

A v A A v

y y

   

   

   

Example3.

Use an inverse matrix to solve the simultaneous equations: 2 4 4

3 5 3

x y x y

 

  

Example4.

Matrix A is a 2x2 matrix which satisfies 8 1 , 3 1

5 2 2 1

A       A       

        (1) Find matrix A

(2) If 3 0 , 0 3 AB  

  

  find B

(4)

IV. Properties of Inverse and Transpose Definition:(Transpose of Matrix)

G

iven an m×n matrix W we define Wt, the transpose of W, to be the n×m matrix whose (i,j)th entry is the (j,i)th entry of W ; that is the matrix for which

(Wt)ijWji For example

1 2

1 0 4

0 1 ;

2 1 3

4 3

t a b t a c

A A B B

c d b d

 

        

         

<key> Transpose of matrix is found by interchanging rows into columns (or columns into rows).

Properties of Inverse and Transpose

(1) A martix has at most one inverse.

(2) Assume A and B are invertible n×n matrices. Then the product AB is invertible and

1 1 1

(AB)B A

(3) We have (AB)tB At t and (A)t At for any matrix A and real constant .

(4) Assume A is invertible. Then the transpose At is invertible and

1 1

(At) (A )t

<explanation>

(1)

(2)

(3)

(4)

(5)

(Hint: Use the prorperties of inverse and transpose to solve example5~7.) Example5.

Matrix A is a 2x2 matrix and 2 3 4 , 3 11 15

8 11 30 41

A   A  

    Find A.

Example6.

Matrix A and B are invertible 2x2 matrices. Suppose 3 4

5 7

AB   

  . Find BA.

Example7.

Matrix A and B are invertible 2x2 matrices, such that BAB=I.

(1) Prove thatAB B1 1. Given that 2 5 1 3

B  

  

  (2) Find the matrix A such that BAB=I

製作者:國立臺灣師範大學附屬高級中學 蕭煜修

參考文獻

相關文件

To reduce the Maximum Clique into MCS, we just need to build a new complete graph G’, with |V G | vertices (each 2 vertices have edge), then take the input of Maximum Clique, G, and

The time complexity of flatten is Θ(n 2 ) (in the worst case), where n is the number of Tip nodes in the tree.... A simple observation shows that there are exactly n − 1 Bin

In order to test your program, user can give the value of n to list Padovan sequence from P(0) to P(n) and corresponding accumulated triangle area.. The area of equilateral

Finally, we use RANSAC to get the robust transform matrix to paste images together according to the feature matching pairs and we use pyramid blending to solve the problem

For each island description, the 1st line contains an integer n, indicating the number of cities on this island.. In the next n lines, the i-th line contains 2 integers x i , y i

For periodic sequence (with period n) that has exactly one of each 1 ∼ n in any group, we can find the least upper bound of the number of converged-routes... Elementary number

We would like to point out that unlike the pure potential case considered in [RW19], here, in order to guarantee the bulk decay of ˜u, we also need the boundary decay of ∇u due to

In the second part of this talk, we will show how to use the turbulence models to formulate the random effects on Maxwell’s equations caused by the thermal fluctuation and apply