Overview Linear Algebra Review Linear Algebra Review. What is a Matrix? Additional Resources. Basic Operations.

Similar documents
MERGE-BASED SpMV PERFECT WORKLOAD BALANCE. GUARANTEED. Duane Merrill, NVIDIA Research

COMMON FRACTIONS. or a / b = a b. , a is called the numerator, and b is called the denominator.

Rigid Body Transformations

Reading. K-D Trees and Quad Trees. Geometric Data Structures. k-d Trees. Range Queries. Nearest Neighbor Search. Chapter 12.6

Global Register Allocation

Lecture Outline. Memory Hierarchy Management. Register Allocation. Register Allocation. Lecture 19. Cache Management. The Memory Hierarchy

CS153: Compilers Lecture 20: Register Allocation I

TOPIC 10 THREE DIMENSIONAL GEOMETRY

Finding a Funicular Curve Through Two Points

Lecture Outline. Memory Hierarchy Management. Register Allocation. Register Allocation. Lecture 38. Cache Management. Managing the Memory Hierarchy

Review: Binary Trees. CSCI 262 Data Structures. Search Trees. In Order Traversal. Binary Search Trees 4/10/2018. Review: Binary Tree Implementation

1⅝" - 3¾" (40-95mm) FIXTURE BASE. 3/4" (19mm) 4" - 6¾" ( mm) ALLEN KEY (INCLUDED)

Fundamentals of Engineering Analysis ENGR Matrix Multiplication, Types

CS 331: Artificial Intelligence Bayesian Networks (Inference) Inference

History Rgistr Allotion Exmpl As ol s intrmit o Consir this progrm with six vrils: := + := + := - 1 Us in th originl FORTRAN ompilr (1950 s) Vry ru lg

AIR FORCE STANDARD DESIGN RPA SQUADRON OPERATIONS

GENG2140 Modelling and Computer Analysis for Engineers

WORKSHOP 2 Solid Shell Composites Modeling

Carley Foundry Customer Specifications Index

SAMPLE PREREQUISITE PROBLEMS: CALCULUS

English Bible for the Deaf

( ) ( ) ( ) ( ) ( ) ( )

Introduction Transformation formulae Polar graphs Standard curves Polar equations Test GRAPHS INU0114/514 (MATHS 1)

HSHM-H110AX-5CPX HSHM-H105BX-5CPX TYPE B21, 105 SIGNAL CONTACTS HSHM-HXXXXXX-5CPX-XXXXX

Pointers and Arrays. More Pointer Examples. Pointers CS 217

called the vertex. The line through the focus perpendicular to the directrix is called the axis of the parabola.

Name Date Class. cot. tan. cos. 1 cot 2 csc 2

Carley Foundry Customer Specifications Index

Performance, Scalability, and Numerical Stability of Manycore. Wen-mei Hwu University of Illinois at Urbana-Champaign

Annex A to the DVD-R Disc and DVD-RW Disc Patent License Agreement Essential Sony Patents relevant to DVD-RW Disc

Lecture 39: Register Allocation. The Memory Hierarchy. The Register Allocation Problem. Managing the Memory Hierarchy

CMPUT101 Introduction to Computing - Summer 2002

A0.4 SUITE 902 SUITE 902 5,170 RSF BRADY SULLIVAN PROPERTIES WAUMBEC MILL 123' - 8" Owner MANCHESTER NH 3/16" = 1'-0" Project MANCHESTER NH.

STRAND J: TRANSFORMATIONS, VECTORS and MATRICES

8.2 Areas in the Plane

PROBLEM OF APOLLONIUS

Council Name: The requirement has been satisfied. The requirement is to be satisfied in Stage. Council delegate Council seal.

Introduction to Algebra

Calculus Differentiation

Matrices and Systems of Equations

Portability, Scalability, and Numerical Stability in Accelerated Kernels

Reachability. Directed DFS. Strong Connectivity Algorithm. Strong Connectivity. DFS tree rooted at v: vertices reachable from v via directed paths

Math 227 Problem Set V Solutions. f ds =

Stained Glass Design. Teaching Goals:

Clustering Algorithms

CS380: Computer Graphics Modeling Transformations. Sung-Eui Yoon ( 윤성의 ) Course URL:

Vocabulary Check. 410 Chapter 4 Trigonometry

The Basic Properties of the Integral

Topic 3: 2D Transformations 9/10/2016. Today s Topics. Transformations. Lets start out simple. Points as Homogeneous 2D Point Coords

CCD Color Camera. KP-HD20A/KP-HD1001/5 Series. Remote control protocol Specifications. (preliminary version)

APPLICATION NOTE VACUUM FLUORESCENT DISPLAY MODULE GRAPHIC DISPLAY MODULE GP1157A01B

Viewing and Projection

DOCUMENT STATUS: - NOTICE OF PROPRIETARY INFORMATION

EXPONENTIAL & POWER GRAPHS

MTH 146 Conics Supplement

TCS-DL Series - TCS Dual Transient Current Suppressors

Software Pipelining Can we decrease the latency? Goal of SP Lecture. Seth Copen Goldstein Software Pipelining

Compiling: Examples and Sample Problems

Chapter. Program Library

OPTI 421/521 Introductory Optomechanical Engineering. 6. Mirror matrices. Matrix formalism is used to model reflection from plane mirrors.

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork

Three Dimensional Geometry

CSE P 501 Compilers. Register Allocation Hal Perkins Spring UW CSE P 501 Spring 2018 P-1

Chapter 6: Folding. Keshab K. Parhi

M'''~ ft\'''' PRot MEAAJS PROC. Pilot. P2.oc- ME AtJS. Ci+.\.,t.t\ {oy «(0""''" "OUS ) F~EQ. \keel. fo (OM p"te cbsty'.ptl\'t.

Prices exclude Freight and GST Page 1 of 9. Range Group Image (not to scale) Part Number Description Retail

2 b. 3 Use the chain rule to find the gradient:

Topics in Analytic Geometry

SSC TIER II (MATHS) MOCK TEST - 21 (SOLUTION)

Algebra II Notes Unit Ten: Conic Sections

Cameras. Importance of camera models

cisc1110 fall 2010 lecture VI.2 call by value function parameters another call by value example:

1 Finding Trigonometric Derivatives

8.3 INTEGRATION BY PARTS

MAC 1147 Exam #6 Review

AIR FORCE STANDARD DESIGN RPA SQUADRON OPERATIONS

Today s class. Geometric objects and transformations. Informationsteknologi. Wednesday, November 7, 2007 Computer Graphics - Class 5 1

CS 450: COMPUTER GRAPHICS RAY TRACING SPRING 2016 DR. MICHAEL J. REALE

Right Triangle Trigonometry

WebAssign Lesson 1-3a Substitution Part 1 (Homework)

Modeling Transformations Revisited

S71WS-N. Stacked Multi-Chip Product (MCP) 1.8 Volt-only Simultaneous Read/Write, Burst-mode Flash Memory with CellularRAM

Unhiding Redundancy in SAT

Chapter 8: Right Triangle Trigonometry

PA5: Last Hints on Symbol Table: Other Info to Keep

Coordinate Frames and Transforms

The Network Layer: Routing Algorithms. The Network Layer: Routing & Addressing Outline

CPSC 826 Internetworking. The Network Layer: Routing & Addressing Outline. The Network Layer: Routing Algorithms. Routing Algorithms Taxonomy

(i) h(7,8,24) (ii) h(6,5,6) (iii) h( 7,8,9) (iv) h(10,9, 16) (iv) g 3,32 8

Lesson 11 MA Nick Egbert

2D Image Transforms Computer Vision (Kris Kitani) Carnegie Mellon University

Undecidability of bounded security protocols

Homework No. 6 (40 points). Due on Blackboard before 8:00 am on Friday, October 13th.

H SERIES. Percentage Basics. Curriculum Ready.

English Bible for the Deaf

Find the distance between each pair of points. Write your answer in simplest radical form.

CS 188: Artificial Intelligence Fall 2008

Math 35 Review Sheet, Spring 2014

Math 2201 Unit 3: Acute Triangle Trigonometry. Ch. 3 Notes

TMCH Report March February 2017

Transcription:

Oriw Ro Jnow Mon, Sptmr 2, 24 si mtri oprtions (, -, *) Cross n ot prouts Dtrminnts n inrss Homonous oorints Ortonorml sis itionl Rsours 8.6 Tt ook 6.837 Tt ook 6.837-stff@rpis.sil.mit.u Ck t ours wsit for op of ts nots Wt is Mtri? mtri is st of lmnts, orni into rows n olumns m n mtri n olumns m rows si Oprtions si Oprtions Trnspos: Swp rows wit olumns M f i M T f i V V T [ ] ition n Sutrtion f f f f Just lmnts Just sutrt lmnts - - -

Multiplition si Oprtions Multiplition Is? M, ut m not! f f f Multipl row olumn f......... f f......... n m n n multipli n n p mtri to il n m p rsult Hs up: multiplition is NOT ommutti! Vtor Oprtions Vtor Intrprttion Vtor: n mtri Intrprttion: point or lin in n-imnsionl sp Dot Prout, Cross Prout, n Mnitu fin on tors onl r Tink of tor s lin in 2D or 3D Tink of mtri s trnsformtion on lin or st of lins ' ' V V Vtors: Dot Prout Vtors: Dot Prout Intrprttion: t ot prout msurs to wt r two tors r lin T f [ ] f Tink of t ot prout s mtri multiplition If n lnt θ os θ 2 T os(θ ) T mnitu is t ot prout of tor wit itslf T ot prout is lso rlt to t nl twn t two tors 2

Vtors: Cross Prout T ross prout of tors n is tor C wi is priulr to n T mnitu of C is proportionl to t sin of t nl twn n T irtion of C follows t rit n rul if w r workin in rit-n oorint sstm sin(θ ) Vtors: Cross Prout T ross-prout n omt s spill onstrut trminnt iˆ ˆj kˆ Inrs of Mtri Dtrminnt of Mtri Intit mtri: I Som mtris n inrs, su tt: - I Inrsion is trik: (C) - C - - - Dri from nonommuttiit proprt I Us for inrsion If t(), tn s no inrs Cn foun usin ftorils, piots, n oftors! Lots of intrprttions for mor info, tk 8.6 t( ) Dtrminnt of Mtri Inrs of Mtri f i f f i i f i f i f i For 3 3 mtri: Sum from lft to rit Sutrt from rit to lft Not: In t nrl s, t trminnt s n! trms f i. p t intit mtri to 2. Sutrt multipls of t otr rows from t first row to ru t ionl lmnt to 3. Trnsform t intit mtri s ou o 4. Wn t oriinl mtri is t intit, t intit s om t inrs! 3

Homonous Mtris Prolm: ow to inlu trnsltions in trnsformtions (n o prspti trnsforms) Solution: n tr imnsion ' ' ' 2 2 2 2 22 t t t Ortonorml sis sis: sp is totll fin st of tors n point is linr omintion of t sis Ortoonl: ot prout is ro Norml: mnitu is on Ortonorml: ortoonl norml Most ommon Empl: ˆ, ˆ, ˆ Cn of Ortonorml sis Cn of Ortonorml sis Gin: oorint frms n un point p (p, p, p) Fin: p (, p, ) n p u u p u. u. u.. u (. u) u (. u) u (. u) u n (. ) (. ) (. ) u (. n) n (. n) n (. n) n Cn of Ortonorml sis Cn of Ortonorml sis (. u) u (. u) u (. u) u (. ) (. ) (. ) (. n) n (. n) n (. n) n p (. u) u p [ (. u) u p [ (. u) u p [ (. ) (. ) (. ) (. n) n ] (. n) n ] (. n) n ] Sustitut into qution for p: p (p, p, p) p p p p p [ (. u) u p [ (. u) u p [ (. u) u (. ) (. ) (. ) (. n) n (. n) n (. n) n ] ] ] Rwrit: p [ p (. u) [ p (. ) [ p (. n) p (. u) p (. ) p (. n) p (. u) ] u p (. ) ] p (. n) ] n 4

Cn of Ortonorml sis Cn of Ortonorml sis p [ p (. u) [ p (. ) [ p (. n) p (. u) p (. ) p (. n) p (. u) ] u p (. ) ] p (. n) ] n p p (. u) p (. ) p (. n) p (. u) p (. ) p (. n) p (. u) p (. ) p (. n) p (, p, ) u p n Eprss in un sis: p p (. u) p (. ) p (. n) p (. u) p (. ) p (. n) p (. u) p (. ) p (. n) In mtri form: p u n u n u n p p p wr: u. u u. u t. Cn of Ortonorml sis Cts p Wt's M -, t inrs? p p p u u u p p n n n p u n u n p u n M p p p u. u u. u M - M T Rit-n s. lft-n oorint sstms OGL is rit-n Row-mjor s. olumn-mjor mtri stor. mtri. uss row-mjor orr OGL uss olumn-mjor orr 2 3 4 5 6 7 8 9 2 3 4 5 row-mjor 4 8 2 5 9 3 2 6 4 3 7 5 olumn-mjor Qustions?? 5