UMB 551I Linear Algebra

UMB 551I Linear Algebra

Inverse of a matrix Algorithm Adjugate matrices Solving Linear Systems Matrix equations UMB 551I Linear algebra Lenka Zalabova´ We follow the Czech version (UMB 551 Linea´rnı´algebra) by Jan Eisner available on fix.prf.jcu.cz/ e eisner/lock/UMB-551/ 25. listopadu 2014 Inverse of a matrix Algorithm Adjugate matrices Solving Linear Systems Matrix equations Obsah 1 Inverse of a matrix 2 Algorithm 3 Adjugate matrices 4 Solving Linear Systems 5 Matrix equations Inverse of a matrix Algorithm Adjugate matrices Solving Linear Systems Matrix equations Motivation: −1 1 In R, each non–zero real number a has its inverse a = a for the multiplication such that a−1 · a = 1. Consider square matrices of a fixed order. Then we can multiply these matrices as well, and the role of 1 has the identity matrix, i.e. EA = AE = A: There is a natural question, whether there is also some ‘inverse’ for multiplication of matrices. In other words, for a matrix A, is there a matrix A−1 such that A−1A = E? Inverse of a matrix Algorithm Adjugate matrices Solving Linear Systems Matrix equations Definition Let A be a square matrix of order n. Then the matrix A−1 satisfying A−1A = E and AA−1 = E is called an inverse of the matrix A. Clearly, A−1 is a square matrix of order n. Inverse of a matrix does not have to exist. If there is an inverse A−1 of a matrix A, then A is called invertible. Let A, B be regular square matrices of order n. −1 A−1 = A; −1 1 jA j = jAj ; T −1 A−1 = AT ; (A · B)−1 = B−1 · A−1: Inverse of a matrix Algorithm Adjugate matrices Solving Linear Systems Matrix equations Theorem Let A be a square matrix of order n. Then there exists inverse A−1 of the matrix A if and only if A is regular (i.e. if and only is jAj= 6 0 which occurs if and only if r(A) = n). Inverse of a matrix Algorithm Adjugate matrices Solving Linear Systems Matrix equations Theorem Let A be a square matrix of order n. Then there exists inverse A−1 of the matrix A if and only if A is regular (i.e. if and only is jAj= 6 0 which occurs if and only if r(A) = n). Let A, B be regular square matrices of order n. −1 A−1 = A; −1 1 jA j = jAj ; T −1 A−1 = AT ; (A · B)−1 = B−1 · A−1: We have (AjE) ∼ · · · ∼ EjA−1 : Clearly, if we get a zero row (in the left matrix) during the computation, then the inverse matrix does not exists. Inverse of a matrix Algorithm Adjugate matrices Solving Linear Systems Matrix equations Algorithm for finding the inverse of a matrix: Write the matrix A and the identity matrix E next to each other. Thus we get a matrix (AjE) of type n × 2n. Find the row echelon form of the matrix (AjE) using elementary row transformations. Use the ‘backwards’ elimination (i.e. elimination from the bottom and right) to transform the left matrix into the identity matrix. Then the right matrix is the inverse A−1. Inverse of a matrix Algorithm Adjugate matrices Solving Linear Systems Matrix equations Algorithm for finding the inverse of a matrix: Write the matrix A and the identity matrix E next to each other. Thus we get a matrix (AjE) of type n × 2n. Find the row echelon form of the matrix (AjE) using elementary row transformations. Use the ‘backwards’ elimination (i.e. elimination from the bottom and right) to transform the left matrix into the identity matrix. Then the right matrix is the inverse A−1. We have (AjE) ∼ · · · ∼ EjA−1 : Clearly, if we get a zero row (in the left matrix) during the computation, then the inverse matrix does not exists. Firstly, we find the row echelon form: 0 1 1 1 1 0 0 1 @ 2 3 −1 0 1 0 A ∼ 1 −1 6 0 0 1 0 1 1 1 1 0 0 1 @ 0 1 −3 −2 1 0 A ∼ 0 −2 5 −1 0 1 0 1 1 1 1 0 0 1 @ 0 1 −3 −2 1 0 A : 0 0 −1 −5 2 1 Inverse of a matrix Algorithm Adjugate matrices Solving Linear Systems Matrix equations Example 0 1 1 1 1 Find the inverse to the matrix A = @ 2 3 −1 A. 1 −1 6 Inverse of a matrix Algorithm Adjugate matrices Solving Linear Systems Matrix equations Example 0 1 1 1 1 Find the inverse to the matrix A = @ 2 3 −1 A. 1 −1 6 Firstly, we find the row echelon form: 0 1 1 1 1 0 0 1 @ 2 3 −1 0 1 0 A ∼ 1 −1 6 0 0 1 0 1 1 1 1 0 0 1 @ 0 1 −3 −2 1 0 A ∼ 0 −2 5 −1 0 1 0 1 1 1 1 0 0 1 @ 0 1 −3 −2 1 0 A : 0 0 −1 −5 2 1 Inverse of a matrix Algorithm Adjugate matrices Solving Linear Systems Matrix equations Example Now, we find the diagonal form of the left matrix: 0 1 1 1 1 0 0 1 @ 0 1 −3 −2 1 0 A ∼ 0 0 −1 −5 2 1 0 1 1 0 −4 2 1 1 @ 0 1 0 13 −5 −3 A ∼ 0 0 −1 −5 2 1 0 1 0 0 −17 7 4 1 @ 0 1 0 13 −5 −3 A ∼ 0 0 −1 −5 2 1 0 1 0 0 −17 7 4 1 @ 0 1 0 13 −5 −3 A. 0 0 1 5 −2 −1 We compute A · A−1 = 0 1 1 1 1 0 −17 7 4 1 0 1 0 0 1 @ 2 3 −1 A @ 13 −5 −3 A = @ 0 1 0 A. 1 −1 6 5 −2 −1 0 0 1 Inverse of a matrix Algorithm Adjugate matrices Solving Linear Systems Matrix equations Example We get 0 −17 7 4 1 −1 A = @ 13 −5 −3 A : 5 −2 −1 Is the result correct? Inverse of a matrix Algorithm Adjugate matrices Solving Linear Systems Matrix equations Example We get 0 −17 7 4 1 −1 A = @ 13 −5 −3 A : 5 −2 −1 Is the result correct? We compute A · A−1 = 0 1 1 1 1 0 −17 7 4 1 0 1 0 0 1 @ 2 3 −1 A @ 13 −5 −3 A = @ 0 1 0 A. 1 −1 6 5 −2 −1 0 0 1 Theorem Let A be a regular matrix. Then 1 A−1 = · A∗: jAj Inverse of a matrix Algorithm Adjugate matrices Solving Linear Systems Matrix equations Definition An adjugate matrix of the square matrix A (of order n) is the matrix 0 1 A11 A21 ::: An1 B A12 A22 ::: An2 C A∗ = B C ; B . C @ . A A1n A2n ::: Ann i.e. the transpose of the matrix of algebraic complements. Inverse of a matrix Algorithm Adjugate matrices Solving Linear Systems Matrix equations Definition An adjugate matrix of the square matrix A (of order n) is the matrix 0 1 A11 A21 ::: An1 B A12 A22 ::: An2 C A∗ = B C ; B . C @ . A A1n A2n ::: Ann i.e. the transpose of the matrix of algebraic complements. Theorem Let A be a regular matrix. Then 1 A−1 = · A∗: jAj We have 0 1 0 0 1 0 1 1 − B 1 1 1 1 1 0 C B C ∗ B 2 0 1 1 1 1 C A = B − − C : B 1 1 1 1 2 0 C B C @ 2 1 1 0 1 0 A − 1 1 1 1 2 1 Inverse of a matrix Algorithm Adjugate matrices Solving Linear Systems Matrix equations Example Using the adjugate matrix, find A−1 for 0 1 0 1 1 A = @ 2 1 0 A : 1 1 1 Inverse of a matrix Algorithm Adjugate matrices Solving Linear Systems Matrix equations Example Using the adjugate matrix, find A−1 for 0 1 0 1 1 A = @ 2 1 0 A : 1 1 1 We have 0 1 0 0 1 0 1 1 − B 1 1 1 1 1 0 C B C ∗ B 2 0 1 1 1 1 C A = B − − C : B 1 1 1 1 2 0 C B C @ 2 1 1 0 1 0 A − 1 1 1 1 2 1 Inverse of a matrix Algorithm Adjugate matrices Solving Linear Systems Matrix equations Example Then we have 0 1 1 −1 1 = @ −2 0 2 A 1 −1 1 and we compute jAj = 1 + 2 + 0 − 1 − 0 − 0 = 2: All together, 0 1 1 −1 1 −1 1 A = @ −2 0 2 A : 2 1 −1 1 Inverse of a matrix Algorithm Adjugate matrices Solving Linear Systems Matrix equations Consider the system Ax = b, where A is square matrix of order 0 1 0 1 x1 b1 B . C B . C n and x = @ . A, b = @ . A. xn bn If A is regular, then the system has exactly one solution, and we can find it as follows: Multiply the equality Ax = b by the matrix A−1 from the left. We get A−1Ax = A−1b and we know A−1A = E Thus the solution is x = A−1b. 0 1 1 1 1 0 2 1 We have A = @ 2 3 −1 A, b = @ −3 A and we know 1 −1 6 14 0 −17 7 4 1 from above that A−1 = @ 13 −5 −3 A.

View Full Text

Details

  • File Type
    pdf
  • Upload Time
    -
  • Content Languages
    English
  • Upload User
    Anonymous/Not logged-in
  • File Pages
    30 Page
  • File Size
    -

Download

Channel Download Status
Express Download Enable

Copyright

We respect the copyrights and intellectual property rights of all users. All uploaded documents are either original works of the uploader or authorized works of the rightful owners.

  • Not to be reproduced or distributed without explicit permission.
  • Not used for commercial purposes outside of approved use cases.
  • Not used to infringe on the rights of the original creators.
  • If you believe any content infringes your copyright, please contact us immediately.

Support

For help with questions, suggestions, or problems, please contact us