L16: Diagonalization - PowerPoint PPT Presentation

1 / 13
About This Presentation
Title:

L16: Diagonalization

Description:

Ordinal implication -upper contour sets are convex. Larger class: quasiconcave functions ... f:R R given by f(x)=Ax is. f (x) = exists. Matrix is singular if is ... – PowerPoint PPT presentation

Number of Views:318
Avg rating:3.0/5.0
Slides: 14
Provided by: marekw
Category:

less

Transcript and Presenter's Notes

Title: L16: Diagonalization


1
L16 Diagonalization
  • Required reading
  • Lecture and lecture notes,
  • Simon and Blume (23)
  • Contents
  • Basic facts about matrices
  • Diagonalization (symmetric matrices)
  • Definiteness of a matrix and eigenvalues

2
Concavity and quasiconvexity
  • f concave if
  • Example fR R, fR R
  • Concavity - cardinal property
  • Upper contour set, C
  • Ordinal implication -upper contour sets are
    convex
  • Larger class quasiconcave functions
  • D fX R quasiconcave if upper contour sets are
    convex
  • Examples fR R fR R
  • Quasiconcave but not concave?

3
(Non)-singular matrix
  • Square N N matrix A is nonsigular if
  • Diagonal examples
  • Alternative characterizations
  • All vectors of A are linearly independent,
    rank(A) N
  • fR R given by f(x)Ax is
  • f (x) exists
  • Matrix is singular if is not nonsingular

4
Test for nonsingularity determinant, software
  • Determinant det(A)A a number assigned to A
  • Key property A0 iff A is singular
  • How to find A
  • 2 2 matrix
  • 3 3 matrix
  • Higher dimensions in practice use software

5
Orthogonal Matrix P
  • Dot product of x,y R.
  • Length of x Euclidian norm
  • Angle between x,y? x y
  • Acute
  • Obtuse
  • Right
  • D N N orthogonal matrix P P PI
    (Why?)
  • QIs orthogonal matrix nonsingular?
  • QWhat can you say about P

6
Diagonalization
  • Why do we like diagonal matrices? A
  • Definiteness of matrix
  • Shape of quadratic form
  • Nonsingularity of A, inverse of A
  • Linear dynamic systems
  • Diagonal matrices result in uncoupled behavior
  • Idea for symmetric matrices one can always
    change coordinates in a way that new variables
    are uncoupled
  • New coordinates eigenvectors
  • Entries in diagonalized matrix eigenvalues
  • Q How to find them and how to use them

7
Diagonalization Idea
  • Consider diagonal matrix A
  • Why this is useful?
  • For any symmetric matrix A there exist
  • N orthogonal eigenvectors
  • N corresponding eigenvalues st

8
Main theorem
  • Theorem Let A be symmetric. There exists N N
    orthogonal
  • matrix P and diagonal matrix
    st
  • How can we find P and ?
  • When aplied to axis v matrix A works as scalar
  • Condition for eigenvalues?
  • Condition for eigenvectors?

9
Example
  • A
  • PS8 you will be asked to find eigenvalues of 3 3
  • More generally, use sofware

10
Definiteness of matrix and eigenvalues
  • Theorem Let A be symmetric.
  • (1) A is positive definite iff
  • (2) A is positive semidefinite iff
  • (3) A is indefinite iff

11
Shape of a quadratic form
  • A

12
Definiteness of matrix and eigenvalues
  • Theorem Let A be symmetric. A is invertible
    iff
  • Remarks
  • For non-symmetric matrices, the eigenvalues might
    be complex numbers and eigenvectors might not be
    orhogonal!

13
Write a Comment
User Comments (0)
About PowerShow.com