# Numerical Analysis 1 EE, NCKU Tien-Hao Chang (Darby Chang)

## Presentation on theme: "Numerical Analysis 1 EE, NCKU Tien-Hao Chang (Darby Chang)"— Presentation transcript:

Numerical Analysis 1 EE, NCKU Tien-Hao Chang (Darby Chang)

In the previous slide Special matrices –strictly diagonally dominant matrix –symmetric positive definite matrix Cholesky decomposition –tridiagonal matrix Iterative techniques –Jacobi, Gauss-Seidel and SOR methods –conjugate gradient method Nonlinear systems of equations (Exercise 3) 2

In this slide Eigenvalues and eigenvectors The power method –locate the dominant eigenvalue Inverse power method Deflation 3

Chapter 4 4 Eigenvalues and eigenvectors

5

In Chapter 4 Determine the dominant eigenvalue Determine a specific eigenvalue Remove a eigenvalue Determine all eigenvalues 6

4.1 7 The power method

Different problems have different requirements –a single, several or all of the eigenvalues –the corresponding eigenvectors may or may not also be required To handle each of these situations efficiently, different strategies are required The power method –an iterative technique –locate the dominant eigenvalue –also computes an associated eigenvector –can be extended to compute eigenvalues 8

The power method Basics 9

10

11

The power method Approximated eigenvalue 12

Any Questions? 13

The power method A common practice 14 question

The power method A common practice 15

16

The power method Complete procedure 17

Any Questions? 18

19 In action http://thomashawk.com/hello/209/1017/1024/Jackson%20Running.jpg

20 what is the first estimate?

21

22

23

Any Questions? 24 The power method for generic matrices

25 The power method for symmetric matrices

26

The power method variation 27

28

The power method Approximated eigenvalue 29 http://www.dianadepasquale.com/ThinkingMonkey.jpg Recall that

Any Questions? 30 The power method for symmetric matrices

Why to 31 Require the matrix to be symmetric?

Any Questions? 32 4.1 The power method

33 An application of eigenvalue

34

35

Undirected graph Relation to eigenvalue Proper coloring –how to color the geographic regions on a map regions that share a common border receive different colors Chromatic number –the minimum number of colors that can be used in a proper coloring of a graph 36

Undirected graph The dominant eigenvalue 37

Undirected graph The corresponding eigenvector 38

Any Questions? 39

4.2 40 The inverse power method

41 later

42

43

44

The inverse power method 45

46

Any Questions? 47

How to 48 Find the eigenvalue smallest in magnitude

Any Questions? 49 4.2 The inverse power method

4.3 50 Deflation

So far, we can approximate –the dominant eigenvalue of a matrix –the one smallest in magnitude –the one closest to a specific value What if we need several of the largest/smallest eigenvalues? Deflation –to remove an already determined solution, while leaving the remainder solutions unchanged 51

52

53

Deflation Shift an eigenvalue to zero 55

56 While leaving the remaining eigenvalues unchanged

57

58

Deflation Summary 59

Any Questions? 60

Do we 61 Miss something?

63

Wielandt deflation 64

65

Wielandt deflation Bonus 66

67 In action http://thomashawk.com/hello/209/1017/1024/Jackson%20Running.jpg

68

69

Hotelling deflation 70

71

Any Questions? 72 4.3 Deflation

Similar presentations