Matrix Theory Background

Slides:



Advertisements
Similar presentations
10.4 Complex Vector Spaces.
Advertisements

Ch 7.7: Fundamental Matrices
6.1 Eigenvalues and Diagonalization. Definitions A is n x n. is an eigenvalue of A if AX = X has non zero solutions X (called eigenvectors) If is an eigenvalue.
OCE301 Part II: Linear Algebra lecture 4. Eigenvalue Problem Ax = y Ax = x occur frequently in engineering analysis (eigenvalue problem) Ax =  x [ A.
Refresher: Vector and Matrix Algebra Mike Kirkpatrick Department of Chemical Engineering FAMU-FSU College of Engineering.
Mathematics. Matrices and Determinants-1 Session.
8 CHAPTER Linear Algebra: Matrix Eigenvalue Problems Chapter 8 p1.
Symmetric and Skew Symmetric
Eigenvalues and Eigenvectors
Symmetric Matrices and Quadratic Forms
ENGG2013 Unit 19 The principal axes theorem
Multivariable Control Systems Ali Karimpour Assistant Professor Ferdowsi University of Mashhad.
Chapter 6 Eigenvalues.
Matrix Operations. Matrix Notation Example Equality of Matrices.
Ch 7.3: Systems of Linear Equations, Linear Independence, Eigenvalues
Chapter 3 Determinants and Matrices
Chapter 2 Matrices Definition of a matrix.
Matrix Algebra THE INVERSE OF A MATRIX © 2012 Pearson Education, Inc.
Digital Control Systems Vector-Matrix Analysis. Definitions.
Math 307 Spring, 2003 Hentzel Time: 1:10-2:00 MWF Room: 1324 Howe Hall Instructor: Irvin Roy Hentzel Office 432 Carver Phone
A matrix having a single row is called a row matrix. e.g.,
1 Operations with Matrice 2 Properties of Matrix Operations
5.1 Orthogonality.
Linear Algebra With Applications by Otto Bretscher. Page The Determinant of any diagonal nxn matrix is the product of its diagonal entries. True.
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.
CHAPTER SIX Eigenvalues
Compiled By Raj G. Tiwari
Linear Algebra: Matrix Eigenvalue Problems
1 February 24 Matrices 3.2 Matrices; Row reduction Standard form of a set of linear equations: Chapter 3 Linear Algebra Matrix of coefficients: Augmented.
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.
Presentation on Matrices and some special matrices In partial fulfillment of the subject Vector calculus and linear algebra ( ) Submitted by: Agarwal.
An m  n matrix is an rectangular array of elements with m rows and n columns: Matrices denotes the element in the ith row and jth column.
Gram-Schmidt Orthogonalization
Eigenvalues and Eigenvectors
Network Systems Lab. Korea Advanced Institute of Science and Technology No.1 Appendix A. Mathematical Background EE692 Parallel and Distribution Computation.
Page 146 Chapter 3 True False Questions. 1. The image of a 3x4 matrix is a subspace of R 4 ? False. It is a subspace of R 3.
Matrices CHAPTER 8.1 ~ 8.8. Ch _2 Contents  8.1 Matrix Algebra 8.1 Matrix Algebra  8.2 Systems of Linear Algebra Equations 8.2 Systems of Linear.
Matrices. Definitions  A matrix is an m x n array of scalars, arranged conceptually as m rows and n columns.  m is referred to as the row dimension.
Linear algebra: matrix Eigen-value Problems
Matrices Matrices For grade 1, undergraduate students For grade 1, undergraduate students Made by Department of Math.,Anqing Teachers college.
Chapter 5 Eigenvalues and Eigenvectors 大葉大學 資訊工程系 黃鈴玲 Linear Algebra.
Elementary Linear Algebra Anton & Rorres, 9 th Edition Lecture Set – 07 Chapter 7: Eigenvalues, Eigenvectors.
Positive Semidefinite matrix A is a p ositive semidefinite matrix (also called n onnegative definite matrix)
Class 24: Question 1 Which of the following set of vectors is not an orthogonal set?
Spectrum of A σ(A)=the spectrum of A =the set of all eigenvalues of A.
7.1 Eigenvalues and Eigenvectors
5.1 Eigenvalues and Eigenvectors
Matrices and Determinants
Linear Algebra Chapter 2 Matrices.
Matrices and Matrix Operations. Matrices An m×n matrix A is a rectangular array of mn real numbers arranged in m horizontal rows and n vertical columns.
Linear Algebra Chapter 6 Linear Algebra with Applications -Gareth Williams Br. Joel Baumeyer, F.S.C.
Chapter 5 Chapter Content 1. Real Vector Spaces 2. Subspaces 3. Linear Independence 4. Basis and Dimension 5. Row Space, Column Space, and Nullspace 6.
2 - 1 Chapter 2A Matrices 2A.1 Definition, and Operations of Matrices: 1 Sums and Scalar Products; 2 Matrix Multiplication 2A.2 Properties of Matrix Operations;
Boot Camp in Linear Algebra TIM 209 Prof. Ram Akella.
Linear Algebra Engineering Mathematics-I. Linear Systems in Two Unknowns Engineering Mathematics-I.
Lecture XXVI.  The material for this lecture is found in James R. Schott Matrix Analysis for Statistics (New York: John Wiley & Sons, Inc. 1997).  A.
Tutorial 6. Eigenvalues & Eigenvectors Reminder: Eigenvectors A vector x invariant up to a scaling by λ to a multiplication by matrix A is called.
Chapter 5 Eigenvalues and Eigenvectors
Linear Algebra With Applications by Otto Bretscher.
Matrices and vector spaces
Positive Semidefinite matrix
6-4 Symmetric Matrices By毛.
Derivative of scalar forms
Chapter 3 Linear Algebra
Controllability and Observability of Linear Dynamical Equations
Linear Algebra Lecture 32.
Eigenvalues and Eigenvectors
Linear Algebra: Matrix Eigenvalue Problems – Part 2
Eigenvalues and Eigenvectors
Presentation transcript:

Matrix Theory Background Chapter one Matrix Theory Background

1.Hermitian and real symmetric matrix

1.Hermitian and real symmetric matrix

adjA

Symmetric and Hermitian matrices Symmetric matrix: Hermitian matrix: :Complex symmetric matrix

Symmetric and Hermitian matrices

Hermitian matrices

Hermitian matrices Form Let H be a Hermitian matrix, then H is the following form conjugate compelx number

Skew-Symmetric and Skew- Hermitian Skew-symmetric matrix: Skew-Hermitian matrix:

Skew-symmetric matrices Form Let A be a skew-symmetric matrix, then A is the following form r

Skew-Hermitian matrices

Skew-Hermitian matrices Form Let H be a skew-Hermitian matrix, then H is the following form

Symmetric and Hermitian matrices If A is a real matrix, then For real matrice, Hermitian matrices and (real) symmetric matrices are the same.

Symmetric and Hermitian matrices Since every real Hermitian matrix is real symmetric, almost every result for Hermitian matrices has a corresponding result for real symmetric matrices.

Given Example for almost p.1 A result for Hermitian matrice: If A is a Hermitian matrix, then there is a unitary matrix U such that We must by a parallel proof obtain the following result for real symmetric matrices

Given Example for almost p.2 A result for real symmetric matrice: If A is a real symmetric matrix, then there is a real orthogonal matrix P such that

Given another Example for almost A result for complex matrice: If A is a complex matrix, such that A counterexample for real matric:

Eigenvalue of a Linear Transformation p.1 Eigenvalues of a linear transformation on a real vector space are real numbers. This is by definition.

Eigenvalue of a Linear Transformation p.2 We can extend T as following: Similarly, we can extend A as following

Fact:1.1.1 p. 1

Fact:1.1.1 p. 2

Fact:1.1.1 p. 3

Fact:1.1.1 p. 4 Corresponding real version also hold.

Fact:1.1.1 p. 5 If , in addition ,m=n, then Corresponding real version also hold.

Fact:1.1.2 p. 1 If A is Hermitian, then is Hermitian for k=1,2,…,n If A is Hermitian and A is nonsingular, then is Hermitian.

Fact:1.1.2 p. 1 Therefore, AB is Hermitian if and only if AB=BA

Theorem 1.1.4 A square matrix A is a product of two Hermitian matrices if and only if A is similar to

(*) Proof of Theorem 1.1.4 p.1 Necessity: Let A=BC, where B and C are Hermitian matrices Then and inductively for any positive integer k (*)

Note that J is nilpotent and K is invertible. Proof of Theorem 1.1.4 p.2 We may write, without loss of generality visa similarity where J and K contain Jordan blocks of eigenvalues 0 and nonzero, respectively. Note that J is nilpotent and K is invertible.

Proof of Theorem 1.1.4 p.3 Partition B and C conformally with A as Then (*) implies that for any positive integer

Proof of Theorem 1.1.4 p.4 Notice that It follows that M=0, since K is nonsingular Then A=BC is the same as

This yields K=NR, and hence N and R Proof of Theorem 1.1.4 p.5 This yields K=NR, and hence N and R are nonsigular. Taking k=1 in (*), we have

It follows that A is similar to Proof of Theorem 1.1.4 p.6 which gives or, since N is invertible, In other words, K is similar to Since J is similar to , It follows that A is similar to

a product of two Hermitian matrice Proof of Theorem 1.1.4 p.7 Sufficiency: Notice that This says that if A is similar to a product of two Hermitian matrices, then A is in fact a product of two Hermitian matrice

Theorem 3.13 says that if A is similar Proof of Theorem 1.1.4 p.8 Theorem 3.13 says that if A is similar to that , then the Jorden blocks of nonreal eigenvalues of A occur in cojugate pairs. Thus it is sufficient to show that

Where J(λ) is the Jorden block with Proof of Theorem 1.1.4 p.9 Where J(λ) is the Jorden block with λ on the diagonal, is similar to a product of two Hermitian matrices. This is seen as follows:

Proof of Theorem 1.1.4 p.10 which is equal to a product of two Hermitian matrices

=the set of all nxn Hermitian matrices =the set of all nxn skew Hermitian matrix. This means that every skew Hermitian matrix can be written in the form iA where A is Hermitian and conversely.

Given a skew Hermitian matrix B, B=i(-iB) where -iB is a Hermitian matrix.

( also ) form a real vector space under matrix addition and multiplication by real scalar with dimension.

H(A)= :Hermitian part of A S(A)= :skew-Hermitian part of A

Re(A)= :real part of A Im(A)= :image part of A