Unit II-2. Orthogonal projection. Orthogonal projection. Orthogonal projection. the scalar is called the component of u along v. two vectors u,v are

Size: px
Start display at page:

Download "Unit II-2. Orthogonal projection. Orthogonal projection. Orthogonal projection. the scalar is called the component of u along v. two vectors u,v are"

Transcription

1 Orthogonal projection Unit II-2 Orthogonal projection the scalar is called the component of u along v in real ips this may be a positive or negative value in complex ips this may have any complex value two vectors u,v are orthogonal if and only if proj(u,v) = 0 linearly dependent if and only if proj(u,v) = u Unit II-2 Orthogonal projection 1 Unit II-2 Orthogonal projection 3 Orthogonal projection Example. For u=(1,-3,4), v=(3,4,7) find proj(u,v) and proj(v,u). the orthogonal projection of u on v is the vector C-S says that proj(u,v) u just evaluate it and apply C-S at the critical moment Unit II-2 Orthogonal projection 2 Unit II-2 Orthogonal projection 4

2 Orthogonal complement V is an ips, S is a subset of vectors the orthogonal complement of S [ S perp ] is S is a subspace of V: w S, u,v S, and a,b scalars then au+bv,w = a u,w + b v,w =a(0) + b(0) = 0 so au+bv S if S = {w} write w instead of S for simplicity if W is subspace of V then W W = {0} (W ) = W Unit II-2 Orthogonal projection 5 Rowspace and nullspace again The row space R and null space N of a matrix are orthogonal complements. example on slide 6 illustrates this given a basis for R you can find the nullspace N by finding the orthogonal complement R given a basis for the nullspace N you can find R by finding the orthogonal complement N Unit II-2 Orthogonal projection 7 Example. Find a basis for W if W is the subspace of R 5 spanned by u=(1,2,3,-1,2), v=(2,4,7,2,-1). A geometric view of planes the vector equation of a plane in R 3 is (r - r 0 ) n = 0 or r n = r 0 n or proj(r,n) = proj(r 0,n) n r r 0 Unit II-2 Orthogonal projection 6 Unit II-2 Orthogonal projection 8

3 Orthogonal projection onto a subspace Orthogonal projection onto a subspace have projection onto a line what about onto a plane? v is decomposed into a sum of two orthogonal vectors: v = v 1 + v 2 v 1 W and v 2 W geometrically the decomposition is obviously unique v 2 = v - proj(v,w) n v 1 = proj(v,w) v For any subspace W how do we calculate proj(v,w)? Unit II-2 Orthogonal projection 9 Unit II-2 Orthogonal projection 11 Orthogonal projection onto a subspace take any subspace W of an ips V V can be decomposed as V = W W any vector v V can be decomposed uniquely as v = v 1 + v 2 with v 1 W and v 2 W for instance for T A :V U the decomposition is V = rowspace A nullspace A Orthogonal sets a set of non-zero vectors {u 1, u 2,..., u n } is an orthogonal set if u i,u j = 0 for i j an orthogonal set is an orthonormal set if u i = 1 for all i orthogonal sets are linearly independent Unit II-2 Orthogonal projection 10 Unit II-2 Orthogonal projection 12

4 Examples: orthogonal sets the standard basis vectors are an orthonormal basis for R n the basis {(1,2), (1,-1)} for R 2 is not an orthogonal basis the vectors {1, cos t, cos 2t,..., sin t, sin 2t,...} are an orthogonal set in C [-π,π] this is the foundation for Fourier analysis Orthogonal bases the decomposition of v is or Unit II-2 Orthogonal projection 13 Unit II-2 Orthogonal projection 15 Orthogonal bases choose an orthogonal basis {u 1, u 2,..., u n } for V express a vector v in terms of this basis: Example. S={u 1,u 2,u 3,u 4 } with u 1 =(1,1,0,-1), u 2 =(1,2,1,3), u 3 =(1,1,-9,2), u 4 =(16,-13,1,3) is an orthogonal basis. Find the coordinates of a general vector (a,b,c,d) with respect to S. v = a 1 u 1 + a 2 u a n u n now calculate v,u i = a i u i,u i = a i u i,u i and solve for the scalars these are called the Fourier coefficients of v with respect to the orthogonal basis chosen Unit II-2 Orthogonal projection 14 Unit II-2 Orthogonal projection 16

5 Projection onto a subspace illustration for a plane in R 3 v proj(v,u 2 ) proj(v,u 1 ) u 2 v 1 = proj(v,w) u 1 Unit II-2 Orthogonal projection 17 Unit II-2 Orthogonal projection 19 Orthogonal projection onto a subspace now we can answer the question about how to define and calculate proj(v,w) Example. Find the proj(v,w) for v = (1,3,5,7) and W < R 4 spanned by {u 1,u 2 } where u 1 =(1,1,1,1), u 2 =(1,-3,4,-2). choose an orthogonal basis {u 1, u 2,..., u r } for W the projection of v on W is this o n l y works if the basis is orthogonal Unit II-2 Orthogonal projection 18 Unit II-2 Orthogonal projection 20

6 Orthonormal bases if is an orthonormal basis things can be written more neatly... this gives exactly the previous formula when written as projections Gramm-Schmidt algorithm this procedure converts any old basis {u 1,u 2,...,u n } of V into an orthogonal basis define w 1 = u 1 w 2 = u 2 - proj(u 2,w 1 ) w 3 = u 3 - proj(u 3,w 1 ) - proj(u 3,w 2 )...and so on then {w 1,w 2,...,w n } is an orthogonal basis of V normalize the w i to get an orthonormal basis Unit II-2 Orthogonal projection 21 Unit II-2 Orthogonal projection 23 Projection onto a subspace Why Gramm-Schmidt works: geometrically What do you do if your basis for W isn t orthogonal? w 3 u 3 proj(u 3,w 2 ) proj(u 3,w 1 ) w 2 w 1 Unit II-2 Orthogonal projection 22 Unit II-2 Orthogonal projection 24

7 Why Gramm-Schmidt works: algebraically say you have the orthogonal set {w 1,w 2,...,w r } w r+1 = u r+1 a 1 w 1 a 2 w 2... a r w r the Fourier coefficients are w r+1 is orthogonal to all w 1,..., w r vectors Unit II-2 Orthogonal projection 25 Unit II-2 Orthogonal projection 27 Example. Find an orthonormal basis for the subspace W of R 4 spanned by {u 1,u 2,u 3 } where u 1 =(1,1,1,1), u 2 =(1,2,4,5) u 3 =(1,-3,-4,-2). Gramm-Schmidt in practice G-S is not a very robust numerical algorithm, but it s valuable for important theoretical reasons e.g. construction of the Legendre polynomials in the next example you won t usually have more than three basis vectors because the calculations can be tedious to avoid messy arithmetic clear all fractions as you make your choice for each w i vector any multiple of each w i will do the job just as well normalize all the w i vectors at the very last step once you have the orthogonal basis the procedure works on any linearly independent set it gives an orthogonal basis for the subspace it spans Unit II-2 Orthogonal projection 26 Unit II-2 Orthogonal projection 28

8 Example. P 3 (t) with f,g defined on the interval [-1,1]. Apply G-S to the mononomial basis to find an orthogonal basis called Legendre polynomials. Example. Find the projection of v = (1,3,5,7) onto the subspace W spanned by {u 1,u 2 } where u 1 =(1,1,1,1), u 2 =(1,2,3,2). Unit II-2 Orthogonal projection 29 Unit II-2 Orthogonal projection 31 Unit II-2 Orthogonal projection 30 Unit II-2 Orthogonal projection 32

9 Example. Find an orthogonal basis for w with w=(1,2,3,1) without using the G-S algorithm. Projection onto a subspace {u 1,..., u p } an orthonormal basis for W<R n U = [ u 1... u p ] is n p proj (y,w) = UU T y for all y R n Unit II-2 Orthogonal projection 33 Unit II-2 Orthogonal projection 35 Orthogonal projection onto a subspace is the closest point to y in W for any v W, is the best approximation to y by vectors in W y d W proj(y,w) Unit II-2 Orthogonal projection 34 Unit II-2 Orthogonal projection 36

1) Give a set-theoretic description of the given points as a subset W of R 3. a) The points on the plane x + y 2z = 0.

1) Give a set-theoretic description of the given points as a subset W of R 3. a) The points on the plane x + y 2z = 0. ) Give a set-theoretic description of the given points as a subset W of R. a) The points on the plane x + y z =. x Solution: W = {x: x = [ x ], x + x x = }. x b) The points in the yz-plane. Solution: W

More information

Column and row space of a matrix

Column and row space of a matrix Column and row space of a matrix Recall that we can consider matrices as concatenation of rows or columns. c c 2 c 3 A = r r 2 r 3 a a 2 a 3 a 2 a 22 a 23 a 3 a 32 a 33 The space spanned by columns of

More information

Math 2B Linear Algebra Test 2 S13 Name Write all responses on separate paper. Show your work for credit.

Math 2B Linear Algebra Test 2 S13 Name Write all responses on separate paper. Show your work for credit. Math 2B Linear Algebra Test 2 S3 Name Write all responses on separate paper. Show your work for credit.. Construct a matrix whose a. null space consists of all combinations of (,3,3,) and (,2,,). b. Left

More information

Orthogonal complements

Orthogonal complements Roberto s Notes on Linear Algebra Chapter 9: Orthogonality Section 3 Orthogonal complements What you need to know already: What orthogonal and orthonormal bases are. What you can learn here: How we can

More information

Maths for Signals and Systems Linear Algebra in Engineering. Some problems by Gilbert Strang

Maths for Signals and Systems Linear Algebra in Engineering. Some problems by Gilbert Strang Maths for Signals and Systems Linear Algebra in Engineering Some problems by Gilbert Strang Problems. Consider u, v, w to be non-zero vectors in R 7. These vectors span a vector space. What are the possible

More information

Geometric transformations assign a point to a point, so it is a point valued function of points. Geometric transformation may destroy the equation

Geometric transformations assign a point to a point, so it is a point valued function of points. Geometric transformation may destroy the equation Geometric transformations assign a point to a point, so it is a point valued function of points. Geometric transformation may destroy the equation and the type of an object. Even simple scaling turns a

More information

CHAPTER 5 SYSTEMS OF EQUATIONS. x y

CHAPTER 5 SYSTEMS OF EQUATIONS. x y page 1 of Section 5.1 CHAPTER 5 SYSTEMS OF EQUATIONS SECTION 5.1 GAUSSIAN ELIMINATION matrix form of a system of equations The system 2x + 3y + 4z 1 5x + y + 7z 2 can be written as Ax where b 2 3 4 A [

More information

Suggested problems - solutions

Suggested problems - solutions Suggested problems - solutions Writing equations of lines and planes Some of these are similar to ones you have examples for... most of them aren t. P1: Write the general form of the equation of the plane

More information

Computer Graphics. Coordinate Systems and Change of Frames. Based on slides by Dianna Xu, Bryn Mawr College

Computer Graphics. Coordinate Systems and Change of Frames. Based on slides by Dianna Xu, Bryn Mawr College Computer Graphics Coordinate Systems and Change of Frames Based on slides by Dianna Xu, Bryn Mawr College Linear Independence A set of vectors independent if is linearly If a set of vectors is linearly

More information

Linear Methods for Regression and Shrinkage Methods

Linear Methods for Regression and Shrinkage Methods Linear Methods for Regression and Shrinkage Methods Reference: The Elements of Statistical Learning, by T. Hastie, R. Tibshirani, J. Friedman, Springer 1 Linear Regression Models Least Squares Input vectors

More information

Visualizing Quaternions

Visualizing Quaternions Visualizing Quaternions Andrew J. Hanson Computer Science Department Indiana University Siggraph 1 Tutorial 1 GRAND PLAN I: Fundamentals of Quaternions II: Visualizing Quaternion Geometry III: Quaternion

More information

Revision Problems for Examination 2 in Algebra 1

Revision Problems for Examination 2 in Algebra 1 Centre for Mathematical Sciences Mathematics, Faculty of Science Revision Problems for Examination in Algebra. Let l be the line that passes through the point (5, 4, 4) and is at right angles to the plane

More information

MATH 890 HOMEWORK 2 DAVID MEREDITH

MATH 890 HOMEWORK 2 DAVID MEREDITH MATH 890 HOMEWORK 2 DAVID MEREDITH (1) Suppose P and Q are polyhedra. Then P Q is a polyhedron. Moreover if P and Q are polytopes then P Q is a polytope. The facets of P Q are either F Q where F is a facet

More information

Perception and Action using Multilinear Forms

Perception and Action using Multilinear Forms Perception and Action using Multilinear Forms Anders Heyden, Gunnar Sparr, Kalle Åström Dept of Mathematics, Lund University Box 118, S-221 00 Lund, Sweden email: {heyden,gunnar,kalle}@maths.lth.se Abstract

More information

Math 355: Linear Algebra: Midterm 1 Colin Carroll June 25, 2011

Math 355: Linear Algebra: Midterm 1 Colin Carroll June 25, 2011 Rice University, Summer 20 Math 355: Linear Algebra: Midterm Colin Carroll June 25, 20 I have adhered to the Rice honor code in completing this test. Signature: Name: Date: Time: Please read the following

More information

Geometric Algebra for Computer Graphics

Geometric Algebra for Computer Graphics John Vince Geometric Algebra for Computer Graphics 4u Springer Contents Preface vii 1 Introduction 1 1.1 Aims and objectives of this book 1 1.2 Mathematics for CGI software 1 1.3 The book's structure 2

More information

Introduction to Vector Space Models

Introduction to Vector Space Models Vector Span, Subspaces, and Basis Vectors Linear Combinations (Review) A linear combination is constructed from a set of terms v, v 2,..., v p by multiplying each term by a constant and adding the result:

More information

MTH309 Linear Algebra: Maple Guide

MTH309 Linear Algebra: Maple Guide MTH309 Linear Algebra: Maple Guide Section 1. Row Echelon Form (REF) and Reduced Row Echelon Form (RREF) Example. Calculate the REF and RREF of the matrix Solution. Use the following command to insert

More information

Vector Calculus: Understanding the Cross Product

Vector Calculus: Understanding the Cross Product University of Babylon College of Engineering Mechanical Engineering Dept. Subject : Mathematics III Class : 2 nd year - first semester Date: / 10 / 2016 2016 \ 2017 Vector Calculus: Understanding the Cross

More information

Math 2331 Linear Algebra

Math 2331 Linear Algebra 4.2 Null Spaces, Column Spaces, & Linear Transformations Math 233 Linear Algebra 4.2 Null Spaces, Column Spaces, & Linear Transformations Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu

More information

Euclidean Geometry. by Rolf Sulanke. Sept 18, version 5, January 30, 2010

Euclidean Geometry. by Rolf Sulanke. Sept 18, version 5, January 30, 2010 Euclidean Geometry by Rolf Sulanke Sept 18, 2003 version 5, January 30, 2010 In this notebook we develop some linear algebraic tools which can be applied to calculations in any dimension, and to creating

More information

Linear Algebra Part I - Linear Spaces

Linear Algebra Part I - Linear Spaces Linear Algebra Part I - Linear Spaces Simon Julier Department of Computer Science, UCL S.Julier@cs.ucl.ac.uk http://moodle.ucl.ac.uk/course/view.php?id=11547 GV01 - Mathematical Methods, Algorithms and

More information

Vector Algebra Transformations. Lecture 4

Vector Algebra Transformations. Lecture 4 Vector Algebra Transformations Lecture 4 Cornell CS4620 Fall 2008 Lecture 4 2008 Steve Marschner 1 Geometry A part of mathematics concerned with questions of size, shape, and relative positions of figures

More information

EE613 Machine Learning for Engineers LINEAR REGRESSION. Sylvain Calinon Robot Learning & Interaction Group Idiap Research Institute Nov.

EE613 Machine Learning for Engineers LINEAR REGRESSION. Sylvain Calinon Robot Learning & Interaction Group Idiap Research Institute Nov. EE613 Machine Learning for Engineers LINEAR REGRESSION Sylvain Calinon Robot Learning & Interaction Group Idiap Research Institute Nov. 4, 2015 1 Outline Multivariate ordinary least squares Singular value

More information

Answers to practice questions for Midterm 1

Answers to practice questions for Midterm 1 Answers to practice questions for Midterm Paul Hacking /5/9 (a The RREF (reduced row echelon form of the augmented matrix is So the system of linear equations has exactly one solution given by x =, y =,

More information

EE613 Machine Learning for Engineers LINEAR REGRESSION. Sylvain Calinon Robot Learning & Interaction Group Idiap Research Institute Nov.

EE613 Machine Learning for Engineers LINEAR REGRESSION. Sylvain Calinon Robot Learning & Interaction Group Idiap Research Institute Nov. EE613 Machine Learning for Engineers LINEAR REGRESSION Sylvain Calinon Robot Learning & Interaction Group Idiap Research Institute Nov. 9, 2017 1 Outline Multivariate ordinary least squares Matlab code:

More information

Performing Matrix Operations on the TI-83/84

Performing Matrix Operations on the TI-83/84 Page1 Performing Matrix Operations on the TI-83/84 While the layout of most TI-83/84 models are basically the same, of the things that can be different, one of those is the location of the Matrix key.

More information

Multiple View Geometry in Computer Vision

Multiple View Geometry in Computer Vision Multiple View Geometry in Computer Vision Prasanna Sahoo Department of Mathematics University of Louisville 1 Projective 3D Geometry (Back to Chapter 2) Lecture 6 2 Singular Value Decomposition Given a

More information

Approximation slides 1. An optimal polynomial algorithm for the Vertex Cover and matching in Bipartite graphs

Approximation slides 1. An optimal polynomial algorithm for the Vertex Cover and matching in Bipartite graphs Approximation slides 1 An optimal polynomial algorithm for the Vertex Cover and matching in Bipartite graphs Approximation slides 2 Linear independence A collection of row vectors {v T i } are independent

More information

Practice problems from old exams for math 233

Practice problems from old exams for math 233 Practice problems from old exams for math 233 William H. Meeks III October 26, 2012 Disclaimer: Your instructor covers far more materials that we can possibly fit into a four/five questions exams. These

More information

Interlude: Solving systems of Equations

Interlude: Solving systems of Equations Interlude: Solving systems of Equations Solving Ax = b What happens to x under Ax? The singular value decomposition Rotation matrices Singular matrices Condition number Null space Solving Ax = 0 under

More information

Schmidt Process can be applied, this means that every nonzero subspace of 8 has an orthonormal basis.

Schmidt Process can be applied, this means that every nonzero subspace of 8 has an orthonormal basis. 8The Gram-Schmidt Process The Gram-Schmidt Process is an algorithm used to convert any basis for a subspace [ of 8 into a new orthogonal basis for [. This orthogonal basis can then be normalized, if desired,

More information

Assignment 4: Mesh Parametrization

Assignment 4: Mesh Parametrization CSCI-GA.3033-018 - Geometric Modeling Assignment 4: Mesh Parametrization In this exercise you will Familiarize yourself with vector field design on surfaces. Create scalar fields whose gradients align

More information

REVIEW FOR THE FIRST SEMESTER EXAM

REVIEW FOR THE FIRST SEMESTER EXAM Algebra II Honors @ Name Period Date REVIEW FOR THE FIRST SEMESTER EXAM You must NEATLY show ALL of your work ON SEPARATE PAPER in order to receive full credit! All graphs must be done on GRAPH PAPER!

More information

Principal Component Analysis for Distributed Data

Principal Component Analysis for Distributed Data Principal Component Analysis for Distributed Data David Woodruff IBM Almaden Based on works with Ken Clarkson, Ravi Kannan, and Santosh Vempala Outline 1. What is low rank approximation? 2. How do we solve

More information

Independent systems consist of x

Independent systems consist of x 5.1 Simultaneous Linear Equations In consistent equations, *Find the solution to each system by graphing. 1. y Independent systems consist of x Three Cases: A. consistent and independent 2. y B. inconsistent

More information

Adaptive Filters Algorithms (Part 2)

Adaptive Filters Algorithms (Part 2) Adaptive Filters Algorithms (Part 2) Gerhard Schmidt Christian-Albrechts-Universität zu Kiel Faculty of Engineering Electrical Engineering and Information Technology Digital Signal Processing and System

More information

Introduction to Geometric Algebra

Introduction to Geometric Algebra Introduction to Geometric Algebra Lecture 6 Intersection and Union of Subspaces Professor Leandro Augusto Frata Fernandes laffernandes@ic.uff.br Lecture notes available in http://www.ic.uff.br/~laffernandes/teaching/2013.1/topicos_ag

More information

LAB 2: Linear Equations and Matrix Algebra. Preliminaries

LAB 2: Linear Equations and Matrix Algebra. Preliminaries Math 250C, Section C2 Hard copy submission Matlab # 2 1 Revised 07/13/2016 LAB 2: Linear Equations and Matrix Algebra In this lab you will use Matlab to study the following topics: Solving a system of

More information

Overview. By end of the week:

Overview. By end of the week: Overview By end of the week: - Know the basics of git - Make sure we can all compile and run a C++/ OpenGL program - Understand the OpenGL rendering pipeline - Understand how matrices are used for geometric

More information

Advanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs

Advanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs Advanced Operations Research Techniques IE316 Quiz 1 Review Dr. Ted Ralphs IE316 Quiz 1 Review 1 Reading for The Quiz Material covered in detail in lecture. 1.1, 1.4, 2.1-2.6, 3.1-3.3, 3.5 Background material

More information

Cubic spline interpolation

Cubic spline interpolation Cubic spline interpolation In the following, we want to derive the collocation matrix for cubic spline interpolation. Let us assume that we have equidistant knots. To fulfill the Schoenberg-Whitney condition

More information

Generalized Principal Component Analysis CVPR 2007

Generalized Principal Component Analysis CVPR 2007 Generalized Principal Component Analysis Tutorial @ CVPR 2007 Yi Ma ECE Department University of Illinois Urbana Champaign René Vidal Center for Imaging Science Institute for Computational Medicine Johns

More information

MATLAB. Advanced Mathematics and Mechanics Applications Using. Third Edition. David Halpern University of Alabama CHAPMAN & HALL/CRC

MATLAB. Advanced Mathematics and Mechanics Applications Using. Third Edition. David Halpern University of Alabama CHAPMAN & HALL/CRC Advanced Mathematics and Mechanics Applications Using MATLAB Third Edition Howard B. Wilson University of Alabama Louis H. Turcotte Rose-Hulman Institute of Technology David Halpern University of Alabama

More information

AN EXTENSION OF A THEOREM OF BARLOTTI TO MULTIPLE DIMENSIONS

AN EXTENSION OF A THEOREM OF BARLOTTI TO MULTIPLE DIMENSIONS AN EXTENSION OF A THEOREM OF BARLOTTI TO MULTIPLE DIMENSIONS B. D. S. DON MCCONNELL In [1], A. Barlotti shows that any affinely regular polygon in the plane can be expressed as the vertex sum of two regular

More information

and F is an antiderivative of f

and F is an antiderivative of f THE EVALUATION OF DEFINITE INTEGRALS Prepared by Ingrid Stewart, Ph.D., College of Southern Nevada Please Send Questions Comments to ingrid.stewart@csn.edu. Thank you! We have finally reached a point,

More information

Linear Transformations

Linear Transformations Linear Transformations The two basic vector operations are addition and scaling From this perspective, the nicest functions are those which preserve these operations: Def: A linear transformation is a

More information

Announcements. Image Matching! Source & Destination Images. Image Transformation 2/ 3/ 16. Compare a big image to a small image

Announcements. Image Matching! Source & Destination Images. Image Transformation 2/ 3/ 16. Compare a big image to a small image 2/3/ Announcements PA is due in week Image atching! Leave time to learn OpenCV Think of & implement something creative CS 50 Lecture #5 February 3 rd, 20 2/ 3/ 2 Compare a big image to a small image So

More information

Parallel and perspective projections such as used in representing 3d images.

Parallel and perspective projections such as used in representing 3d images. Chapter 5 Rotations and projections In this chapter we discuss Rotations Parallel and perspective projections such as used in representing 3d images. Using coordinates and matrices, parallel projections

More information

Classroom Tips and Techniques: Stepwise Solutions in Maple - Part 2 - Linear Algebra

Classroom Tips and Techniques: Stepwise Solutions in Maple - Part 2 - Linear Algebra Introduction Classroom Tips and Techniques: Stepwise Solutions in Maple - Part 2 - Linear Algebra Robert J. Lopez Emeritus Professor of Mathematics and Maple Fellow Maplesoft In the preceding article Stepwise

More information

Linear Programming. Slides by Carl Kingsford. Apr. 14, 2014

Linear Programming. Slides by Carl Kingsford. Apr. 14, 2014 Linear Programming Slides by Carl Kingsford Apr. 14, 2014 Linear Programming Suppose you are given: A matrix A with m rows and n columns. A vector b of length m. A vector c of length n. Find a length-n

More information

Honors Precalculus: Solving equations and inequalities graphically and algebraically. Page 1

Honors Precalculus: Solving equations and inequalities graphically and algebraically. Page 1 Solving equations and inequalities graphically and algebraically 1. Plot points on the Cartesian coordinate plane. P.1 2. Represent data graphically using scatter plots, bar graphs, & line graphs. P.1

More information

Chapter 1: Number and Operations

Chapter 1: Number and Operations Chapter 1: Number and Operations 1.1 Order of operations When simplifying algebraic expressions we use the following order: 1. Perform operations within a parenthesis. 2. Evaluate exponents. 3. Multiply

More information

Tensor products in a wavelet setting

Tensor products in a wavelet setting Chapter 8 Tensor products in a wavelet setting In Chapter 7 we defined tensor products in terms of vectors, and we saw that the tensor product of two vectors is in fact a matrix. The same construction

More information

CT5510: Computer Graphics. Transformation BOCHANG MOON

CT5510: Computer Graphics. Transformation BOCHANG MOON CT5510: Computer Graphics Transformation BOCHANG MOON 2D Translation Transformations such as rotation and scale can be represented using a matrix M.., How about translation? No way to express this using

More information

A second order algorithm for orthogonal projection onto curves and surfaces

A second order algorithm for orthogonal projection onto curves and surfaces A second order algorithm for orthogonal projection onto curves and surfaces Shi-min Hu and Johannes Wallner Dept. of Computer Science and Technology, Tsinghua University, Beijing, China shimin@tsinghua.edu.cn;

More information

Legal and impossible dependences

Legal and impossible dependences Transformations and Dependences 1 operations, column Fourier-Motzkin elimination us use these tools to determine (i) legality of permutation and Let generation of transformed code. (ii) Recall: Polyhedral

More information

Inverse and Implicit functions

Inverse and Implicit functions CHAPTER 3 Inverse and Implicit functions. Inverse Functions and Coordinate Changes Let U R d be a domain. Theorem. (Inverse function theorem). If ϕ : U R d is differentiable at a and Dϕ a is invertible,

More information

4. Simplicial Complexes and Simplicial Homology

4. Simplicial Complexes and Simplicial Homology MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 4. Simplicial Complexes and Simplicial Homology Geometric simplicial complexes 4.1 Definition. A finite subset { v 0, v 1,..., v r } R n

More information

CSE 554 Lecture 6: Fairing and Simplification

CSE 554 Lecture 6: Fairing and Simplification CSE 554 Lecture 6: Fairing and Simplification Fall 2012 CSE554 Fairing and simplification Slide 1 Review Iso-contours in grayscale images and volumes Piece-wise linear representations Polylines (2D) and

More information

3. Replace any row by the sum of that row and a constant multiple of any other row.

3. Replace any row by the sum of that row and a constant multiple of any other row. Math Section. Section.: Solving Systems of Linear Equations Using Matrices As you may recall from College Algebra or Section., you can solve a system of linear equations in two variables easily by applying

More information

The Fast Multipole Method (FMM)

The Fast Multipole Method (FMM) The Fast Multipole Method (FMM) Motivation for FMM Computational Physics Problems involving mutual interactions of N particles Gravitational or Electrostatic forces Collective (but weak) long-range forces

More information

Math background. 2D Geometric Transformations. Implicit representations. Explicit representations. Read: CS 4620 Lecture 6

Math background. 2D Geometric Transformations. Implicit representations. Explicit representations. Read: CS 4620 Lecture 6 Math background 2D Geometric Transformations CS 4620 Lecture 6 Read: Chapter 2: Miscellaneous Math Chapter 5: Linear Algebra Notation for sets, functions, mappings Linear transformations Matrices Matrix-vector

More information

Chapter 15 Introduction to Linear Programming

Chapter 15 Introduction to Linear Programming Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2015 Wei-Ta Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of

More information

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 14

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 14 FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 14 RAVI VAKIL CONTENTS 1. Introduction 1 2. The Proj construction 2 3. Examples 7 4. Maps of graded rings and maps of projective schemes 8 5. Important exercises

More information

The Three Dimensional Coordinate System

The Three Dimensional Coordinate System The Three-Dimensional Coordinate System The Three Dimensional Coordinate System You can construct a three-dimensional coordinate system by passing a z-axis perpendicular to both the x- and y-axes at the

More information

Introductory Combinatorics

Introductory Combinatorics Introductory Combinatorics Third Edition KENNETH P. BOGART Dartmouth College,. " A Harcourt Science and Technology Company San Diego San Francisco New York Boston London Toronto Sydney Tokyo xm CONTENTS

More information

To Do. Outline. Translation. Homogeneous Coordinates. Foundations of Computer Graphics. Representation of Points (4-Vectors) Start doing HW 1

To Do. Outline. Translation. Homogeneous Coordinates. Foundations of Computer Graphics. Representation of Points (4-Vectors) Start doing HW 1 Foundations of Computer Graphics Homogeneous Coordinates Start doing HW 1 To Do Specifics of HW 1 Last lecture covered basic material on transformations in 2D Likely need this lecture to understand full

More information

Hierarchical GEMINI - Hierarchical linear subspace indexing method

Hierarchical GEMINI - Hierarchical linear subspace indexing method Hierarchical GEMINI - Hierarchical linear subspace indexing method GEneric Multimedia INdexIng DB in feature space Range Query Linear subspace sequence method DB in subspace Generic constraints Computing

More information

CS 450 Numerical Analysis. Chapter 7: Interpolation

CS 450 Numerical Analysis. Chapter 7: Interpolation Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80

More information

Introduction to Transformations. In Geometry

Introduction to Transformations. In Geometry + Introduction to Transformations In Geometry + What is a transformation? A transformation is a copy of a geometric figure, where the copy holds certain properties. Example: copy/paste a picture on your

More information

GEOMETRIC TOOLS FOR COMPUTER GRAPHICS

GEOMETRIC TOOLS FOR COMPUTER GRAPHICS GEOMETRIC TOOLS FOR COMPUTER GRAPHICS PHILIP J. SCHNEIDER DAVID H. EBERLY MORGAN KAUFMANN PUBLISHERS A N I M P R I N T O F E L S E V I E R S C I E N C E A M S T E R D A M B O S T O N L O N D O N N E W

More information

Euclidean Space. Definition 1 (Euclidean Space) A Euclidean space is a finite-dimensional vector space over the reals R, with an inner product,.

Euclidean Space. Definition 1 (Euclidean Space) A Euclidean space is a finite-dimensional vector space over the reals R, with an inner product,. Definition 1 () A Euclidean space is a finite-dimensional vector space over the reals R, with an inner product,. 1 Inner Product Definition 2 (Inner Product) An inner product, on a real vector space X

More information

Fundamental Matrix & Structure from Motion

Fundamental Matrix & Structure from Motion Fundamental Matrix & Structure from Motion Instructor - Simon Lucey 16-423 - Designing Computer Vision Apps Today Transformations between images Structure from Motion The Essential Matrix The Fundamental

More information

Contents. Implementing the QR factorization The algebraic eigenvalue problem. Applied Linear Algebra in Geoscience Using MATLAB

Contents. Implementing the QR factorization The algebraic eigenvalue problem. Applied Linear Algebra in Geoscience Using MATLAB Applied Linear Algebra in Geoscience Using MATLAB Contents Getting Started Creating Arrays Mathematical Operations with Arrays Using Script Files and Managing Data Two-Dimensional Plots Programming in

More information

COMP 558 lecture 19 Nov. 17, 2010

COMP 558 lecture 19 Nov. 17, 2010 COMP 558 lecture 9 Nov. 7, 2 Camera calibration To estimate the geometry of 3D scenes, it helps to know the camera parameters, both external and internal. The problem of finding all these parameters is

More information

( ) ( ) Completing the Square. Alg 3 1 Rational Roots Solving Polynomial Equations. A Perfect Square Trinomials

( ) ( ) Completing the Square. Alg 3 1 Rational Roots Solving Polynomial Equations. A Perfect Square Trinomials Alg Completing the Square A Perfect Square Trinomials (± ) ± (± ) ± 4 4 (± ) ± 6 9 (± 4) ± 8 6 (± 5) ± 5 What is the relationship between the red term and the blue term? B. Creating perfect squares.. 6

More information

CMSC 451: Linear Programming

CMSC 451: Linear Programming CMSC 451: Linear Programming Slides By: Carl Kingsford Department of Computer Science University of Maryland, College Park Linear Programming Suppose you are given: A matrix A with m rows and n columns.

More information

What You ll See in This Chapter. Word Cloud. Definitions. Matrix Components. Ian Parberry University of North Texas. Fletcher Dunn

What You ll See in This Chapter. Word Cloud. Definitions. Matrix Components. Ian Parberry University of North Texas. Fletcher Dunn What You ll See in This Chapter Chapter 4: Introduction to Matrices Fletcher Dunn Valve Software Ian Parberry University of North Texas 3D Math Primer for Graphics and Game Development This chapter introduces

More information

Epipolar Geometry and the Essential Matrix

Epipolar Geometry and the Essential Matrix Epipolar Geometry and the Essential Matrix Carlo Tomasi The epipolar geometry of a pair of cameras expresses the fundamental relationship between any two corresponding points in the two image planes, and

More information

Two-View Geometry (Course 23, Lecture D)

Two-View Geometry (Course 23, Lecture D) Two-View Geometry (Course 23, Lecture D) Jana Kosecka Department of Computer Science George Mason University http://www.cs.gmu.edu/~kosecka General Formulation Given two views of the scene recover the

More information

Lecture notes on the simplex method September We will present an algorithm to solve linear programs of the form. maximize.

Lecture notes on the simplex method September We will present an algorithm to solve linear programs of the form. maximize. Cornell University, Fall 2017 CS 6820: Algorithms Lecture notes on the simplex method September 2017 1 The Simplex Method We will present an algorithm to solve linear programs of the form maximize subject

More information

Interactive Math Glossary Terms and Definitions

Interactive Math Glossary Terms and Definitions Terms and Definitions Absolute Value the magnitude of a number, or the distance from 0 on a real number line Addend any number or quantity being added addend + addend = sum Additive Property of Area the

More information

Let s write this out as an explicit equation. Suppose that the point P 0 = (x 0, y 0, z 0 ), P = (x, y, z) and n = (A, B, C).

Let s write this out as an explicit equation. Suppose that the point P 0 = (x 0, y 0, z 0 ), P = (x, y, z) and n = (A, B, C). 4. Planes and distances How do we represent a plane Π in R 3? In fact the best way to specify a plane is to give a normal vector n to the plane and a point P 0 on the plane. Then if we are given any point

More information

FMA901F: Machine Learning Lecture 3: Linear Models for Regression. Cristian Sminchisescu

FMA901F: Machine Learning Lecture 3: Linear Models for Regression. Cristian Sminchisescu FMA901F: Machine Learning Lecture 3: Linear Models for Regression Cristian Sminchisescu Machine Learning: Frequentist vs. Bayesian In the frequentist setting, we seek a fixed parameter (vector), with value(s)

More information

8/27/2016. ECE 120: Introduction to Computing. Graphical Illustration of Modular Arithmetic. Representations Must be Unambiguous

8/27/2016. ECE 120: Introduction to Computing. Graphical Illustration of Modular Arithmetic. Representations Must be Unambiguous University of Illinois at Urbana-Champaign Dept. of Electrical and Computer Engineering ECE 120: Introduction to Computing Signed Integers and 2 s Complement Strategy: Use Common Hardware for Two Representations

More information

Matrix Inverse 2 ( 2) 1 = 2 1 2

Matrix Inverse 2 ( 2) 1 = 2 1 2 Name: Matrix Inverse For Scalars, we have what is called a multiplicative identity. This means that if we have a scalar number, call it r, then r multiplied by the multiplicative identity equals r. Without

More information

(Spline, Bezier, B-Spline)

(Spline, Bezier, B-Spline) (Spline, Bezier, B-Spline) Spline Drafting terminology Spline is a flexible strip that is easily flexed to pass through a series of design points (control points) to produce a smooth curve. Spline curve

More information

Geometric Analysis of Wing Sections

Geometric Analysis of Wing Sections NASA Technical Memorandum 110346 Geometric Analysis of Wing Sections I-Chung Chang, Francisco J. Torres, and Chee Tung April 1995 National Aeronautics and Space Administration Ames Research Center Moffett

More information

Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers

Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers Isil Dillig, Thomas Dillig, and Alex Aiken Computer Science Department Stanford University Linear Arithmetic

More information

The following information is for reviewing the material since Exam 3:

The following information is for reviewing the material since Exam 3: Outcomes List for Math 121 Calculus I Fall 2010-2011 General Information: The purpose of this Outcomes List is to give you a concrete summary of the material you should know, and the skills you should

More information

Algebraic Iterative Methods for Computed Tomography

Algebraic Iterative Methods for Computed Tomography Algebraic Iterative Methods for Computed Tomography Per Christian Hansen DTU Compute Department of Applied Mathematics and Computer Science Technical University of Denmark Per Christian Hansen Algebraic

More information

spanning trees of tree graphs Philippe Biane, CNRS-IGM-Université Paris-Est Firenze, May

spanning trees of tree graphs Philippe Biane, CNRS-IGM-Université Paris-Est Firenze, May Spanning trees of tree graphs, CNRS-IGM-Université Paris-Est Firenze, May 18 2015 joint work with Guillaume Chapuy, CNRS-LIAFA-Université Paris 7 V, E=directed graph w x e v Q=Laplacian matrix, indexed

More information

vector space retrieval many slides courtesy James Amherst

vector space retrieval many slides courtesy James Amherst vector space retrieval many slides courtesy James Allan@umass Amherst 1 what is a retrieval model? Model is an idealization or abstraction of an actual process Mathematical models are used to study the

More information

Integrated Algebra 2 and Trigonometry. Quarter 1

Integrated Algebra 2 and Trigonometry. Quarter 1 Quarter 1 I: Functions: Composition I.1 (A.42) Composition of linear functions f(g(x)). f(x) + g(x). I.2 (A.42) Composition of linear and quadratic functions II: Functions: Quadratic II.1 Parabola The

More information

Chapter 3 Numerical Methods

Chapter 3 Numerical Methods Chapter 3 Numerical Methods Part 1 3.1 Linearization and Optimization of Functions of Vectors 1 Problem Notation 2 Outline 3.1.1 Linearization 3.1.2 Optimization of Objective Functions 3.1.3 Constrained

More information

Sung-Eui Yoon ( 윤성의 )

Sung-Eui Yoon ( 윤성의 ) CS480: Computer Graphics Curves and Surfaces Sung-Eui Yoon ( 윤성의 ) Course URL: http://jupiter.kaist.ac.kr/~sungeui/cg Today s Topics Surface representations Smooth curves Subdivision 2 Smooth Curves and

More information

CS545 Contents IX. Inverse Kinematics. Reading Assignment for Next Class. Analytical Methods Iterative (Differential) Methods

CS545 Contents IX. Inverse Kinematics. Reading Assignment for Next Class. Analytical Methods Iterative (Differential) Methods CS545 Contents IX Inverse Kinematics Analytical Methods Iterative (Differential) Methods Geometric and Analytical Jacobian Jacobian Transpose Method Pseudo-Inverse Pseudo-Inverse with Optimization Extended

More information

Sparse Reconstruction / Compressive Sensing

Sparse Reconstruction / Compressive Sensing Sparse Reconstruction / Compressive Sensing Namrata Vaswani Department of Electrical and Computer Engineering Iowa State University Namrata Vaswani Sparse Reconstruction / Compressive Sensing 1/ 20 The

More information

APPM/MATH Problem Set 4 Solutions

APPM/MATH Problem Set 4 Solutions APPM/MATH 465 Problem Set 4 Solutions This assignment is due by 4pm on Wednesday, October 16th. You may either turn it in to me in class on Monday or in the box outside my office door (ECOT 35). Minimal

More information