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

Slides:



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

Numerical Analysis 1 EE, NCKU Tien-Hao Chang (Darby Chang)
Chapter 4 Euclidean Vector Spaces
Chapter 28 – Part II Matrix Operations. Gaussian elimination Gaussian elimination LU factorization LU factorization Gaussian elimination with partial.
Scientific Computing QR Factorization Part 2 – Algorithm to Find Eigenvalues.
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
Numerical Analysis 1 EE, NCKU Tien-Hao Chang (Darby Chang)
Numerical Analysis 1 EE, NCKU Tien-Hao Chang (Darby Chang)
Numerical Analysis 1 EE, NCKU Tien-Hao Chang (Darby Chang)
MATH 685/ CSI 700/ OR 682 Lecture Notes
Solving Linear Systems (Numerical Recipes, Chap 2)
Lecture 13 - Eigen-analysis CVEN 302 July 1, 2002.
The QR iteration for eigenvalues. ... The intention of the algorithm is to perform a sequence of similarity transformations on a real matrix so that the.
Iterative methods TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAA A A A A A A A.
DEF: Characteristic Polynomial (of degree n) QR - Algorithm Note: 1) QR – Algorithm is different from QR-Decomposition 2) a procedure to calculate the.
Modern iterative methods For basic iterative methods, converge linearly Modern iterative methods, converge faster –Krylov subspace method Steepest descent.
Numerical Analysis 1 EE, NCKU Tien-Hao Chang (Darby Chang)
1cs542g-term Notes  In assignment 1, problem 2: smoothness = number of times differentiable.
Linear Transformations
Motion Analysis Slides are from RPI Registration Class.
Chapter 4. Numerical Interpretation of Eigenvalues In terms of matrix arithmetic eigenvalues turn matrix multiplication into scalar multiplication. Numerically.
QR-RLS Algorithm Cy Shimabukuro EE 491D
Introduction Given a Matrix of distances D, (which contains zeros in the main diagonal and is squared and symmetric), find variables which could be able,
6 1 Linear Transformations. 6 2 Hopfield Network Questions.
Finding Eigenvalues and Eigenvectors What is really important?
Digital Control Systems Vector-Matrix Analysis. Definitions.
MATH 685/ CSI 700/ OR 682 Lecture Notes Lecture 6. Eigenvalue problems.
Numerical Analysis 1 EE, NCKU Tien-Hao Chang (Darby Chang)
Dominant Eigenvalues & The Power Method
5.1 Orthogonality.
9 1 Performance Optimization. 9 2 Basic Optimization Algorithm p k - Search Direction  k - Learning Rate or.
Numerical Analysis 1 EE, NCKU Tien-Hao Chang (Darby Chang)
Orthogonal Matrices and Spectral Representation In Section 4.3 we saw that n  n matrix A was similar to a diagonal matrix if and only if it had n linearly.
Scientific Computing QR Factorization Part 1 – Orthogonal Matrices, Reflections and Rotations.
Introduction The central problems of Linear Algebra are to study the properties of matrices and to investigate the solutions of systems of linear equations.
20 August 2015 Numerical Methods ESUG, Gent 1999 Didier Besset Independent Consultant.
Point set alignment Closed-form solution of absolute orientation using unit quaternions Berthold K. P. Horn Department of Electrical Engineering, University.
Eigenvalue Problems Solving linear systems Ax = b is one part of numerical linear algebra, and involves manipulating the rows of a matrix. The second main.
8.1 Vector spaces A set of vector is said to form a linear vector space V Chapter 8 Matrices and vector spaces.
1 Iterative Solution Methods Starts with an initial approximation for the solution vector (x 0 ) At each iteration updates the x vector by using the sytem.
6 1 Linear Transformations. 6 2 Hopfield Network Questions The network output is repeatedly multiplied by the weight matrix W. What is the effect of this.
Linear Algebra (Aljabar Linier) Week 10 Universitas Multimedia Nusantara Serpong, Tangerang Dr. Ananda Kusuma
Linear algebra: matrix Eigen-value Problems
Orthogonalization via Deflation By Achiya Dax Hydrological Service Jerusalem, Israel
Linear algebra: matrix Eigen-value Problems Eng. Hassan S. Migdadi Part 1.
Chapter 5 MATRIX ALGEBRA: DETEMINANT, REVERSE, EIGENVALUES.
Scientific Computing Singular Value Decomposition SVD.
A Note on Rectangular Quotients By Achiya Dax Hydrological Service Jerusalem, Israel
Numerical Analysis – Eigenvalue and Eigenvector Hanyang University Jong-Il Park.
Direct Methods for Sparse Linear Systems Lecture 4 Alessandra Nardi Thanks to Prof. Jacob White, Suvranu De, Deepak Ramaswamy, Michal Rewienski, and Karen.
1. Systems of Linear Equations and Matrices (8 Lectures) 1.1 Introduction to Systems of Linear Equations 1.2 Gaussian Elimination 1.3 Matrices and Matrix.
Similar diagonalization of real symmetric matrix
1 Instituto Tecnológico de Aeronáutica Prof. Maurício Vicente Donadon AE-256 NUMERICAL METHODS IN APPLIED STRUCTURAL MECHANICS Lecture notes: Prof. Maurício.
MA5233 Lecture 6 Krylov Subspaces and Conjugate Gradients Wayne M. Lawton Department of Mathematics National University of Singapore 2 Science Drive 2.
Matrices CHAPTER 8.9 ~ Ch _2 Contents  8.9 Power of Matrices 8.9 Power of Matrices  8.10 Orthogonal Matrices 8.10 Orthogonal Matrices 
Computational Physics (Lecture 7) PHY4061. Eigen Value Problems.
ALGEBRAIC EIGEN VALUE PROBLEMS
Review of Linear Algebra
Matrices and vector spaces
Complex Eigenvalues Prepared by Vince Zaccone
Numerical Analysis Lecture14.
Numerical Analysis Lecture 17.
Lecture 13: Singular Value Decomposition (SVD)
Linear Algebra Lecture 29.
Relative Perturbations for s.d.d. Matrices with applications
Performance Optimization
Diagonalization Prepared by Vince Zaccone
Numerical Analysis Lecture11.
Eigenvalues and Eigenvectors
Pivoting, Perturbation Analysis, Scaling and Equilibration
Presentation transcript:

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

In the previous slide Eigenvalues and eigenvectors The power method –locate the dominant eigenvalue Inverse power method Deflation 2

In this slide Find all eigenvalues of a symmetric matrix –reducing a symmetric matrix to tridiagonal form –eigenvalues of symmetric tridiagonal matrices (QR algorithm) 3

Obtain all eigenvalues To compute all of the eigenvalues of a symmetric matrix, we will proceed in two stages –transform to symmetric tridiagonal form this step requires a fixed, finite number of operations (not iterative) –an iterative procedure on the symmetric tridiagonal matrix that generates a sequence of matrices converged to a diagonal matrix 4

Who two stages? Why not apply the iterative technique directly on the original matrix? –transforming an n × n symmetric matrix to symmetric tridiagonal form requires on the order of 4/3n 3 arithmetic operations –the iterative reduction of the symmetric tridiagonal matrix to diagonal form then requires O(n 2 ) arithmetic operations –on the other hand, applying the iterative technique directly to the original matrix requires on the order of 4/3n 3 arithmetic operations per iteration 5

4.4 Reduction to Symmetric Tridiagonal Form 6

Before going into 4.4 Similarity transformations Orthogonal matrices 7

8 Similarity transformation

9 Recall that

Orthogonal matrix Similarity transformation with an orthogonal matrix maintains symmetry – A is symmetric and B=Q -1 AQ – B T =(Q -1 AQ) T =(Q T AQ) T =Q T AQ=B, that is, B is also symmetric Multiplication by an orthogonal matrix does not change the Euclidean norm – (Qx) T Qx=x T Q T Qx=x T Q -1 Qx=x T x 10

Householder matrix 11

12

In practice 13

n-2 similarity transformations 14

15

Generating appropriate Householder matrices 16

17

18 later

Any Questions? 19 About generating Householder matrices

20 Is there any possible cancellation errors?

21 In action

22

23

24

Any Questions? Reduction to Symmetric Tridiagonal Form

4.5 Eigenvalues of Symmetric Tridiagonal Matrices 26

27

28 The off-diagonal elements  zero while the diagonal elements  the eigenvalues (in decreasing order)

QR Factorization The heart of the QR algorithm 29

Rotation matrix 30

QR factorization 31

32

33

34

35

36 In action

37

38

The Product R (i) Q (i) 39

40 Recall that

41

42

The algorithm for R (i) Q (i) 43

44 In action

45

Any Questions? 46 Eigenvalues and Eigenvectors

Exercise /5/26 9:00am to or hand over in class. You may arbitrarily pick one problem among the first three, which means this exercise contains only five

48

49

50

Write a program to obtain R given a symmetric tridiagonal matrix A 51

52