Corollary If A is diagonalizable and rank A=r,

Slides:



Advertisements
Similar presentations
10.4 Complex Vector Spaces.
Advertisements

Ch 7.7: Fundamental Matrices
Scientific Computing QR Factorization Part 2 – Algorithm to Find Eigenvalues.
8.4. Unitary Operators. Inner product preserving V, W inner product spaces over F in R or C. T:V -> W. T preserves inner products if (Ta|Tb) = (a|b) for.
OCE301 Part II: Linear Algebra lecture 4. Eigenvalue Problem Ax = y Ax = x occur frequently in engineering analysis (eigenvalue problem) Ax =  x [ A.
Lecture 19 Singular Value Decomposition
Symmetric Matrices and Quadratic Forms
Computer Graphics Recitation 5.
राघव वर्मा Hermitian Operators To every Hermitian operator , there exists (ATLEAST) one basis consisting of orthogonal eigenvectors, It is diagonal in.
Chapter 6 Eigenvalues.
3.V.1. Changing Representations of Vectors 3.V.2. Changing Map Representations 3.V. Change of Basis.
Chapter 3 Determinants and Matrices
Chapter 2 Matrices Definition of a matrix.
Lecture 20 SVD and Its Applications Shang-Hua Teng.
Lecture 18 Eigenvalue Problems II Shang-Hua Teng.
Dirac Notation and Spectral decomposition
Matrices CS485/685 Computer Vision Dr. George Bebis.
A matrix having a single row is called a row matrix. e.g.,
5.1 Orthogonality.
Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka Virginia de Sa (UCSD) Cogsci 108F Linear.
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.
Section 6.6 Orthogonal Matrices.
CHAPTER SIX Eigenvalues
Linear Algebra Review 1 CS479/679 Pattern Recognition Dr. George Bebis.
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.
8.1 Vector spaces A set of vector is said to form a linear vector space V Chapter 8 Matrices and vector spaces.
Gram-Schmidt Orthogonalization
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.
Linear algebra: matrix Eigen-value Problems
Three different ways There are three different ways to show that ρ(A) is a simple eigenvalue of an irreducible nonnegative matrix A:
Chapter 5 Eigenvalues and Eigenvectors 大葉大學 資訊工程系 黃鈴玲 Linear Algebra.
Class 27: Question 1 TRUE or FALSE: If P is a projection matrix of the form P=A(A T A) -1 A T then P is a symmetric matrix. 1. TRUE 2. FALSE.
Chapter 2 Nonnegative Matrices. 2-1 Introduction.
Elementary Linear Algebra Anton & Rorres, 9 th Edition Lecture Set – 07 Chapter 7: Eigenvalues, Eigenvectors.
CSCI 171 Presentation 9 Matrix Theory. Matrix – Rectangular array –i th row, j th column, i,j element –Square matrix, diagonal –Diagonal matrix –Equality.
Positive Semidefinite matrix A is a p ositive semidefinite matrix (also called n onnegative definite matrix)
Chapter 2 … part1 Matrices Linear Algebra S 1. Ch2_2 2.1 Addition, Scalar Multiplication, and Multiplication of Matrices Definition A matrix is a rectangular.
Spectrum of A σ(A)=the spectrum of A =the set of all eigenvalues of A.
2.2 The Inverse of a Matrix. Example: REVIEW Invertible (Nonsingular)
Similar diagonalization of real symmetric matrix
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.
Instructor: Mircea Nicolescu Lecture 8 CS 485 / 685 Computer Vision.
Linear Algebra Chapter 6 Linear Algebra with Applications -Gareth Williams Br. Joel Baumeyer, F.S.C.
1 Chapter 8 – Symmetric Matrices and Quadratic Forms Outline 8.1 Symmetric Matrices 8.2Quardratic Forms 8.3Singular ValuesSymmetric MatricesQuardratic.
Boot Camp in Linear Algebra TIM 209 Prof. Ram Akella.
1 Objective To provide background material in support of topics in Digital Image Processing that are based on matrices and/or vectors. Review Matrices.
Tutorial 6. Eigenvalues & Eigenvectors Reminder: Eigenvectors A vector x invariant up to a scaling by λ to a multiplication by matrix A is called.
1.5 Variation characterization of Eigenvalues of Hermitian Matrices.
Orthogonal Matrices & Symmetric Matrices
CS479/679 Pattern Recognition Dr. George Bebis
Elementary Linear Algebra Anton & Rorres, 9th Edition
Matrices and vector spaces
Eigenvalues and Eigenvectors
Elementary Linear Algebra
Combinatorial Spectral Theory of Nonnegative Matrices
Positive Semidefinite matrix
Euclidean Inner Product on Rn
GROUPS & THEIR REPRESENTATIONS: a card shuffling approach
CS485/685 Computer Vision Dr. George Bebis
6-4 Symmetric Matrices By毛.
Chapter 3 Linear Algebra
Determinant of a Matrix
Symmetric Matrices and Quadratic Forms
Maths for Signals and Systems Linear Algebra in Engineering Lecture 18, Friday 18th November 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL.
3.IV. Change of Basis 3.IV.1. Changing Representations of Vectors
Subject :- Applied Mathematics
Linear Algebra: Matrix Eigenvalue Problems – Part 2
Lecture 20 SVD and Its Applications
Symmetric Matrices and Quadratic Forms
Inverse Matrices From: D.A. Harville, Matrix Algebra from a Statistician’s Perspective, Springer. Chapter 8.
Presentation transcript:

Corollary 1.2.9 If A is diagonalizable and rank A=r, then A has at least one rxr nonsingular principal submatrix.

permutation matrix

Proof

Proof

Proof

Fact 1.2.10 p.1 If A is mxn matrix and r is the size of the largest nonsingular submatrix.Then rank A=r If B is a rxr nonsingular submatrix, then there are permutation matrices

Fact 1.2.10 p.2 P,Q such that (iii) If , in addition, m=n and B is principal then may choose

Proof of Fact 1.2.10 p.1

Proof of Fact 1.2.10 p.2 kth row

Proof of Fact 1.2.10 p.3

Proof of Fact 1.2.10 p.4

Proof of Fact 1.2.10 p.5

Theorem 1.2.13 If m=n ,and at least one of A or B is nonsigular,then AB and BA are similar

Proof of Theorem 1.2.13 p.1

Proof of Theorem 1.2.13 p.2

Corollary 1.4.3 If A is a real symmetric matrix of rank r then there is a permutation P and rxr nonsingular principal submatrix M s.t

Proof of Corollary 1.4.3 p.1

Proof of Corollary 1.4.3 p.2

Usual Inner Product of

Unitary U is said to be unitary if exists and equals i.e

Fact is unitary if and only if the columns of U form an orthonormal basis of proof: (see next page)

Real Orthogonal is real orthogonal if i.e A real orthogonal matrix is a real matrix which is unitary

Fact is real orthogonormal if and only if the columns of U form an orthonormal basis of proof: (see next page)

Fact A is unitarily diagonalized has a orthonormal basis consisting of eigenvectors of A proof: (in next page)

Fact A is diagonalizable has a basis consisting of eigenvectors of A proof: (in next page)

Theorem 1.4.1(The spectral Thm for Hermitian matrices) p.1 ?(未證)

Theorem 1.4.1(The spectral Thm for Hermitian matrices) p.2 If A is real sysmmetric, then U can be chosen to be real orthogonal matrix