This preview shows pages 1–9. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Lecture 17 Introduction to Eigenvalue Problems ShangHua Teng Eigenvalue Problems Eigenvalue problems occur in many areas of science and engineering E.g., Structure analysis It is important for analyzing numerical and linear algebra algorithms Impact of roundoff errors and precision requirement It is widely used in information management and websearch It is the key ingredient for the analysis of Markov process, sampling algorithms, and various approximation algorithms in computer science Eigenvalues and Eigenvectors Standard Eigenvalue Problem: Given an n by n matrix A, find a scalar and nonzero vector x such that A x = x 2200 is eigenvalue, and x is corresponding eigenvector Spectrum of Matrices Spectrum(A) = (A) = set of all eigenvalues of A Spectral radius (A) = (A) = max { : in (A)} Spectral analysis Spectral methods Geometric Interpretation Matrix expands or shrinks any vector lying in direction of eigenvector by scalar factor Expansion of contraction factor given by corresponding eigenvalue Eigenvalues and eigenvectors decompose complicated behavior of general linear transformation into simpler actions Examples: Eigenvalues and Eigenvectors = = = = = 1 , 2 , 1 , 1 2 1 2 2 1 1 x x A Note: x 1 and x 2 are perpendicular to each other Examples: Eigenvalues and Eigenvectors = = = = = 1 1 , 2 , 1 , 1 2 1 1 2 2 1 1 x x A Note: x 1 and x 2 are not perpendicular to each other Examples: Eigenvalues and Eigenvectors  = =...
View Full
Document
 Spring '09
 BERA
 Algorithms

Click to edit the document details