Discrete Convolution and the Discrete Fourier Transform


 Jerome Reynolds
 3 years ago
 Views:
Transcription
1 Discrete Convolution and the Discrete Fourier Transform Discrete Convolution First of all we need to introduce what we might call the wraparound convention Because the complex numbers w j e i πj N have the property w j±n w j, which readily extends to w j+mn w j for any integer m, and since in the discrete Fourier context we represent all Ndimensional vectors as linear combinations of the Fourier vectors W k whose components are w kj, we make the convention that for any vector Z E N with components z k, k,,,n, if we write z k with k lying outside the range through N whatismeantisz k+mn where m is the unique integer such that k + mn does lie in this range Thus, for example, if N 8 and we write z,whatwemeanisz + 8 z This convention may initially seem rather strange and arbitrary but, in fact, it is quite essential for effective use of and computation with the discrete Fourier transform Now suppose we have two real or complex vectors in E N : Z (z z z N ) t, Y (y y y N ) t The discrete convolution of these two vectors is another vector, which we denote by Z Y, defined componentwise by (Z Y ) k N j z k j y j, k,,, In making this definition we have to take into account the fact that if j > k the index k j will be negative According to the convention just introduced, what is meant instead of z k j is z k j+n Setting l k j we can see that (Z Y ) k N j z k j y j k N+ lk z l y k l N l y k l z l (Y Z) k,
2 the second inequality again following from the wraparound convention As a consequence we conclude that discrete convolution is commutative: Z Y Y Z Now we compute some discrete convolutions Example If Z ( ) t, then for any Y we have (Z Y ) k N j z k j y j y k because z k j when k j and equals when k j Thus the vector Z as shown here plays the role of the convolution identity Example If Z ( ) t, then for any Y we have (Z Y ) k N and thus with Z as shown j z k j y j N j y j s Y Z Y (s Y s Y s Y ) t (s Y )Z In particular, Z Z NZ in this case Example Let for N 5andlet Z ( ) t Y ( ) t for the same value of N; let us suppose the two s are in positions k and k + In this case we can verify that Z Y has the form Z Y ( ) t ; the effect of the convolution is to blur the two distinct s into the extended pattern shown
3 Just as the importance of the Laplace transform derives in large part from its behavior with respect to convolution of functions on [, ), the significance of the discrete Fourier transform also largely derives from its relationship to discrete convolution Theorem For any two Ndimensional complex vectors Z and Y we have F(Z Y )N F(Z) F(Y ) where the product F(Z) F(Y ) indicates the vector obtained with component by component multiplication; ie, (F(Z) F(Y )) k (F(Z)) k (F(Y )) k, the right hand side being the ordinary numerical product of complex numbers Proof We compute F(Z Y ) k N N j w kj (Z Y ) j N N j w kj ( N l z j l y l ) N N (setting m j l) N N l N j N l N l w kl y l ( N w k(j l) z j l w kl y l j w kl y l ( N l m l w k(j l) z j l ) (taking the wraparound effect into account) N ( N N l w kl y l )( N w km z m ) N m w km z m ) N (F(Y )) k (F(Z)) k (F(Y ) F(Z)) k,
4 which completes the proof Convolution Equations A (discrete) convolution equation is an equation of the form A Y B, wherea and B are known vectors in E N and Y is the vector in E N to be determined Such an equation is simply a linear algebraic equation of a special type If we define the N N matrix A a a N a N a a a a N a a a a a a N a N a N a whose first column is A and whose subsequent columns are rotations of A, one can easily see that the convolution product A Y is the same as the matrixvector product A Y and the convolution equation takes the form A Y B Then we have the following Proposition The convolution equation A Y B is solvable for arbitrary B E N (equivalently, the matrix A is nonsingular, so that A exists) if and only if the discrete Fourier transform of A has no zero components; ie, (F(A)) k, k,,,, N, From A Y B we obtain, taking the discrete Fourier trans Proof form, F(A Y )F(B) Using the result from Section on the discrete Fourier transform of a convolution product, this becomes N F(A) F(Y )F(B) Looking at the kth component on each side we have N (F(A)) k (F(Y )) k (F(B)) k, k,,,, N 4
5 If (F(A)) k foranyk then it is clear that the corresponding component, (F(B)) k,off(b) must also be zero and the convolution equation cannot be solved for arbitrary vectors B On the other hand, if all of the components of F(A) are different from zero, we simply divide to obtain (F(Y )) k (F(B)) k N (F(A)) k We will write this vectorially as F(Y ) F(B) F(A), N where the symbol will be used to indicate component by component division of the first vector by the second Then, applying the inverse transform, we have Y F ( F(B) F(A)) N This completes the proof of the proposition Solving Discrete Convolution Equations Example We consider the convolution equation in R 4 : Y The discrete Fourier transform solution method involves application of the discrete Fourier transform to both sides of this equation and use of the property F(A Y )N F(A) F(Y ) First of all, we have F(A) 4 i i i i 4 5 5
6 In this case none of the components of F(A) are zero so the solution process is a straightforward one Computing F(B) 4 i i i i + i i, and letting Z F(Y ), we have the equation F(A Y )4F(A) Z 5 z z z z + i i This is solved readily to give Z + i i Then, applying the inverse transform, we have Y F (Z) i i i i + i i The fact that the solution Y turns out to be the same as the original right hand side B is a coincidence particular to this example Example In this example the solution process is complicated by the fact that one of the components of F(A) turns out to be zero The convolution equation in question is 6 Y d 4 d 4 + d B + db, 6
7 where d is a parameter, initially undetermined Here we have F(A) 4 i i i i 6 i +i ; FB 4 i i i i 4 ; FB 4 i i i i 4 i 4 4 i 4 Since the transform is linear, letting Z F(Y ), we have 4 i +i z z z z + d 4 i 4 4 i 4 From examination of the component on both sides it is clear that we have to take d for consistency Then z is arbitrary and we have ( 8i) z i z 5 i 68 ; 8 z + z 8 ; ( +8i) z + i z 5+i 68 Then Y i i i i z 5 i i 68 z
8 Our next example shows that the discrete Fourier transform can be applied to solve, at least approximately, certain problems of classical mechanics The example also shows that zero components of F(A) are not just an inconvenience but may correspond to degrees of freedom in the solution of the convolution equation A Y B which we would quite naturally expect to find Example 4 A cable is strung between two vertical supporting structures of equal height and is displaced from the horizontal due to the effect of gravity acting on the cable Letting < x< be the parametrization in the horizontal direction and letting y(x) denote the vertical displacement of the cable, we have τ d y dx gρ(x), < x<, where τ is the tension in the cable, g is the gravitational constant and ρ(x) is the cable mass per unit length It is not difficult to solve this problem analytically but we will carry out an approximate solution as an example of application of Fourier solution of discrete convolution equations We discretize the problem by dividing the interval [, ) into N subintervals [x k,x k ),k,,, N, ofequallengthh and we replace N the unknown displacement function y(x) byanndimensional vector Y [y,y,, y N ] T representing approximate displacements at the points x k Since the supports at the endpoints are of equal height we can identify y with y N as we need to do in discrete Fourier analysis (In effect, we are assuming a periodic structure consisting of supports of equal height placed one unit apart with identical cables suspended between each adjacent pair of them) We replace the second derivative operator by the standard second order divided difference approximation d y dx (x k) y k+ y k + y k h and we discretize the gravitational force to g k gρ(x k )atthepoints x k,k,,,, N Then we let B be the vector whose components 8
9 are { g b k s gρ() s, k, g k gρ(x k ), k,,, N, where s is the force exerted by the supporting structure Then we have τn A Y B A Y τn B, where A ( ) T, the omitted terms all being zero Taking the discrete Fourier transform and using the convolution property of the transform we have NF(A) F(Y ) τn F(B) F(Y ) k F(B) k, F(A) τn k F(A) k In this case, because + ( ) +, the component F(A) For consistency, then, we also must have F(B) But this last component is just g s + N k g k, so we conclude that we must have s N k which is just the statement that the magnitude of the supporting force s should be the sum of the magnitudes of he gravitational forces  very much to be expected from the principles of statics Having made this choice, the component F(Y ) N the average value of the vertical displacements, is arbitrary But this is to be expected because we have not specified the height of the supporting structures g k, N For our computational treatment of this problem we will take τ, g, N 6 and we will suppose that ρ(x) {, < x< 5 4, k 6, w k, < x< 6 6 < x<,
10 This gives B ( s ) The supporting force s is selected so the sum of the components of B is zero, ie, s 4 We used MATLAB R to compute C F ( 56 B) ; because of the choice of s the first component of this discrete Fourier transform is zero There is little point in providing the whole list of the components of C here We also computed F(A); the first component is again zero and all other components are nonzero We thus let F(Y ), F(Y ) k F( 56 B) k 6 F(A) k, k,,, 5 At this point all components of F(Y ) have been determined except the first Thus we can write F(Y ) F(Y )+r ( ) t, where r is yet to be determined Then Y Y + r F (( ) t ) Y + r 6 ( )t It turns out in this example that Y ( ) t We suppose the height of the supporting posts is Then we set r to realize the value as the first component of Y To display the right hand supporting post we introduce a new component y 6 y and we plot the result in Figure
11 Figure 8 6 > y > x Supported Cable as Constructed Using Discrete Fourier Transform
Section 1.1. Introduction to R n
The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to
More informationDefinition A square matrix M is invertible (or nonsingular) if there exists a matrix M 1 such that
0. Inverse Matrix Definition A square matrix M is invertible (or nonsingular) if there exists a matrix M such that M M = I = M M. Inverse of a 2 2 Matrix Let M and N be the matrices: a b d b M =, N = c
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 19967 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationVector Spaces; the Space R n
Vector Spaces; the Space R n Vector Spaces A vector space (over the real numbers) is a set V of mathematical entities, called vectors, U, V, W, etc, in which an addition operation + is defined and in which
More informationLinear Algebra Notes for Marsden and Tromba Vector Calculus
Linear Algebra Notes for Marsden and Tromba Vector Calculus ndimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of
More informationLinear Dependence Tests
Linear Dependence Tests The book omits a few key tests for checking the linear dependence of vectors. These short notes discuss these tests, as well as the reasoning behind them. Our first test checks
More informationUNIT 2 MATRICES  I 2.0 INTRODUCTION. Structure
UNIT 2 MATRICES  I Matrices  I Structure 2.0 Introduction 2.1 Objectives 2.2 Matrices 2.3 Operation on Matrices 2.4 Invertible Matrices 2.5 Systems of Linear Equations 2.6 Answers to Check Your Progress
More informationThe Convolution Operation
The Convolution Operation Convolution is a very natural mathematical operation which occurs in both discrete and continuous modes of various kinds. We often encounter it in the course of doing other operations
More informationLecture 2 Matrix Operations
Lecture 2 Matrix Operations transpose, sum & difference, scalar multiplication matrix multiplication, matrixvector product matrix inverse 2 1 Matrix transpose transpose of m n matrix A, denoted A T or
More information2.1 Functions. 2.1 J.A.Beachy 1. from A Study Guide for Beginner s by J.A.Beachy, a supplement to Abstract Algebra by Beachy / Blair
2.1 J.A.Beachy 1 2.1 Functions from A Study Guide for Beginner s by J.A.Beachy, a supplement to Abstract Algebra by Beachy / Blair 21. The Vertical Line Test from calculus says that a curve in the xyplane
More informationRecall that two vectors in are perpendicular or orthogonal provided that their dot
Orthogonal Complements and Projections Recall that two vectors in are perpendicular or orthogonal provided that their dot product vanishes That is, if and only if Example 1 The vectors in are orthogonal
More informationMATH 304 Linear Algebra Lecture 4: Matrix multiplication. Diagonal matrices. Inverse matrix.
MATH 304 Linear Algebra Lecture 4: Matrix multiplication. Diagonal matrices. Inverse matrix. Matrices Definition. An mbyn matrix is a rectangular array of numbers that has m rows and n columns: a 11
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More information15.062 Data Mining: Algorithms and Applications Matrix Math Review
.6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop
More informationSome facts about polynomials modulo m (Full proof of the Fingerprinting Theorem)
Some facts about polynomials modulo m (Full proof of the Fingerprinting Theorem) In order to understand the details of the Fingerprinting Theorem on fingerprints of different texts from Chapter 19 of the
More informationMatrices and Polynomials
APPENDIX 9 Matrices and Polynomials he Multiplication of Polynomials Let α(z) =α 0 +α 1 z+α 2 z 2 + α p z p and y(z) =y 0 +y 1 z+y 2 z 2 + y n z n be two polynomials of degrees p and n respectively. hen,
More informationAP CALCULUS AB 2009 SCORING GUIDELINES
AP CALCULUS AB 2009 SCORING GUIDELINES Question 5 x 2 5 8 f ( x ) 1 4 2 6 Let f be a function that is twice differentiable for all real numbers. The table above gives values of f for selected points in
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationMath 315: Linear Algebra Solutions to Midterm Exam I
Math 35: Linear Algebra s to Midterm Exam I # Consider the following two systems of linear equations (I) ax + by = k cx + dy = l (II) ax + by = 0 cx + dy = 0 (a) Prove: If x = x, y = y and x = x 2, y =
More informationReview D: Potential Energy and the Conservation of Mechanical Energy
MSSCHUSETTS INSTITUTE OF TECHNOLOGY Department of Physics 8.01 Fall 2005 Review D: Potential Energy and the Conservation of Mechanical Energy D.1 Conservative and Nonconservative Force... 2 D.1.1 Introduction...
More informationFourier Series. A Fourier series is an infinite series of the form. a + b n cos(nωx) +
Fourier Series A Fourier series is an infinite series of the form a b n cos(nωx) c n sin(nωx). Virtually any periodic function that arises in applications can be represented as the sum of a Fourier series.
More information1 Determinants and the Solvability of Linear Systems
1 Determinants and the Solvability of Linear Systems In the last section we learned how to use Gaussian elimination to solve linear systems of n equations in n unknowns The section completely sidestepped
More informationEstimating the Average Value of a Function
Estimating the Average Value of a Function Problem: Determine the average value of the function f(x) over the interval [a, b]. Strategy: Choose sample points a = x 0 < x 1 < x 2 < < x n 1 < x n = b and
More informationChapter 5 Polar Coordinates; Vectors 5.1 Polar coordinates 1. Pole and polar axis
Chapter 5 Polar Coordinates; Vectors 5.1 Polar coordinates 1. Pole and polar axis 2. Polar coordinates A point P in a polar coordinate system is represented by an ordered pair of numbers (r, θ). If r >
More informationInverses and powers: Rules of Matrix Arithmetic
Contents 1 Inverses and powers: Rules of Matrix Arithmetic 1.1 What about division of matrices? 1.2 Properties of the Inverse of a Matrix 1.2.1 Theorem (Uniqueness of Inverse) 1.2.2 Inverse Test 1.2.3
More informationMath 54. Selected Solutions for Week Is u in the plane in R 3 spanned by the columns
Math 5. Selected Solutions for Week 2 Section. (Page 2). Let u = and A = 5 2 6. Is u in the plane in R spanned by the columns of A? (See the figure omitted].) Why or why not? First of all, the plane in
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 918/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationα = u v. In other words, Orthogonal Projection
Orthogonal Projection Given any nonzero vector v, it is possible to decompose an arbitrary vector u into a component that points in the direction of v and one that points in a direction orthogonal to v
More informationWe call this set an ndimensional parallelogram (with one vertex 0). We also refer to the vectors x 1,..., x n as the edges of P.
Volumes of parallelograms 1 Chapter 8 Volumes of parallelograms In the present short chapter we are going to discuss the elementary geometrical objects which we call parallelograms. These are going to
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
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 informationGeometric Transformations
Geometric Transformations Definitions Def: f is a mapping (function) of a set A into a set B if for every element a of A there exists a unique element b of B that is paired with a; this pairing is denoted
More informationSolution: 2. Sketch the graph of 2 given the vectors and shown below.
7.4 Vectors, Operations, and the Dot Product Quantities such as area, volume, length, temperature, and speed have magnitude only and can be completely characterized by a single real number with a unit
More informationCourse 221: Analysis Academic year , First Semester
Course 221: Analysis Academic year 200708, First Semester David R. Wilkins Copyright c David R. Wilkins 1989 2007 Contents 1 Basic Theorems of Real Analysis 1 1.1 The Least Upper Bound Principle................
More informationLattice Point Geometry: Pick s Theorem and Minkowski s Theorem. Senior Exercise in Mathematics. Jennifer Garbett Kenyon College
Lattice Point Geometry: Pick s Theorem and Minkowski s Theorem Senior Exercise in Mathematics Jennifer Garbett Kenyon College November 18, 010 Contents 1 Introduction 1 Primitive Lattice Triangles 5.1
More informationNotes from February 11
Notes from February 11 Math 130 Course web site: www.courses.fas.harvard.edu/5811 Two lemmas Before proving the theorem which was stated at the end of class on February 8, we begin with two lemmas. The
More informationFigure 1.1 Vector A and Vector F
CHAPTER I VECTOR QUANTITIES Quantities are anything which can be measured, and stated with number. Quantities in physics are divided into two types; scalar and vector quantities. Scalar quantities have
More information4.2 Free Body Diagrams
CE297FA09Ch4 Page 1 Friday, September 18, 2009 12:11 AM Chapter 4: Equilibrium of Rigid Bodies A (rigid) body is said to in equilibrium if the vector sum of ALL forces and all their moments taken about
More information4. MATRICES Matrices
4. MATRICES 170 4. Matrices 4.1. Definitions. Definition 4.1.1. A matrix is a rectangular array of numbers. A matrix with m rows and n columns is said to have dimension m n and may be represented as follows:
More informationDecember 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS
December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in twodimensional space (1) 2x y = 3 describes a line in twodimensional space The coefficients of x and y in the equation
More informationTaylor and Maclaurin Series
Taylor and Maclaurin Series In the preceding section we were able to find power series representations for a certain restricted class of functions. Here we investigate more general problems: Which functions
More information4. Matrix inverses. left and right inverse. linear independence. nonsingular matrices. matrices with linearly independent columns
L. Vandenberghe EE133A (Spring 2016) 4. Matrix inverses left and right inverse linear independence nonsingular matrices matrices with linearly independent columns matrices with linearly independent rows
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationMATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform
MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish
More informationLINEAR ALGEBRA W W L CHEN
LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,
More informationCofactor Expansion: Cramer s Rule
Cofactor Expansion: Cramer s Rule MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Introduction Today we will focus on developing: an efficient method for calculating
More informationDirect Methods for Solving Linear Systems. Matrix Factorization
Direct Methods for Solving Linear Systems Matrix Factorization Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011
More informationVector and Matrix Norms
Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a nonempty
More informationNumerical Methods for Civil Engineers. Linear Equations
Numerical Methods for Civil Engineers Lecture Notes CE 311K Daene C. McKinney Introduction to Computer Methods Department of Civil, Architectural and Environmental Engineering The University of Texas at
More informationMATH2210 Notebook 1 Fall Semester 2016/2017. 1 MATH2210 Notebook 1 3. 1.1 Solving Systems of Linear Equations... 3
MATH0 Notebook Fall Semester 06/07 prepared by Professor Jenny Baglivo c Copyright 009 07 by Jenny A. Baglivo. All Rights Reserved. Contents MATH0 Notebook 3. Solving Systems of Linear Equations........................
More informationLINEAR SYSTEMS. Consider the following example of a linear system:
LINEAR SYSTEMS Consider the following example of a linear system: Its unique solution is x +2x 2 +3x 3 = 5 x + x 3 = 3 3x + x 2 +3x 3 = 3 x =, x 2 =0, x 3 = 2 In general we want to solve n equations in
More informationSolution of Linear Systems
Chapter 3 Solution of Linear Systems In this chapter we study algorithms for possibly the most commonly occurring problem in scientific computing, the solution of linear systems of equations. We start
More informationThe Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More informationReduced echelon form: Add the following conditions to conditions 1, 2, and 3 above:
Section 1.2: Row Reduction and Echelon Forms Echelon form (or row echelon form): 1. All nonzero rows are above any rows of all zeros. 2. Each leading entry (i.e. left most nonzero entry) of a row is in
More informationOrdered Pairs. Graphing Lines and Linear Inequalities, Solving System of Linear Equations. Cartesian Coordinates System.
Ordered Pairs Graphing Lines and Linear Inequalities, Solving System of Linear Equations Peter Lo All equations in two variables, such as y = mx + c, is satisfied only if we find a value of x and a value
More informationMidterm Solutions. mvr = ω f (I wheel + I bullet ) = ω f 2 MR2 + mr 2 ) ω f = v R. 1 + M 2m
Midterm Solutions I) A bullet of mass m moving at horizontal velocity v strikes and sticks to the rim of a wheel a solid disc) of mass M, radius R, anchored at its center but free to rotate i) Which of
More informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems 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 a, a,, a n and
More informationPolynomial Degree and Finite Differences
CONDENSED LESSON 7.1 Polynomial Degree and Finite Differences In this lesson you will learn the terminology associated with polynomials use the finite differences method to determine the degree of a polynomial
More informationThe Hadamard Product
The Hadamard Product Elizabeth Million April 12, 2007 1 Introduction and Basic Results As inexperienced mathematicians we may have once thought that the natural definition for matrix multiplication would
More informationBasic Terminology for Systems of Equations in a Nutshell. E. L. Lady. 3x 1 7x 2 +4x 3 =0 5x 1 +8x 2 12x 3 =0.
Basic Terminology for Systems of Equations in a Nutshell E L Lady A system of linear equations is something like the following: x 7x +4x =0 5x +8x x = Note that the number of equations is not required
More informationMATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.
MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all ndimensional column
More informationMarch 29, 2011. 171S4.4 Theorems about Zeros of Polynomial Functions
MAT 171 Precalculus Algebra Dr. Claude Moore Cape Fear Community College CHAPTER 4: Polynomial and Rational Functions 4.1 Polynomial Functions and Models 4.2 Graphing Polynomial Functions 4.3 Polynomial
More informationVELOCITY, ACCELERATION, FORCE
VELOCITY, ACCELERATION, FORCE velocity Velocity v is a vector, with units of meters per second ( m s ). Velocity indicates the rate of change of the object s position ( r ); i.e., velocity tells you how
More information5.3 The Cross Product in R 3
53 The Cross Product in R 3 Definition 531 Let u = [u 1, u 2, u 3 ] and v = [v 1, v 2, v 3 ] Then the vector given by [u 2 v 3 u 3 v 2, u 3 v 1 u 1 v 3, u 1 v 2 u 2 v 1 ] is called the cross product (or
More informationThese axioms must hold for all vectors ū, v, and w in V and all scalars c and d.
DEFINITION: A vector space is a nonempty set V of objects, called vectors, on which are defined two operations, called addition and multiplication by scalars (real numbers), subject to the following axioms
More information1 of 7 10/2/2009 1:13 PM
1 of 7 10/2/2009 1:13 PM Chapter 6 Homework Due: 9:00am on Monday, September 28, 2009 Note: To understand how points are awarded, read your instructor's Grading Policy. [Return to Standard Assignment View]
More information6. Vectors. 1 20092016 Scott Surgent (surgent@asu.edu)
6. Vectors For purposes of applications in calculus and physics, a vector has both a direction and a magnitude (length), and is usually represented as an arrow. The start of the arrow is the vector s foot,
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 informationBedford, Fowler: Statics. Chapter 4: System of Forces and Moments, Examples via TK Solver
System of Forces and Moments Introduction The moment vector of a force vector,, with respect to a point has a magnitude equal to the product of the force magnitude, F, and the perpendicular distance from
More informationDefinition: Group A group is a set G together with a binary operation on G, satisfying the following axioms: a (b c) = (a b) c.
Algebraic Structures Abstract algebra is the study of algebraic structures. Such a structure consists of a set together with one or more binary operations, which are required to satisfy certain axioms.
More informationThe Characteristic Polynomial
Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More information041. Newton s First Law Newton s first law states: Sections Covered in the Text: Chapters 4 and 8 F = ( F 1 ) 2 + ( F 2 ) 2.
Force and Motion Sections Covered in the Text: Chapters 4 and 8 Thus far we have studied some attributes of motion. But the cause of the motion, namely force, we have essentially ignored. It is true that
More informationFourier Transform Applications
Fourier Transform Applications The Fourier transform is very useful in solving a variety of linear constant coefficient ordinary and partial differential equations describing processes which take place
More informationAlgebraic and Combinatorial Circuits
C H A P T E R Algebraic and Combinatorial Circuits Algebraic circuits combine operations drawn from an algebraic system. In this chapter we develop algebraic and combinatorial circuits for a variety of
More informationMATH 2030: SYSTEMS OF LINEAR EQUATIONS. ax + by + cz = d. )z = e. while these equations are not linear: xy z = 2, x x = 0,
MATH 23: SYSTEMS OF LINEAR EQUATIONS Systems of Linear Equations In the plane R 2 the general form of the equation of a line is ax + by = c and that the general equation of a plane in R 3 will be we call
More informationRotation Matrices and Homogeneous Transformations
Rotation Matrices and Homogeneous Transformations A coordinate frame in an ndimensional space is defined by n mutually orthogonal unit vectors. In particular, for a twodimensional (2D) space, i.e., n
More informationTopic 1: Matrices and Systems of Linear Equations.
Topic 1: Matrices and Systems of Linear Equations Let us start with a review of some linear algebra concepts we have already learned, such as matrices, determinants, etc Also, we shall review the method
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An ndimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0534405967. Systems of Linear Equations Definition. An ndimensional vector is a row or a column
More informationApproximating the entropy of a 2dimensional shift of finite type
Approximating the entropy of a dimensional shift of finite type Tirasan Khandhawit c 4 July 006 Abstract. In this paper, we extend the method used to compute entropy of dimensional subshift and the technique
More informationSolving Simultaneous Equations and Matrices
Solving Simultaneous Equations and Matrices The following represents a systematic investigation for the steps used to solve two simultaneous linear equations in two unknowns. The motivation for considering
More information1 Introduction to Matrices
1 Introduction to Matrices In this section, important definitions and results from matrix algebra that are useful in regression analysis are introduced. While all statements below regarding the columns
More information13 MATH FACTS 101. 2 a = 1. 7. The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions.
3 MATH FACTS 0 3 MATH FACTS 3. Vectors 3.. Definition We use the overhead arrow to denote a column vector, i.e., a linear segment with a direction. For example, in threespace, we write a vector in terms
More informationMechanics 1: Conservation of Energy and Momentum
Mechanics : Conservation of Energy and Momentum If a certain quantity associated with a system does not change in time. We say that it is conserved, and the system possesses a conservation law. Conservation
More information5. Orthogonal matrices
L Vandenberghe EE133A (Spring 2016) 5 Orthogonal matrices matrices with orthonormal columns orthogonal matrices tall matrices with orthonormal columns complex matrices with orthonormal columns 51 Orthonormal
More informationGroups, Rings, and Fields. I. Sets Let S be a set. The Cartesian product S S is the set of ordered pairs of elements of S, S S = {(x, y) x, y S}.
Groups, Rings, and Fields I. Sets Let S be a set. The Cartesian product S S is the set of ordered pairs of elements of S, A binary operation φ is a function, S S = {(x, y) x, y S}. φ : S S S. A binary
More information1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
More information3 Orthogonal Vectors and Matrices
3 Orthogonal Vectors and Matrices The linear algebra portion of this course focuses on three matrix factorizations: QR factorization, singular valued decomposition (SVD), and LU factorization The first
More information9 MATRICES AND TRANSFORMATIONS
9 MATRICES AND TRANSFORMATIONS Chapter 9 Matrices and Transformations Objectives After studying this chapter you should be able to handle matrix (and vector) algebra with confidence, and understand the
More informationNumerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What
More information0.1 Linear Transformations
.1 Linear Transformations A function is a rule that assigns a value from a set B for each element in a set A. Notation: f : A B If the value b B is assigned to value a A, then write f(a) = b, b is called
More informationThe Solution of Linear Simultaneous Equations
Appendix A The Solution of Linear Simultaneous Equations Circuit analysis frequently involves the solution of linear simultaneous equations. Our purpose here is to review the use of determinants to solve
More information4. The Infinite Square Well
4. The Infinite Square Well Copyright c 215 216, Daniel V. Schroeder In the previous lesson I emphasized the free particle, for which V (x) =, because its energy eigenfunctions are so simple: they re the
More informationUnderstanding Basic Calculus
Understanding Basic Calculus S.K. Chung Dedicated to all the people who have helped me in my life. i Preface This book is a revised and expanded version of the lecture notes for Basic Calculus and other
More informationElements of Abstract Group Theory
Chapter 2 Elements of Abstract Group Theory Mathematics is a game played according to certain simple rules with meaningless marks on paper. David Hilbert The importance of symmetry in physics, and for
More information3. INNER PRODUCT SPACES
. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.
More information4.3 Lagrange Approximation
206 CHAP. 4 INTERPOLATION AND POLYNOMIAL APPROXIMATION Lagrange Polynomial Approximation 4.3 Lagrange Approximation Interpolation means to estimate a missing function value by taking a weighted average
More informationAdvanced Higher Mathematics Course Assessment Specification (C747 77)
Advanced Higher Mathematics Course Assessment Specification (C747 77) Valid from August 2015 This edition: April 2016, version 2.4 This specification may be reproduced in whole or in part for educational
More informationDiscrete Fourier Series & Discrete Fourier Transform Chapter Intended Learning Outcomes
Discrete Fourier Series & Discrete Fourier Transform Chapter Intended Learning Outcomes (i) Understanding the relationships between the transform, discretetime Fourier transform (DTFT), discrete Fourier
More informationMATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix.
MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix. Inverse matrix Definition. Let A be an n n matrix. The inverse of A is an n n matrix, denoted
More information