Outline Numerical Stability Singular Value Decomposition

Slides:



Advertisements
Similar presentations
3D Geometry for Computer Graphics
Advertisements

Generalised Inverses Modal Analysis and Modal Testing S. Ziaei Rad.
Extremum Properties of Orthogonal Quotients Matrices By Achiya Dax Hydrological Service, Jerusalem, Israel
Lecture 19 Singular Value Decomposition
1cs542g-term High Dimensional Data  So far we’ve considered scalar data values f i (or interpolated/approximated each component of vector values.
Computer Graphics Recitation 5.
Some useful linear algebra. Linearly independent vectors span(V): span of vector space V is all linear combinations of vectors v i, i.e.
Multivariable Control Systems Ali Karimpour Assistant Professor Ferdowsi University of Mashhad.
Math for CSLecture 41 Linear Least Squares Problem Over-determined systems Minimization problem: Least squares norm Normal Equations Singular Value Decomposition.
Singular Value Decomposition (SVD) (see Appendix A.6, Trucco & Verri) CS485/685 Computer Vision Prof. George Bebis.
Chapter 3 Determinants and Matrices
Singular Value Decomposition
The Terms that You Have to Know! Basis, Linear independent, Orthogonal Column space, Row space, Rank Linear combination Linear transformation Inner product.
Chapter 2 Matrices Definition of a matrix.
ECIV 520 Structural Analysis II Review of Matrix Algebra.
Math for CSTutorial 41 Contents: 1.Least squares solution for overcomplete linear systems. 2.… via normal equations 3.… via A = QR factorization 4.… via.
Lecture 20 SVD and Its Applications Shang-Hua Teng.
Boot Camp in Linear Algebra Joel Barajas Karla L Caballero University of California Silicon Valley Center October 8th, 2008.
1cs542g-term Notes  Extra class next week (Oct 12, not this Friday)  To submit your assignment: me the URL of a page containing (links to)
Matrices CS485/685 Computer Vision Dr. George Bebis.
Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka Virginia de Sa (UCSD) Cogsci 108F Linear.
Introduction The central problems of Linear Algebra are to study the properties of matrices and to investigate the solutions of systems of linear equations.
Section 6.6 Orthogonal Matrices.
Linear Algebra Review 1 CS479/679 Pattern Recognition Dr. George Bebis.
6.837 Linear Algebra Review Patrick Nichols Thursday, September 18, 2003.
8.1 Vector spaces A set of vector is said to form a linear vector space V Chapter 8 Matrices and vector spaces.
Overview Definitions Basic matrix operations (+, -, x) Determinants and inverses.
Chapter 9 Matrices and Determinants Copyright © 2014, 2010, 2007 Pearson Education, Inc Multiplicative Inverses of Matrices and Matrix Equations.
SVD: Singular Value Decomposition
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
تهیه کننده : نرگس مرعشی استاد راهنما : جناب آقای دکتر جمشید شنبه زاده.
CPSC 491 Xin Liu November 19, Norm Norm is a generalization of Euclidean length in vector space Definition 2.
Elementary Linear Algebra Anton & Rorres, 9th Edition
Linear algebra: matrix Eigen-value Problems Eng. Hassan S. Migdadi Part 1.
Scientific Computing Singular Value Decomposition SVD.
CPSC 491 Xin Liu November 22, A change of Bases A mxn =UΣV T, U mxm, V nxn are unitary matrixes Σ mxn is a diagonal matrix Columns of a unitary.
Review of Linear Algebra Optimization 1/16/08 Recitation Joseph Bradley.
EIGENSYSTEMS, SVD, PCA Big Data Seminar, Dedi Gadot, December 14 th, 2014.
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.
Advanced Computer Graphics Spring 2014 K. H. Ko School of Mechatronics Gwangju Institute of Science and Technology.
Instructor: Mircea Nicolescu Lecture 8 CS 485 / 685 Computer Vision.
2.5 – Determinants and Multiplicative Inverses of Matrices.
Singular Value Decomposition and Numerical Rank. The SVD was established for real square matrices in the 1870’s by Beltrami & Jordan for complex square.
Chapter 61 Chapter 7 Review of Matrix Methods Including: Eigen Vectors, Eigen Values, Principle Components, Singular Value Decomposition.
Boot Camp in Linear Algebra TIM 209 Prof. Ram Akella.
Chapter 12: Data Analysis by linear least squares Overview: Formulate problem as an over-determined linear system of equations Solve the linear system.
Linear Algebra With Applications by Otto Bretscher.
College Algebra Chapter 6 Matrices and Determinants and Applications
Introduction The central problems of Linear Algebra are to study the properties of matrices and to investigate the solutions of systems of linear equations.
Introduction The central problems of Linear Algebra are to study the properties of matrices and to investigate the solutions of systems of linear equations.
Review of Linear Algebra
CS479/679 Pattern Recognition Dr. George Bebis
Review of Matrix Operations
Matrices and vector spaces
Singular Value Decomposition
Some useful linear algebra
SVD: Physical Interpretation and Applications
CS485/685 Computer Vision Dr. George Bebis
Derivative of scalar forms
Chapter 3 Linear Algebra
Outline Singular Value Decomposition Example of PCA: Eigenfaces.
Maths for Signals and Systems Linear Algebra in Engineering Lectures 13 – 14, Tuesday 8th November 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR)
Lecture 13: Singular Value Decomposition (SVD)
Linear Algebra A gentle introduction
Subject :- Applied Mathematics
Matrices - Operations INVERSE OF A MATRIX
Lecture 20 SVD and Its Applications
Outline Subspace projection,continued.
Outline Properties on the Matrix Inverse Matrix Inverse Lemma
Presentation transcript:

Outline Numerical Stability Singular Value Decomposition Properties on the SVD

Numerical Stability, Condition Number Smaller Perturbation of Coefficients May Cause Significant Solution Variation Original Function Ax = b Perturbation of A and b Perturbation of Vector b b  b + ∆b, thus solution x  x + ∆x A(x + ∆x) = b + ∆b, ∆x = A-1∆b Upper bound: ||∆x||2 ≤ ||A-1||2 ||∆b||2

Numerical Stability, Condition Number Perturbation of Matrix A A  A+∆A, thus solution x  x+∆x (A+∆A)(x+∆x) = b, Ax = b and thus ||∆x||2 ≤ ||A-1||2||∆A||2||x + ∆x||2 ||∆x||2/||x + ∆x||2 ≤ ||A||2||A-1||2(||∆A||2/||A||2) Condition Number: ||A||2||A-1||2 Critically Depends on the Norm ||A-1||2

Numerical Stability, Condition Number Condition Number of a 2*2 Matrix Proportional to det(A-1) A-1 = adj(A) * det(A-1) Question: Numerical Stability Could Be Improved via Least Square Method? Condition Number for the LS solution cond(AHA) could be very large

Singular Value Decomposition Further Characterize ||A||2||A-1||2 A = UΣVH, U and V unitary matrices, Σ diagonal matrix with non-negative elements Equivalent form for the SVD A = UΣVH  AV = UΣ A = UΣVH  UHA = ΣVH Eigenvalue decomposition for AAH AAH = UΣΣHUH = UΣ2UH

SVD Properties A = UΣVH, U and V unitary matrices, m*n matrix A, rank(A)=r the first r rows/columns of Σ are not zero First r columns of U, ortho-normal basis for the column space of A First r rows of V, ortho-normal basis for the row space of A Last m-r columns of V, ortho-normal basis for the zero column space of A Last n-r columns of U, ortho-normal basis for the zero row space of A

SVD Properties First r columns of U, ortho-normal basis for the column space of A First r rows of VH, ortho-normal basis for the row space of A Last m-r columns of U, ortho-normal basis for the zero column space of A Last n-r rows of VH, ortho-normal basis for the zero row space of A

SVD Properties MP inverse based on the SVD A = UΣVH, A+ = VΣ+UH Σ+: Pseudo Inverse of Σ

SVD Properties Spectral of Matrix A ||A||spec = maximum singular value of A F-Norm of A: ||A||F = ||Σ||F Orthonormal matrix does not change 2-Norm Determinant of Matrix A: |det(A)| = |det(U)||det(Σ)||det(VH)| = |det(Σ)| cond(A) = maximum singular value / minimum singular value

SVD Properties cond(A) = maximum singular value / minimum singular value ||A||2 = maximum singular value ||A-1||2 = inverse of minimum singular value Minimum singular value min (xHAHAx), s.t. xHx = 1 Maximum singular value max (xHAHAx), s.t. xHx = 1

SVD Properties Low Rank Matrix approximation Norm and spectrum Signal and data processing Minimum Spectral and F-Norm under Rank-k Matrix

SVD Properties Inequalities on the Singular Values Rank the Singular Values of Matrices A and B Consider the Singular Values of Matrix A+B

SVD Properties Ky-Fan Norm: the largest k singular values of matrix Special Cases of Ky-Fan Norm k = 1, the largest singular value k = N, the trace norm Ky-Fan Norm Inequalities