The Affine Group of Transformations
|
|
- Mildred Wells
- 5 years ago
- Views:
Transcription
1 The Affine Group of Transformations Kenneth H. Carpenter Department of Electrical and Computer Engineering Kansas State University February 26, 1997 (revised September 20, 2001) 1 Introduction The affine group is a set of transformations in space that leave straight lines as straight lines. (These can be thought of as transformations of the coordinate system, leaving the objects unchanged, or as transformations of the objects, leaving the coordinate system unchanged. We shall take the latter viewpoint, since it is the one most closely associated with computer graphics.) Since one such transformation followed by another results in straight lines going to straight lines going to straight lines, the result of two affine transformations in succession is a third affine transformation. Further, one can reverse any such transformation, to get back to the original lines, so each affine transformation has an inverse transformation. This is all that is required to form a group in mathematics: set of objects: the transformations themselves equivalence relation: two transformations are equivalent if they each transform any specific line into the same new line operation: performing first one transformation then another yields a third satisfies the group postulates: If a, b, c,... are group members and is the operation, then 1. Closure: a b = c (result of operation is in the set - true for affine transformations) 2. Identity: There is an element i such that a i = a for all a (the identity transformation is to do nothing!) 3. Inverses: For every a there must be a b such that a b = i (true for affine transformations - just reverse what was done) 4. Associativity: a (b c) = (a b) c (This is not as obvious, but will be shown later to be true for affine transformations.) Since affine transformations form a group, group theory shows that there exist matrix representations for the group that is, there is a group of matrices that follows the same rules as the group, with the matrices being the group members, and the operation being matrix multiplication. We will find and use one or more of these representations. 2 The analytic geometry of affine transformations Let the usual notation of x, y, z for the rectangular coordinates of points in three-dimensional space be replaced by x 1, x 2, x 3. Then we can refer to a general coordinate as x i where i = 1, 2, or 3. (Note that x 3 does not mean x cubed any more! When we want powers of the x i we have to use parentheses like this: (x 2 ) 3.) 1
2 Affine Transformations - K. H. Carpenter - 20SEP01 2 A general transformation of the points of an object replaces the x i representing a point in space with a new set y i related to the original by three functions of three variables: y i = f i (x j ). (1) We now inquire what restrictions must be placed on these functions for the transformations to be affine. But first we must find a way to represent a straight line. 2.1 Straight lines in parametric form The simplest way to represent a curve in multiple dimensions is by a set of parametric equations, one for each dimension: x i = g i (t), (2) where t is the parameter. Now we can take the differential of eq.(2) to obtain dx i = (dg i /dt)dt. For the curve to be a straight line the ratios dx i /dx j must be the same for all t. This will be true if each dg i /dt is a constant for all t. Hence one way we can express the parametric functions of any straight line is 2.2 Affine transformations in terms of parametric straight lines x i = g i (t) = α i t + β i. (3) Since the result of affine transforming a straight line must be another straight line, and since any straight line can be written in the form of eq.(3), the functions of the transformation must yield f i (α j t + β j ) = γ i t + δ i. (4) Since d f i /dt = γ i, f i can contain only first powers of t, and hence only first powers of the x j. We can thus write y i = f i (x j ) = (r i j x j ) + s i = [r i j (α j t + β j )] + s i. (5) j where the r i j and the si are the constants that specify the transformation. The r i j values are not entirely arbitrary. Since the inverse transformation must exist (for the affine transformations to form a group), the matrix of the r i j s must have an inverse, hence its determinant must be non-zero. 2.3 Affine transformations retain parallel properties As a corollary to affine transformations being linear, parallel lines subject to the same transformation, remain parallel, and lines that are not parallel before transformation are not parallel after. Parallel lines in the parametric form of eq.(3) have the same α i values but different β i values. From eq.(5) and eq.(4) it can be seen that two parallel lines, after the same transformation, will have the same γ i values but different δ i values and hence be parallel. The proof of the converse is left as an exercise for the reader. j
3 Affine Transformations - K. H. Carpenter - 20SEP The group operation successive transformations 3.1 From the viewpoint of analytic geometry The constants in eq.(5) represent rotations and translations along with possible scaling and reflection. These operations are illustrated in chapter 4 of the text by Angel[1]. Let ra i j and si a represent the r and s constants for the a transformation; similarly define the constants for the b transformation. Then successive transformations yields a new transformation c where the constants of c are given by rc i j = rbk i rk a j (6) k s i c = ( rbk i sk a) + s i b. (7) k This can be recognized as the component form of matrix multiplication between rotation matrices R b and R a along with translation vectors S a and S b. In general, the R matrix contains scale factors, inversions, and shears, as well as rotations. When a transformation is a pure rotation, then S = 0 and the inverse of R is its transpose. When scaling occurs the determinant of R has a magnitude other than one, and when reflection occurs the determinant of R is negative. 3.2 From the viewpoint of a matrix representation of the group The two sets of constants that make up the R matrix and S vector for a transformation may be combined into a single square matrix T as R S T =. (8) 0 1 The vector S is appended on the right to the matrix R and a fourth row is made up of zeros and a single one at the lower right. Now T c = T b T a, and matrix multiplication is isomorphic to successive transformations, with the first transformation being on the right in the product. Since matrix multiplication is associative, we see that the requirement for associativity of the transformations is met. 4 Homogeneous coordinates With the transformation matrix defined as the T of eq.(8), it is possible to express the change of coordinates on transformation by a single matrix multiplication, if the vector of coordinates is extended to be the fourdimensional X: X = wx 1 wx 2 wx 3 w, (9) where w is any non-zero constant. An obvious choice is w = 1. With such a definition for X and a similar one for the vector Y that results from a transformation, we have Y = T X.
4 Affine Transformations - K. H. Carpenter - 20SEP Primitive transformations Any transformation may be expressed by a product of simpler, primitive transformations. The choice of primitive transformations is somewhat arbitrary. In three dimensions, one can show that any rotation is the product of three rotations. Translations can always be separated from rotations. For more general situations, involving scaling and shearing, the choice of primitives is not so simple. In the following it will be shown that any two-dimensional R can be replaced by a sequence of two-dimensional rotations and scalings. 5.1 Repeated transformations leave the R part a product of R parts From eq.(8), one sees the separation of a general transformation matrix into a translation part S and a generalized rotation part R. If one multiplies together two such matrices, the R part of the product will be the product of the R parts of the two being multiplied. This continues for any number of transformations. The R parts affect the S parts applied earlier, but the S parts have no effect on the final R part. Thus any transformation could have all its primitives consist of R parts only, except for the last one applied. 5.2 Case of shear For a shear primitive, the transformation has a zero S part and a R part that is the identity matrix with one nondiagonal element replaced by a non-zero value. Since shear is inherently two-dimensional, let us consider only a two-by-two matrix of shear and how it may be broken into other two-by-two matrices representing rotations and scalings. The general form of a two-dimensional rotation matrix is [ ] cos θ sin θ U(θ) =. (10) sin θ cos θ The general form of a shear along x is The general form of a scaling is W = K = [ 1 h 0 1 [ a 0 0 b ]. (11) ]. (12) By multiplying out and forming four scalar equations, one can show that it is not possible to find θ 1, θ 2, a, and b such that W = U(θ 1 )KU(θ 2 ). It is possible to represent a shear as a sequence of rotations and scalings, however. One must use three scalings and two rotations (of unequal magnitudes). There are several possibilities. One possible choice is W = K 1 U(π/6)K 2 U( π/4)k 3 where the elements of K i are a i and b i and a 1 = 3/ 2, b 1 = 1/(h 2), a 2 = a 3 = 1, b 2 = 1/ 3, and b 3 = 2h. 5.3 Minimum number of primitives to represent a transformation A general, non-singular, two-by-two matrix can be represented by a product of three two-by-two matrices, where the three are taken from the special cases of pure rotation, scaling, and shear. Specifically [ ] α γ α β = α γ δ 2 +γ 2 α 2 +γ α 2 + γ 2 αβ+γδ αδ βγ α 0 2 +γ 2 α 2 +γ 2 0 1, (13) γ α 2 +γ 2 α α 2 +γ 2 which is a valid expansion of a general matrix into the product of a rotation, a scaling, and a shear. (The determinant of the matrix is not zero by assumption.)
5 Affine Transformations - K. H. Carpenter - 20SEP01 5 Since, from section 5.2, any shear may be represented by products of rotations and scalings, any twodimensional matrix may be represented by a sequence of rotations and scalings, although there may have to be several rotations and scalings. 5.4 Extension to three dimensions One can show that any three dimensional affine transformation has a matrix form in terms of translation, rotation, scaling, and shearing as I S R 0 D 0 H 0 T =. (14) where the vector S contains the three components of a translation, the R 3 3 matrix represents a rotation such that R T = R 1 and R = 1, the D matrix is diagonal and contains the scalings and reflections, and the H matrix is upper triangular with ones on the diagonal and contains the shearings along the three axes. Since the H matrix may be written as a product of three matrices each having a shear along a single direction, and since each of these single shears may be expressed as the product of three scalings and two rotations, the entire affine transformation may be presented as a set of translations, scalings, and rotations. (The separation of any general matrix into the product of a rotation matrix and an upper triangular matrix is called QR factorization[2].) 6 Conclusions Any possible affine transformation (an invertible transformation in which all straight lines remain straight lines) may be represented by a matrix, which for three-dimensional space, is 4 by 4, has the last row as three zeros followed by a single one and otherwise consists of arbitrary real numbers (except for the restriction that the submatrix R made up of the first three rows and columns has an inverse). Any affine transformation can be decomposed into a series of rotations about three axes, translations, and scalings. The rotations are subsets of the R submatrices which have an inverse equal to the transpose and a determinant equal to one. The scalings are subsets of the R submatrices that are diagonal (with negative elements for reflections). The translations are the submatrices S. References [1] Edward Angel, Interactive Computer Graphics : A top-down approach with OpenGL, Addison-Wesley, Reading, Massachusetts, [2] David Kahaner, Cleve Moler, Stephen Nash, Numerical Methods and Software, Prentice Hall, 1989.
Lecture 8: Coordinate Frames. CITS3003 Graphics & Animation
Lecture 8: Coordinate Frames CITS3003 Graphics & Animation E. Angel and D. Shreiner: Interactive Computer Graphics 6E Addison-Wesley 2012 Objectives Learn how to define and change coordinate frames Introduce
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Chemistry 5.76 Revised February, 1982 NOTES ON MATRIX METHODS
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Chemistry 5.76 Revised February, 198 NOTES ON MATRIX METHODS 1. Matrix Algebra Margenau and Murphy, The Mathematics of Physics and Chemistry, Chapter 10, give almost
More informationChapter 3. Determinants and Eigenvalues
Chapter 3. Determinants and Eigenvalues 3.1. Determinants With each square matrix we can associate a real number called the determinant of the matrix. Determinants have important applications to the theory
More informationANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3
ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3 ISSUED 24 FEBRUARY 2018 1 Gaussian elimination Let A be an (m n)-matrix Consider the following row operations on A (1) Swap the positions any
More informationDeterminant: 3.2 Evaluation of Determinant with Elementary
Determinant: 3.2 Evaluation of Determinant with Elementary Operations September 18 As far as the laws of mathematics refer to reality, they are not certain; and as far as they are certain, they do not
More informationAll of my class notes can be found at
My name is Leon Hostetler I am currently a student at Florida State University majoring in physics as well as applied and computational mathematics Feel free to download, print, and use these class notes
More informationMultiplying matrices by diagonal matrices is faster than usual matrix multiplication.
7-6 Multiplying matrices by diagonal matrices is faster than usual matrix multiplication. The following equations generalize to matrices of any size. Multiplying a matrix from the left by a diagonal matrix
More informationIntroduction to Determinants
Introduction to Determinants For any square matrix of order 2, we have found a necessary and sufficient condition for invertibility. Indeed, consider the matrix The matrix A is invertible if and only if.
More information30.3. LU Decomposition. Introduction. Prerequisites. Learning Outcomes
LU Decomposition 30.3 Introduction In this Section we consider another direct method for obtaining the solution of systems of equations in the form AX B. Prerequisites Before starting this Section you
More informationCSE4030 Introduction to Computer Graphics
CSE4030 Introduction to Computer Graphics Dongguk University Jeong-Mo Hong Week 5 Living in a 3 dimensional world II Geometric coordinate in 3D How to move your cubes in 3D Objectives Introduce concepts
More information1 Matrices and matrix algebra
1 Matrices and matrix algebra 1.1 Examples of matrices A matrix is a rectangular array of numbers and/or variables. For instance 4 2 0 3 1 A = 5 1.2 0.7 x 3 π 3 4 6 27 is a matrix with 3 rows and 5 columns
More informationChapter 4. Determinants
4.2 The Determinant of a Square Matrix 1 Chapter 4. Determinants 4.2 The Determinant of a Square Matrix Note. In this section we define the determinant of an n n matrix. We will do so recursively by defining
More informationLecture 16: 9.2 Geometry of Linear Operators
Lecture 16: 9.2 Geometry of Linear Operators Wei-Ta Chu 2008/11/19 Theorem 9.2.1 If T: R 2 R 2 is multiplication by an invertible matrix A, then the geometric effect of T is the same as an appropriate
More informationMATH 583A REVIEW SESSION #1
MATH 583A REVIEW SESSION #1 BOJAN DURICKOVIC 1. Vector Spaces Very quick review of the basic linear algebra concepts (see any linear algebra textbook): (finite dimensional) vector space (or linear space),
More informationCSC 470 Introduction to Computer Graphics. Mathematical Foundations Part 2
CSC 47 Introduction to Computer Graphics Mathematical Foundations Part 2 Vector Magnitude and Unit Vectors The magnitude (length, size) of n-vector w is written w 2 2 2 w = w + w2 + + w n Example: the
More informationTransformations. Chapter D Transformations Translation
Chapter 4 Transformations Transformations between arbitrary vector spaces, especially linear transformations, are usually studied in a linear algebra class. Here, we focus our attention to transformation
More informationOctober 25, 2013 INNER PRODUCT SPACES
October 25, 2013 INNER PRODUCT SPACES RODICA D. COSTIN Contents 1. Inner product 2 1.1. Inner product 2 1.2. Inner product spaces 4 2. Orthogonal bases 5 2.1. Existence of an orthogonal basis 7 2.2. Orthogonal
More informationMATH 213 Linear Algebra and ODEs Spring 2015 Study Sheet for Midterm Exam. Topics
MATH 213 Linear Algebra and ODEs Spring 2015 Study Sheet for Midterm Exam This study sheet will not be allowed during the test Books and notes will not be allowed during the test Calculators and cell phones
More informationMATRICES. knowledge on matrices Knowledge on matrix operations. Matrix as a tool of solving linear equations with two or three unknowns.
MATRICES After studying this chapter you will acquire the skills in knowledge on matrices Knowledge on matrix operations. Matrix as a tool of solving linear equations with two or three unknowns. List of
More informationMATH 2030: MATRICES ,, a m1 a m2 a mn If the columns of A are the vectors a 1, a 2,...,a n ; A is represented as A 1. .
MATH 030: MATRICES Matrix Operations We have seen how matrices and the operations on them originated from our study of linear equations In this chapter we study matrices explicitely Definition 01 A matrix
More informationReview of Linear Algebra Definitions, Change of Basis, Trace, Spectral Theorem
Review of Linear Algebra Definitions, Change of Basis, Trace, Spectral Theorem Steven J. Miller June 19, 2004 Abstract Matrices can be thought of as rectangular (often square) arrays of numbers, or as
More information22.3. Repeated Eigenvalues and Symmetric Matrices. Introduction. Prerequisites. Learning Outcomes
Repeated Eigenvalues and Symmetric Matrices. Introduction In this Section we further develop the theory of eigenvalues and eigenvectors in two distinct directions. Firstly we look at matrices where one
More informationUNIT 3 MATRICES - II
Algebra - I UNIT 3 MATRICES - II Structure 3.0 Introduction 3.1 Objectives 3.2 Elementary Row Operations 3.3 Rank of a Matrix 3.4 Inverse of a Matrix using Elementary Row Operations 3.5 Answers to Check
More informationLectures on Linear Algebra for IT
Lectures on Linear Algebra for IT by Mgr. Tereza Kovářová, Ph.D. following content of lectures by Ing. Petr Beremlijski, Ph.D. Department of Applied Mathematics, VSB - TU Ostrava Czech Republic 11. Determinants
More information1 Differentiable manifolds and smooth maps. (Solutions)
1 Differentiable manifolds and smooth maps Solutions Last updated: February 16 2012 Problem 1 a The projection maps a point P x y S 1 to the point P u 0 R 2 the intersection of the line NP with the x-axis
More information7.4. The Inverse of a Matrix. Introduction. Prerequisites. Learning Outcomes
The Inverse of a Matrix 7.4 Introduction In number arithmetic every number a 0has a reciprocal b written as a or such that a ba = ab =. Similarly a square matrix A may have an inverse B = A where AB =
More informationAppendix Composite Point Rotation Sequences
Appendix Composite Point Rotation Sequences A. Euler Rotations In Chap. 6 we considered composite Euler rotations comprising individual rotations about the x, y and z axes such as R γ,x R β,y R α,z and
More informationApplications of Singular-Value Decomposition (SVD)
Applications of Singular-Value Decomposition (SVD Alkiviadis G Akritas and Gennadi I Malaschonok Summer 00 Abstract Let A be an m n matrix with m n Then one form of the singular-value decomposition of
More informationRepeated Eigenvalues and Symmetric Matrices
Repeated Eigenvalues and Symmetric Matrices. Introduction In this Section we further develop the theory of eigenvalues and eigenvectors in two distinct directions. Firstly we look at matrices where one
More informationMAT 2037 LINEAR ALGEBRA I web:
MAT 237 LINEAR ALGEBRA I 2625 Dokuz Eylül University, Faculty of Science, Department of Mathematics web: Instructor: Engin Mermut http://kisideuedutr/enginmermut/ HOMEWORK 2 MATRIX ALGEBRA Textbook: Linear
More informationREPLACE ONE ROW BY ADDING THE SCALAR MULTIPLE OF ANOTHER ROW
20 CHAPTER 1 Systems of Linear Equations REPLACE ONE ROW BY ADDING THE SCALAR MULTIPLE OF ANOTHER ROW The last type of operation is slightly more complicated. Suppose that we want to write down the elementary
More information1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )
Direct Methods for Linear Systems Chapter Direct Methods for Solving Linear Systems Per-Olof Persson persson@berkeleyedu Department of Mathematics University of California, Berkeley Math 18A Numerical
More informationLecture Summaries for Linear Algebra M51A
These lecture summaries may also be viewed online by clicking the L icon at the top right of any lecture screen. Lecture Summaries for Linear Algebra M51A refers to the section in the textbook. Lecture
More informationLecture Notes in Linear Algebra
Lecture Notes in Linear Algebra Dr. Abdullah Al-Azemi Mathematics Department Kuwait University February 4, 2017 Contents 1 Linear Equations and Matrices 1 1.2 Matrices............................................
More informationThe word Matrices is the plural of the word Matrix. A matrix is a rectangular arrangement (or array) of numbers called elements.
Numeracy Matrices Definition The word Matrices is the plural of the word Matrix A matrix is a rectangular arrangement (or array) of numbers called elements A x 3 matrix can be represented as below Matrix
More informationEigenvalues and Eigenvectors
Contents Eigenvalues and Eigenvectors. Basic Concepts. Applications of Eigenvalues and Eigenvectors 8.3 Repeated Eigenvalues and Symmetric Matrices 3.4 Numerical Determination of Eigenvalues and Eigenvectors
More informationNumerical Linear Algebra
Numerical Linear Algebra By: David McQuilling; Jesus Caban Deng Li Jan.,31,006 CS51 Solving Linear Equations u + v = 8 4u + 9v = 1 A x b 4 9 u v = 8 1 Gaussian Elimination Start with the matrix representation
More informationChapter 1: Linear Equations
Chapter : Linear Equations (Last Updated: September, 6) The material for these notes is derived primarily from Linear Algebra and its applications by David Lay (4ed).. Systems of Linear Equations Before
More informationNATIONAL BOARD FOR HIGHER MATHEMATICS. M. A. and M.Sc. Scholarship Test. September 17, Time Allowed: 150 Minutes Maximum Marks: 30
NATIONAL BOARD FOR HIGHER MATHEMATICS M. A. and M.Sc. Scholarship Test September 17, 2016 Time Allowed: 150 Minutes Maximum Marks: 30 Please read, carefully, the instructions that follow INSTRUCTIONS TO
More informationMatrices and Quaternions. Gary D. Simpson. rev 00 Mar 01, Summary
Matrices and Quaternions Gary D. Simpson gsim100887@aol.com rev 00 Mar 01, 2014 Summary A possibly novel mathematical structure is presented. The structure is a matrix whose elements are quaternions. The
More informationProperties of Transformations
6. - 6.4 Properties of Transformations P. Danziger Transformations from R n R m. General Transformations A general transformation maps vectors in R n to vectors in R m. We write T : R n R m to indicate
More informationGeometric Image Manipulation
Bruce A. Draper J. Ross Beveridge, January 24, 204 Geometric Image Manipulation Lecture (part a) January 24, 204 Bruce A. Draper J. Ross Beveridge, January 24, 204 Status Update Programming assignment
More informationLINEAR SYSTEMS AND MATRICES
CHAPTER 3 LINEAR SYSTEMS AND MATRICES SECTION 3. INTRODUCTION TO LINEAR SYSTEMS This initial section takes account of the fact that some students remember only hazily the method of elimination for and
More informationMTH 464: Computational Linear Algebra
MTH 464: Computational Linear Algebra Lecture Outlines Exam 2 Material Prof. M. Beauregard Department of Mathematics & Statistics Stephen F. Austin State University February 6, 2018 Linear Algebra (MTH
More informationComponents and change of basis
Math 20F Linear Algebra Lecture 16 1 Components and change of basis Slide 1 Review: Isomorphism Review: Components in a basis Unique representation in a basis Change of basis Review: Isomorphism Definition
More information[ Here 21 is the dot product of (3, 1, 2, 5) with (2, 3, 1, 2), and 31 is the dot product of
. Matrices A matrix is any rectangular array of numbers. For example 3 5 6 4 8 3 3 is 3 4 matrix, i.e. a rectangular array of numbers with three rows four columns. We usually use capital letters for matrices,
More informationElementary Row Operations on Matrices
King Saud University September 17, 018 Table of contents 1 Definition A real matrix is a rectangular array whose entries are real numbers. These numbers are organized on rows and columns. An m n matrix
More informationMath 3C Lecture 20. John Douglas Moore
Math 3C Lecture 20 John Douglas Moore May 18, 2009 TENTATIVE FORMULA I Midterm I: 20% Midterm II: 20% Homework: 10% Quizzes: 10% Final: 40% TENTATIVE FORMULA II Higher of two midterms: 30% Homework: 10%
More informationChapter 1: Linear Equations
Chapter : Linear Equations (Last Updated: September, 7) The material for these notes is derived primarily from Linear Algebra and its applications by David Lay (4ed).. Systems of Linear Equations Before
More informationEE731 Lecture Notes: Matrix Computations for Signal Processing
EE731 Lecture Notes: Matrix Computations for Signal Processing James P. Reilly c Department of Electrical and Computer Engineering McMaster University September 22, 2005 0 Preface This collection of ten
More informationLinear Algebra 1 Exam 1 Solutions 6/12/3
Linear Algebra 1 Exam 1 Solutions 6/12/3 Question 1 Consider the linear system in the variables (x, y, z, t, u), given by the following matrix, in echelon form: 1 2 1 3 1 2 0 1 1 3 1 4 0 0 0 1 2 3 Reduce
More informationAlgebra I Fall 2007
MIT OpenCourseWare http://ocw.mit.edu 18.701 Algebra I Fall 007 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.701 007 Geometry of the Special Unitary
More informationIntroduction to Quantitative Techniques for MSc Programmes SCHOOL OF ECONOMICS, MATHEMATICS AND STATISTICS MALET STREET LONDON WC1E 7HX
Introduction to Quantitative Techniques for MSc Programmes SCHOOL OF ECONOMICS, MATHEMATICS AND STATISTICS MALET STREET LONDON WC1E 7HX September 2007 MSc Sep Intro QT 1 Who are these course for? The September
More informationLinear Algebra. Min Yan
Linear Algebra Min Yan January 2, 2018 2 Contents 1 Vector Space 7 1.1 Definition................................. 7 1.1.1 Axioms of Vector Space..................... 7 1.1.2 Consequence of Axiom......................
More informationSAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 1 Introduction to Linear Algebra
1.1. Introduction SAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 1 Introduction to Linear algebra is a specific branch of mathematics dealing with the study of vectors, vector spaces with functions that
More informationA matrix over a field F is a rectangular array of elements from F. The symbol
Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted
More informationChapter 1: Systems of Linear Equations
Chapter : Systems of Linear Equations February, 9 Systems of linear equations Linear systems Lecture A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where
More information3.2 Gaussian Elimination (and triangular matrices)
(1/19) Solving Linear Systems 3.2 Gaussian Elimination (and triangular matrices) MA385/MA530 Numerical Analysis 1 November 2018 Gaussian Elimination (2/19) Gaussian Elimination is an exact method for solving
More informationLecture 7: Vectors and Matrices II Introduction to Matrices (See Sections, 3.3, 3.6, 3.7 and 3.9 in Boas)
Lecture 7: Vectors and Matrices II Introduction to Matrices (See Sections 3.3 3.6 3.7 and 3.9 in Boas) Here we will continue our discussion of vectors and their transformations. In Lecture 6 we gained
More informationLecture 7 and 8. Fall EE 105, Feedback Control Systems (Prof. Khan) September 30 and October 05, 2015
1 Lecture 7 and 8 Fall 2015 - EE 105, Feedback Control Systems (Prof Khan) September 30 and October 05, 2015 I CONTROLLABILITY OF AN DT-LTI SYSTEM IN k TIME-STEPS The DT-LTI system is given by the following
More informationChapter 2: Matrix Algebra
Chapter 2: Matrix Algebra (Last Updated: October 12, 2016) These notes are derived primarily from Linear Algebra and its applications by David Lay (4ed). Write A = 1. Matrix operations [a 1 a n. Then entry
More informationLinear Algebra Section 2.6 : LU Decomposition Section 2.7 : Permutations and transposes Wednesday, February 13th Math 301 Week #4
Linear Algebra Section. : LU Decomposition Section. : Permutations and transposes Wednesday, February 1th Math 01 Week # 1 The LU Decomposition We learned last time that we can factor a invertible matrix
More information(1) for all (2) for all and all
8. Linear mappings and matrices A mapping f from IR n to IR m is called linear if it fulfills the following two properties: (1) for all (2) for all and all Mappings of this sort appear frequently in the
More informationOn the quantum theory of rotating electrons
Zur Quantentheorie des rotierenden Elektrons Zeit. f. Phys. 8 (98) 85-867. On the quantum theory of rotating electrons By Friedrich Möglich in Berlin-Lichterfelde. (Received on April 98.) Translated by
More informationPRACTICE PROBLEMS (TEST I).
6 Calculus III for CS Spring PRACTICE PROBLEMS (TEST I). MATERIAL: Chapter from Salas-Hille-Etgen, Sections,, 3, 4, 5, 6 from the [Notes:Th], Chapters,, 3, 4 from [Demko] (most of it is covered in more
More informationOR MSc Maths Revision Course
OR MSc Maths Revision Course Tom Byrne School of Mathematics University of Edinburgh t.m.byrne@sms.ed.ac.uk 15 September 2017 General Information Today JCMB Lecture Theatre A, 09:30-12:30 Mathematics revision
More informationSolutions to Midterm 2 Practice Problems Written by Victoria Kala Last updated 11/10/2015
Solutions to Midterm 2 Practice Problems Written by Victoria Kala vtkala@math.ucsb.edu Last updated //25 Answers This page contains answers only. Detailed solutions are on the following pages. 2 7. (a)
More informationMatrices and Linear Algebra
Contents Quantitative methods for Economics and Business University of Ferrara Academic year 2017-2018 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2
More informationMatrix Algebra: Definitions and Basic Operations
Section 4 Matrix Algebra: Definitions and Basic Operations Definitions Analyzing economic models often involve working with large sets of linear equations. Matrix algebra provides a set of tools for dealing
More informationLinear Algebra. and
Instructions Please answer the six problems on your own paper. These are essay questions: you should write in complete sentences. 1. Are the two matrices 1 2 2 1 3 5 2 7 and 1 1 1 4 4 2 5 5 2 row equivalent?
More informationMath 240 Calculus III
The Calculus III Summer 2015, Session II Wednesday, July 8, 2015 Agenda 1. of the determinant 2. determinants 3. of determinants What is the determinant? Yesterday: Ax = b has a unique solution when A
More informationCovariant Formulation of Electrodynamics
Chapter 7. Covariant Formulation of Electrodynamics Notes: Most of the material presented in this chapter is taken from Jackson, Chap. 11, and Rybicki and Lightman, Chap. 4. Starting with this chapter,
More informationAffine transformations
Reading Required: Affine transformations Brian Curless CSEP 557 Fall 2016 Angel 3.1, 3.7-3.11 Further reading: Angel, the rest of Chapter 3 Fole, et al, Chapter 5.1-5.5. David F. Rogers and J. Alan Adams,
More informationNewtonian Mechanics. Chapter Classical space-time
Chapter 1 Newtonian Mechanics In these notes classical mechanics will be viewed as a mathematical model for the description of physical systems consisting of a certain (generally finite) number of particles
More informationLinear Algebra. Linear Equations and Matrices. Copyright 2005, W.R. Winfrey
Copyright 2005, W.R. Winfrey Topics Preliminaries Systems of Linear Equations Matrices Algebraic Properties of Matrix Operations Special Types of Matrices and Partitioned Matrices Matrix Transformations
More informationDeterminants. Recall that the 2 2 matrix a b c d. is invertible if
Determinants Recall that the 2 2 matrix a b c d is invertible if and only if the quantity ad bc is nonzero. Since this quantity helps to determine the invertibility of the matrix, we call it the determinant.
More informationc c c c c c c c c c a 3x3 matrix C= has a determinant determined by
Linear Algebra Determinants and Eigenvalues Introduction: Many important geometric and algebraic properties of square matrices are associated with a single real number revealed by what s known as the determinant.
More informationchapter 12 MORE MATRIX ALGEBRA 12.1 Systems of Linear Equations GOALS
chapter MORE MATRIX ALGEBRA GOALS In Chapter we studied matrix operations and the algebra of sets and logic. We also made note of the strong resemblance of matrix algebra to elementary algebra. The reader
More informationMath 344 Lecture # Linear Systems
Math 344 Lecture #12 2.7 Linear Systems Through a choice of bases S and T for finite dimensional vector spaces V (with dimension n) and W (with dimension m), a linear equation L(v) = w becomes the linear
More informationIntroduction to Group Theory
Chapter 10 Introduction to Group Theory Since symmetries described by groups play such an important role in modern physics, we will take a little time to introduce the basic structure (as seen by a physicist)
More informationElementary Linear Algebra
Matrices J MUSCAT Elementary Linear Algebra Matrices Definition Dr J Muscat 2002 A matrix is a rectangular array of numbers, arranged in rows and columns a a 2 a 3 a n a 2 a 22 a 23 a 2n A = a m a mn We
More informationCOMP 175 COMPUTER GRAPHICS. Lecture 04: Transform 1. COMP 175: Computer Graphics February 9, Erik Anderson 04 Transform 1
Lecture 04: Transform COMP 75: Computer Graphics February 9, 206 /59 Admin Sign up via email/piazza for your in-person grading Anderson@cs.tufts.edu 2/59 Geometric Transform Apply transforms to a hierarchy
More informationVectors and Matrices
Vectors and Matrices Scalars We often employ a single number to represent quantities that we use in our daily lives such as weight, height etc. The magnitude of this number depends on our age and whether
More informationCayley-Hamilton Theorem
Cayley-Hamilton Theorem Massoud Malek In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n Let A be an n n matrix Although det (λ I n A
More informationTI89 Titanium Exercises - Part 10.
TI89 Titanium Exercises - Part. Entering matrices directly in the HOME screen s entry line ) Enter your nxm matrix using this format: [[ a, a 2,,a m ][a 2, a 22, a 2m ] [a n, a n2,, a nm ]] This is a matrix
More informationInverses. Stephen Boyd. EE103 Stanford University. October 28, 2017
Inverses Stephen Boyd EE103 Stanford University October 28, 2017 Outline Left and right inverses Inverse Solving linear equations Examples Pseudo-inverse Left and right inverses 2 Left inverses a number
More informationMatrix operations Linear Algebra with Computer Science Application
Linear Algebra with Computer Science Application February 14, 2018 1 Matrix operations 11 Matrix operations If A is an m n matrix that is, a matrix with m rows and n columns then the scalar entry in the
More informationEquality: Two matrices A and B are equal, i.e., A = B if A and B have the same order and the entries of A and B are the same.
Introduction Matrix Operations Matrix: An m n matrix A is an m-by-n array of scalars from a field (for example real numbers) of the form a a a n a a a n A a m a m a mn The order (or size) of A is m n (read
More informationLecture 2: Linear Algebra Review
EE 227A: Convex Optimization and Applications January 19 Lecture 2: Linear Algebra Review Lecturer: Mert Pilanci Reading assignment: Appendix C of BV. Sections 2-6 of the web textbook 1 2.1 Vectors 2.1.1
More informationMatrix Operations: Determinant
Matrix Operations: Determinant Determinants Determinants are only applicable for square matrices. Determinant of the square matrix A is denoted as: det(a) or A Recall that the absolute value of the determinant
More informationSubmatrices and Partitioned Matrices
2 Submatrices and Partitioned Matrices Two very important (and closely related) concepts are introduced in this chapter that of a submatrix and that of a partitioned matrix. These concepts arise very naturally
More informationMATH Topics in Applied Mathematics Lecture 12: Evaluation of determinants. Cross product.
MATH 311-504 Topics in Applied Mathematics Lecture 12: Evaluation of determinants. Cross product. Determinant is a scalar assigned to each square matrix. Notation. The determinant of a matrix A = (a ij
More informationChapter 11. Special Relativity
Chapter 11 Special Relativity Note: Please also consult the fifth) problem list associated with this chapter In this chapter, Latin indices are used for space coordinates only eg, i = 1,2,3, etc), while
More informationLS.1 Review of Linear Algebra
LS. LINEAR SYSTEMS LS.1 Review of Linear Algebra In these notes, we will investigate a way of handling a linear system of ODE s directly, instead of using elimination to reduce it to a single higher-order
More informationMATH 2331 Linear Algebra. Section 2.1 Matrix Operations. Definition: A : m n, B : n p. Example: Compute AB, if possible.
MATH 2331 Linear Algebra Section 2.1 Matrix Operations Definition: A : m n, B : n p ( 1 2 p ) ( 1 2 p ) AB = A b b b = Ab Ab Ab Example: Compute AB, if possible. 1 Row-column rule: i-j-th entry of AB:
More informationCa Foscari University of Venice - Department of Management - A.A Luciano Battaia. December 14, 2017
Ca Foscari University of Venice - Department of Management - A.A.27-28 Mathematics Luciano Battaia December 4, 27 Brief summary for second partial - Sample Exercises Two variables functions Here and in
More informationMath 3108: Linear Algebra
Math 3108: Linear Algebra Instructor: Jason Murphy Department of Mathematics and Statistics Missouri University of Science and Technology 1 / 323 Contents. Chapter 1. Slides 3 70 Chapter 2. Slides 71 118
More informationPage 52. Lecture 3: Inner Product Spaces Dual Spaces, Dirac Notation, and Adjoints Date Revised: 2008/10/03 Date Given: 2008/10/03
Page 5 Lecture : Inner Product Spaces Dual Spaces, Dirac Notation, and Adjoints Date Revised: 008/10/0 Date Given: 008/10/0 Inner Product Spaces: Definitions Section. Mathematical Preliminaries: Inner
More information2 Constructions of manifolds. (Solutions)
2 Constructions of manifolds. (Solutions) Last updated: February 16, 2012. Problem 1. The state of a double pendulum is entirely defined by the positions of the moving ends of the two simple pendula of
More information