Norms, Sensitivity and Conditioning

Similar documents
Eigenproblems II: Computation

Linear Systems and LU

Singular Value Decomposition

Linear Algebra Review

Optimization II: Unconstrained Multivariable

Conjugate Gradients I: Setup

Numerics and Error Analysis

Announce Statistical Motivation Properties Spectral Theorem Other ODE Theory Spectral Embedding. Eigenproblems I

Announce Statistical Motivation ODE Theory Spectral Embedding Properties Spectral Theorem Other. Eigenproblems I

Ordinary Differential Equations I

Nonlinearity Root-finding Bisection Fixed Point Iteration Newton s Method Secant Method Conclusion. Nonlinear Systems

Topics. Review of lecture 2/11 Error, Residual and Condition Number. Review of lecture 2/16 Backward Error Analysis The General Case 1 / 22

AMS 147 Computational Methods and Applications Lecture 17 Copyright by Hongyun Wang, UCSC

Course Information Course Overview Study Skills Background Material. Introduction. CS 205A: Mathematical Methods for Robotics, Vision, and Graphics

Linear Systems and LU

Let x be an approximate solution for Ax = b, e.g., obtained by Gaussian elimination. Let x denote the exact solution. Call. r := b A x.

Numerical Methods I Solving Square Linear Systems: GEM and LU factorization

ERROR AND SENSITIVTY ANALYSIS FOR SYSTEMS OF LINEAR EQUATIONS. Perturbation analysis for linear systems (Ax = b)

Optimization II: Unconstrained Multivariable

Lecture 9. Errors in solving Linear Systems. J. Chaudhry (Zeb) Department of Mathematics and Statistics University of New Mexico

Ordinary Differential Equations I

Lecture 7. Gaussian Elimination with Pivoting. David Semeraro. University of Illinois at Urbana-Champaign. February 11, 2014

Homework 1. Yuan Yao. September 18, 2011

Nonlinearity Root-finding Bisection Fixed Point Iteration Newton s Method Secant Method Conclusion. Nonlinear Systems

Ordinary Differential Equations I

Ordinary Differential Equations II

The Eigenvalue Problem: Perturbation Theory

Scientific Computing

Linear Algebra Massoud Malek

Ordinary Differential Equations II

Partial Differential Equations II

PowerPoints organized by Dr. Michael R. Gustafson II, Duke University

Scientific Computing: Dense Linear Systems

Basic Concepts in Linear Algebra

Review of Basic Concepts in Linear Algebra

AM 205: lecture 6. Last time: finished the data fitting topic Today s lecture: numerical linear algebra, LU factorization

Section 3.9. Matrix Norm

Numerical Algorithms. IE 496 Lecture 20

A Review of Matrix Analysis

COURSE Numerical methods for solving linear systems. Practical solving of many problems eventually leads to solving linear systems.

CS281A/Stat241A Lecture 19

Dimension reduction, PCA & eigenanalysis Based in part on slides from textbook, slides of Susan Holmes. October 3, Statistics 202: Data Mining

MATH 3511 Lecture 1. Solving Linear Systems 1

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 9

AM 205: lecture 6. Last time: finished the data fitting topic Today s lecture: numerical linear algebra, LU factorization


MATH2071: LAB #5: Norms, Errors and Condition Numbers

ECEN 615 Methods of Electric Power Systems Analysis Lecture 18: Least Squares, State Estimation

Gaussian Elimination for Linear Systems

Computational Methods CMSC/AMSC/MAPL 460. Vectors, Matrices, Linear Systems, LU Decomposition, Ramani Duraiswami, Dept. of Computer Science

Introduction to Numerical Analysis

Today s class. Linear Algebraic Equations LU Decomposition. Numerical Methods, Fall 2011 Lecture 8. Prof. Jinbo Bi CSE, UConn

Matrix decompositions

Scientific Computing: Solving Linear Systems

Linear Algebraic Equations

THE PERTURBATION BOUND FOR THE SPECTRAL RADIUS OF A NON-NEGATIVE TENSOR

Error Analysis for Solving a Set of Linear Equations

CSCI 2033 Spring 2016 ELEMENTARY COMPUTATIONAL LINEAR ALGEBRA

ESTIMATION OF ERROR. r = b Abx a quantity called the residual for bx. Then

Polar Decomposition of a Matrix

Lecture 5. Ch. 5, Norms for vectors and matrices. Norms for vectors and matrices Why?

LECTURE NOTES ELEMENTARY NUMERICAL METHODS. Eusebius Doedel

Statistics 202: Data Mining. c Jonathan Taylor. Week 2 Based in part on slides from textbook, slides of Susan Holmes. October 3, / 1

Part I. Other datatypes, preprocessing. Other datatypes. Other datatypes. Week 2 Based in part on slides from textbook, slides of Susan Holmes

Adam Blank Spring 2017 CSE 311. Foundations of Computing I

EECS 275 Matrix Computation

Finding Limits Graphically and Numerically

Numerical Methods in Matrix Computations

Section Vectors

Outline Python, Numpy, and Matplotlib Making Models with Polynomials Making Models with Monte Carlo Error, Accuracy and Convergence Floating Point Mod

De-biasing the Lasso: Optimal Sample Size for Gaussian Designs

About this class. Yousef Saad 1. Noah Lebovic 2. Jessica Lee 3. Abhishek Vashist Office hours: refer to the class web-page.

Chapter 4 No. 4.0 Answer True or False to the following. Give reasons for your answers.

Linear Inverse Problems

Inner products and Norms. Inner product of 2 vectors. Inner product of 2 vectors x and y in R n : x 1 y 1 + x 2 y x n y n in R n

For δa E, this motivates the definition of the Bauer-Skeel condition number ([2], [3], [14], [15])

Iterative Methods for Linear Systems

Characteristic polynomials and pseudospectra

Applied Mathematics 205. Unit II: Numerical Linear Algebra. Lecturer: Dr. David Knezevic

Iterative solvers for linear equations

Bindel, Fall 2011 Intro to Scientific Computing (CS 3220) Week 3: Wednesday, Jan 9

APPM/MATH Problem Set 6 Solutions

30.4. Matrix Norms. Introduction. Prerequisites. Learning Outcomes

Confidence intervals for the mixing time of a reversible Markov chain from a single sample path

Lecture 11: Finish Gaussian elimination and applications; intro to eigenvalues and eigenvectors (1)

Numerical Methods. Elena loli Piccolomini. Civil Engeneering. piccolom. Metodi Numerici M p. 1/??

CHAPTER 11. A Revision. 1. The Computers and Numbers therein

CS 323: Numerical Analysis and Computing

5 Solving Systems of Linear Equations

I-v k e k. (I-e k h kt ) = Stability of Gauss-Huard Elimination for Solving Linear Systems. 1 x 1 x x x x

Math background for PS1. Jiahui Shi

lecture 2 and 3: algorithms for linear algebra

ACM 104. Homework Set 4 Solutions February 14, 2001

DEN: Linear algebra numerical view (GEM: Gauss elimination method for reducing a full rank matrix to upper-triangular

1 9/5 Matrices, vectors, and their applications

CS412: Lecture #17. Mridul Aanjaneya. March 19, 2015

Structured Condition Numbers and Backward Errors in Scalar Product Spaces

CS412: Introduction to Numerical Methods

9.1 Preconditioned Krylov Subspace Methods

Going from graphic solutions to algebraic

Transcription:

Norms, Sensitivity and Conditioning CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Doug James (and Justin Solomon) CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 1 / 26

Announcements Reminder: HW0 due Thursday 11:59pm. http://cs205a.stanford.edu now works JuliaBox fine for online. Try Jupyter, or JuliPro+Atom, or JUNO, etc. for offline. CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 2 / 26

Questions Gaussian elimination works in theory, but what about floating point precision? How much can we trust x 0 if 0 < A x 0 b 1? CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 3 / 26

Recall: Backward Error Backward Error The amount a problem statement would have to change to realize a given approximation of its solution Example 1: x Example 2: A x = b CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 4 / 26

Perturbation Analysis How does x change if we solve (A + δa) x = b + δ b? Two viewpoints: Thanks to floating point precision, A and b are approximate If x 0 isn t the exact solution, what is the backward error? CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 5 / 26

What is Small? What does it mean for a statement to hold for small δ x? CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 6 / 26

What is Small? What does it mean for a statement to hold for small δ x? Vector norm A function : R n [0, ) satisfying: 1. x = 0 iff x = 0 2. c x = c x c R, x R n 3. x + y x + y x, y R n CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 6 / 26

Our Favorite Norm x 2 x 2 1 + x2 2 + + x2 n CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 7 / 26

p-norms For p 1, x p ( x 1 p + x 2 p + + x n p ) 1 /p Taxicab norm: x 1 CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 8 / 26

Norm x max ( x 1, x 2,..., x n ) CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 9 / 26

How are Norms Different? CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 10 / 26

How are Norms the Same? Equivalent norms Two norms and are equivalent if there exist constants c low and c high such that c low x x c high x for all x R n. CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 11 / 26

How are Norms the Same? Equivalent norms Two norms and are equivalent if there exist constants c low and c high such that c low x x c high x for all x R n. Theorem All norms on R n are equivalent. CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 11 / 26

How are Norms the Same? Equivalent norms Two norms and are equivalent if there exist constants c low and c high such that c low x x c high x for all x R n. Theorem All norms on R n are equivalent. (10000, 1000, 1000) vs. (10000, 0, 0)? CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 11 / 26

Matrix Norms: Unrolled Construction Convert to vector, and use vector p-norm: A R m n a[:] R mn Achieved by vecnorm(a, p) in Julia. Special Case: Frobenius norm (p=2): A Fro ij a 2 ij CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 12 / 26

Matrix Norms: Induced Construction Maximum stretching of a unit vector by A: A max{ A x : x = 1} CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 13 / 26

Matrix Norms: Induced Construction Maximum stretching of a unit vector by A: A max{ A x : x = 1} Different matrix norms induced by different vector p-norms. Case p=2: What is the norm induced by 2? CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 13 / 26

Matrix Norms: A 2 Visualization Induced two-norm, or spectral norm, of A R n n is the square root of the largest eigenvalue of A T A: A 2 2 = max{λ : there exists x R n with A T A x = λ x} CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 14 / 26

Other Induced Norms A 1 max j A max i i j a ij a ij CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 15 / 26

Question Are all matrix norms equivalent? CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 16 / 26

Recall: Condition Number Condition number Ratio of forward to backward error Root-finding example: 1 f (x ) CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 17 / 26

Model Problem (A + ε δa) x(ε) = b + ε δ b CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 18 / 26

Simplification (on the board!) d x = A 1 (δ dε b δa x(0)) ε=0 x(ε) x(0) x(0) ε A 1 A ( δ ) b b + δa + O(ε 2 ) A CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 19 / 26

Condition Number Condition number The condition number of A R n n for a given matrix norm is cond A κ A 1 A. CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 20 / 26

Condition Number Condition number The condition number of A R n n for a given matrix norm is cond A κ A 1 A. Relative change: D δ b + δa b A x(ε) x(0) ε D κ + O(ε 2 ) x(0) CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 20 / 26

Condition Number Condition number The condition number of A R n n for a given matrix norm is cond A κ A 1 A. Relative change: D δ b + δa b A x(ε) x(0) ε D κ + O(ε 2 ) x(0) Invariant to scaling (unlike determinant!); equals one for the identity. CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 20 / 26

Condition Number of Induced Norm cond A = max x 0 min y 0 A x x A y y = max A x x =1 min A y y =1 CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 21 / 26

Condition Number: Visualization Experiments with an ill-conditioned Vandermonde matrix CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 22 / 26

Chicken Egg cond A A A 1 Computing A 1 typically requires solving A x = b, but how do we know the reliability of x? CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 23 / 26

To Avoid... What is the condition number of computing the condition number of A? CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 24 / 26

To Avoid... What is the condition number of computing the condition number of A? What is the condition number of computing what the condition number is of computing the condition number of A?. CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 24 / 26

Instead Bound the condition number. Below: Problem is at least this hard Above: Problem is at most this hard CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 25 / 26

Potential for Approximation A 1 x A 1 x cond A = A A 1 A A 1 x x Next CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 26 / 26