The Convolution Operation



Similar documents
Discrete Convolution and the Discrete Fourier Transform

19.6. Finding a Particular Integral. Introduction. Prerequisites. Learning Outcomes. Learning Style

The Division Algorithm for Polynomials Handout Monday March 5, 2012

Mathematics Course 111: Algebra I Part IV: Vector Spaces

RESULTANT AND DISCRIMINANT OF POLYNOMIALS

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include

Factoring Trinomials: The ac Method

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

1.5. Factorisation. Introduction. Prerequisites. Learning Outcomes. Learning Style

CITY UNIVERSITY LONDON. BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION

The finite field with 2 elements The simplest finite field is

Methods of Solution of Selected Differential Equations Carol A. Edwards Chandler-Gilbert Community College

The continuous and discrete Fourier transforms

Factoring Polynomials

LINEAR ALGEBRA W W L CHEN

JUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson

Algebra Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the school year.

2WB05 Simulation Lecture 8: Generating random variables

Understanding Basic Calculus

Lecture 8. Confidence intervals and the central limit theorem

How To Understand The Theory Of Algebraic Functions

Chapter 13: Basic ring theory

1 Sets and Set Notation.

Definition: Suppose that two random variables, either continuous or discrete, X and Y have joint density

tegrals as General & Particular Solutions

Limits and Continuity

8 Polynomials Worksheet

FIRST YEAR CALCULUS. Chapter 7 CONTINUITY. It is a parabola, and we can draw this parabola without lifting our pencil from the paper.

Lagrange Interpolation is a method of fitting an equation to a set of points that functions well when there are few points given.

it is easy to see that α = a

Mathematics Review for MS Finance Students

minimal polyonomial Example

Section 3.2 Polynomial Functions and Their Graphs

Lecture 6: Discrete & Continuous Probability and Random Variables

Computational Foundations of Cognitive Science

QUADRATIC SYSTEMS WITH A RATIONAL FIRST INTEGRAL OF DEGREE THREE: A COMPLETE CLASSIFICATION IN THE COEFFICIENT SPACE R 12

(a) Write each of p and q as a polynomial in x with coefficients in Z[y, z]. deg(p) = 7 deg(q) = 9

Inner Product Spaces

Gambling and Data Compression

Factoring Cubic Polynomials

4 Sums of Random Variables

TOPIC 4: DERIVATIVES

Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any.

SOLUTIONS. f x = 6x 2 6xy 24x, f y = 3x 2 6y. To find the critical points, we solve

Graphic Designing with Transformed Functions

Metric Spaces. Chapter 1

How To Find Out How To Calculate A Premeasure On A Set Of Two-Dimensional Algebra

PROBLEM SET 6: POLYNOMIALS

Linear Algebra Notes for Marsden and Tromba Vector Calculus

Application. Outline. 3-1 Polynomial Functions 3-2 Finding Rational Zeros of. Polynomial. 3-3 Approximating Real Zeros of.

South Carolina College- and Career-Ready (SCCCR) Pre-Calculus

Inner product. Definition of inner product

POLYNOMIAL HISTOPOLATION, SUPERCONVERGENT DEGREES OF FREEDOM, AND PSEUDOSPECTRAL DISCRETE HODGE OPERATORS

5. Continuous Random Variables

Sums of Independent Random Variables

1. First-order Ordinary Differential Equations

Nonhomogeneous Linear Equations

INTEGRATING FACTOR METHOD

EECS 556 Image Processing W 09. Interpolation. Interpolation techniques B splines

Notes on metric spaces

Math 312 Homework 1 Solutions

Metric Spaces. Chapter Metrics

Basics of Polynomial Theory

u dx + y = 0 z x z x = x + y = 0 6) 2

Rolle s Theorem. q( x) = 1

Mathematics Georgia Performance Standards

Polynomial Invariants

CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

Factorization Algorithms for Polynomials over Finite Fields

1 Mathematical Models of Cost, Revenue and Profit

THE CENTRAL LIMIT THEOREM TORONTO

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011

1 if 1 x 0 1 if 0 x 1

1.7. Partial Fractions Rational Functions and Partial Fractions. A rational function is a quotient of two polynomials: R(x) = P (x) Q(x).

SOLVING POLYNOMIAL EQUATIONS

1.3 Polynomials and Factoring

Department of Mathematics, Indian Institute of Technology, Kharagpur Assignment 2-3, Probability and Statistics, March Due:-March 25, 2015.

Introduction to Finite Fields (cont.)

On closed-form solutions to a class of ordinary differential equations

LINEAR DIFFERENTIAL EQUATIONS IN DISTRIBUTIONS

Quotient Rings and Field Extensions

Polynomials and Factoring

Vector and Matrix Norms

9. POLYNOMIALS. Example 1: The expression a(x) = x 3 4x 2 + 7x 11 is a polynomial in x. The coefficients of a(x) are the numbers 1, 4, 7, 11.

Homework # 3 Solutions

College Algebra - MAT 161 Page: 1 Copyright 2009 Killoran

BANACH AND HILBERT SPACE REVIEW

3.6 The Real Zeros of a Polynomial Function

Factoring Polynomials

15. Symmetric polynomials

calculating the result modulo 3, as follows: p(0) = = 1 0,

Integer factorization is in P

Generic Polynomials of Degree Three

MATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

APPLIED MATHEMATICS ADVANCED LEVEL

INTERPOLATION. Interpolation is a process of finding a formula (often a polynomial) whose graph will pass through a given set of points (x, y).

Transcription:

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 without recognizing it. Suppose, for example, we have two polynomials, one of degree n, the other of degree m: p(x) = a x n + a x n + + a n x + a n ; q(x) = b x m + b x m + + b m x + b m. The ordinary product of these two polynomials is a polynomial of degree n + m, i.e., p(x) q(x) = a b x m+n +(a b +a b ) x m+n + + (a b j +a b j + + a j b + a j b ) x m+n j + + (a n b m + a n b m ) x + a n b m. The coefficient of x m+n j is a b j + a b j + + a j b + a j b = j k= a k b j k, the sum of products a k b l for which k + l = j. It is instructive to arrange the coefficients of p(x) and q(x) in the following manner: a a a j a j a j+ b j+ b j b j b b from which we see that the sum j k= a k b j k is the sum of products of overlapping a k, b l in this diagram. The Matlab R operation conv(a, B), where A and B are vectors of dimension n and m, works in essentially this way.

Convolution of functions is defined in a very similar way. Let us suppose f(x) and g(x) are Laplace transformable, piecewise continuous functions defined on [, ). The convolution product of these two functions is again a function of x, denoted by (f g)(x), defined by f(ξ)g(x ξ) dξ. The integral involves products f(ξ)g(y) such that ξ + y = x and thus is directly analogous to the sum j k= a kb j k which occurs in multiplication of polynomials. Example Let f(x) = e ax, g(x) = e bx for constants a and b. Then for b a we have = ebx a b (e (a b)ξ ξ=x) ξ= e aξ e b(x ξ) dξ = e bx = ebx (e (a b)x ) a b e (a b)ξ dξ = eax e bx. a b A special case occurs with b = a, a, in which case we obtain the result that the convolution product of e ax with e ax is sinh ax. If b = a we have the integral a e aξ e a(x ξ) dξ = e ax dξ = x e ax. Theorem The convolution product is commutative: (f g) (x) (g f) (x). 2

Proof obtain For fixed x we let y = x ξ; then dξ = dy and we f(ξ) g(x ξ) dξ = y=x x y=x f(x y) g(y) dy = (since the name attached to the variable of integration is immaterial) = y=x y=x x g(y) f(x y) dy = g(ξ) f(x ξ) dξ = (g f) (x). The importance of both the Laplace transform and the convolution operation is very much due to the special relationship expressed by Theorem 2 Let f(x) and g(x) be Laplace transformable, piecewise continuous functions. Then (L (f g)) (s) = (Lf) (s) (Lg) (s), wherein the right hand side denotes the ordinary product of the two functions of s involved. Proof We have (L (f g)) (s) = = f(ξ) e sξ f(ξ) e sx ξ ξ f(ξ) g(x ξ) dξ dx e sx g(x ξ) dx dξ = e s(x ξ) g(x ξ) dx dξ = 3

( with y = x ξ; dy = dx) = = ( e sξ f(ξ) dξ)( e sξ f(ξ) e sy g(y) dy dξ e sy g(y) dy) = (Lf) (s) (Lg) (s), again taking into account that the symbol attached to the variable of integration is immaterial. Example 2 Let s re-do Example in the context of this theorem. The ordinary product of the Laplace transforms of e ax and e bx is Since (s a)(s b) = ( ( L a b s a L ( s b (s a) 2 a b ( ), b a; (s a), b = a. 2 s a s b )) (x) = a b (eax e bx ); ) (x) = x e ax, we have the same result as before, but somewhat more quickly. Example 3 Let f(x) be arbitrary and let g(x), x. We compute f(ξ) g(x ξ) dξ = f(ξ) dξ. On the other hand, since (L) (s) = s, it must be true that (L (f g)) (s) = s (Lf) (s) 4

and so we conclude that ( L ) f(ξ) dξ (s) = s (Lf) (s). In the same way, since (Lx n ) (s) = n! s n+ ( L we can see that f(ξ) (x ξ) n ) dξ (s) = n! (Lf) (s). sn+ Example 4 For h > let g(x) be the pulse of duration h and amplitude A: g(x) = { A, < x < h;, otherwise. Then, for arbitrary Laplace transformable f(x) f(ξ) g(x ξ) dξ = A max{x h,} f(ξ) dξ. But, clearly, (Lg) (s) = A h (L (f g)) (s) = e sx dx = A ( s e sx ) h = A s ( e sh ) ( ) x L f(ξ) dξ (s) = A max{x h,} s ( e sh ) (Lf) (s). Now let g h (x) correspond to g(x), as defined, with A = h ; as we let h the function g h (x) approximates the distribution (as discussed in the section on distributions) δ, the Dirac delta function with support. On the other hand with A = 5

h we have A = and, as h, the function s sh sh ( e sh ) tends uniformly to the constant on any finite interval [, a), a >. With some further refinements in the analysis, which we do not detail here, this leads us to the conclusion that (L (f δ )) (s) = (Lf) (s) (f δ ) (x) f(x). We conclude that δ is the convolution identity; the convolution product of that distribution with f(x) simply returns f(x) again. In general, for a we have (Lδ a ) = e sa and preservation of the multiplication property of Laplace transforms of convolutions therefore requires that (L (δ a f)) (s) = e sa (Lf) (s) = (Lf a ) (s), so we must have (δ a f) (x) = f a (x) = u a (x) f(x a). The convolution multiplication relationship can be used to find inverse Laplace transforms. Example 5 Suppose ˆf(s) = s 2 (s+3) L ( s 2 ) (x) = x; L ( Therefore L s 2 (x) = (s + 3) e 3x ( ξ 3 e3ξ ) x e 3x 3 ; find f(x). We know that s + 3 ) (x) = e 3x. ξ e 3(x ξ) dξ = e 3x ξ e 3ξ dξ = e 3ξ dξ = e 3x 3 x e3x e 3x ( e 3x ) 9 = x 3 9 + e 3x 9. 6