CHAPTER 7. Definition and Properties. of Laplace Transforms

Similar documents
EECE 301 Signals & Systems Prof. Mark Fowler

Laplace Transform. Inverse Laplace Transform. e st f(t)dt. (2)

t is a basis for the solution space to this system, then the matrix having these solutions as columns, t x 1 t, x 2 t,... x n t x 2 t...

Chapter 6. Laplace Transforms

Chapter 6. Laplace Transforms

MATH 4330/5330, Fourier Analysis Section 6, Proof of Fourier s Theorem for Pointwise Convergence

To become more mathematically correct, Circuit equations are Algebraic Differential equations. from KVL, KCL from the constitutive relationship

18.03SC Unit 3 Practice Exam and Solutions

Finish reading Chapter 2 of Spivak, rereading earlier sections as necessary. handout and fill in some missing details!

SMT 2014 Calculus Test Solutions February 15, 2014 = 3 5 = 15.

Challenge Problems. DIS 203 and 210. March 6, (e 2) k. k(k + 2). k=1. f(x) = k(k + 2) = 1 x k

Chapter 7: Inverse-Response Systems

On the Exponential Operator Functions on Time Scales

Piecewise-Defined Functions and Periodic Functions

Chapter 2. First Order Scalar Equations

6.8 Laplace Transform: General Formulas

CHAPTER. Forced Equations and Systems { } ( ) ( ) 8.1 The Laplace Transform and Its Inverse. Transforms from the Definition.

dt = C exp (3 ln t 4 ). t 4 W = C exp ( ln(4 t) 3) = C(4 t) 3.

Exponential Sawtooth

CONTROL SYSTEMS. Chapter 3 Mathematical Modelling of Physical Systems-Laplace Transforms. Prof.Dr. Fatih Mehmet Botsalı

Chapter 6. Systems of First Order Linear Differential Equations

Sections 2.2 & 2.3 Limit of a Function and Limit Laws

The Asymptotic Behavior of Nonoscillatory Solutions of Some Nonlinear Dynamic Equations on Time Scales

Undetermined coefficients for local fractional differential equations

Mon Apr 2: Laplace transform and initial value problems like we studied in Chapter 5

Section 3.5 Nonhomogeneous Equations; Method of Undetermined Coefficients

Chapter 9 - The Laplace Transform

Math 2142 Exam 1 Review Problems. x 2 + f (0) 3! for the 3rd Taylor polynomial at x = 0. To calculate the various quantities:

Representing a Signal. Continuous-Time Fourier Methods. Linearity and Superposition. Real and Complex Sinusoids. Jean Baptiste Joseph Fourier

MA 214 Calculus IV (Spring 2016) Section 2. Homework Assignment 1 Solutions

Solutions from Chapter 9.1 and 9.2

Math Week 14 April 16-20: sections first order systems of linear differential equations; 7.4 mass-spring systems.

Bernoulli numbers. Francesco Chiatti, Matteo Pintonello. December 5, 2016

2. Nonlinear Conservation Law Equations

, the. L and the L. x x. max. i n. It is easy to show that these two norms satisfy the following relation: x x n x = (17.3) max

t )? How would you have tried to solve this problem in Chapter 3?

Math 334 Fall 2011 Homework 11 Solutions

Flow networks. Flow Networks. A flow on a network. Flow networks. The maximum-flow problem. Introduction to Algorithms, Lecture 22 December 5, 2001

6.2 Transforms of Derivatives and Integrals.

CHAPTER 7: SECOND-ORDER CIRCUITS

1 Motivation and Basic Definitions

23.2. Representing Periodic Functions by Fourier Series. Introduction. Prerequisites. Learning Outcomes

LAPLACE TRANSFORMS. 1. Basic transforms

CHAPTER 9. Inverse Transform and. Solution to the Initial Value Problem

u(t) Figure 1. Open loop control system

LAPLACE TRANSFORM AND TRANSFER FUNCTION

An random variable is a quantity that assumes different values with certain probabilities.

Example on p. 157

Problem Set If all directed edges in a network have distinct capacities, then there is a unique maximum flow.

MATH 128A, SUMMER 2009, FINAL EXAM SOLUTION

Randomized Perfect Bipartite Matching

Boyce/DiPrima 9 th ed, Ch 6.1: Definition of. Laplace Transform. In this chapter we use the Laplace transform to convert a

MATH 31B: MIDTERM 2 REVIEW. x 2 e x2 2x dx = 1. ue u du 2. x 2 e x2 e x2] + C 2. dx = x ln(x) 2 2. ln x dx = x ln x x + C. 2, or dx = 2u du.

t 2 B F x,t n dsdt t u x,t dxdt

4 Sequences of measurable functions

23.5. Half-Range Series. Introduction. Prerequisites. Learning Outcomes

Introduction to SLE Lecture Notes

THE BERNOULLI NUMBERS. t k. = lim. = lim = 1, d t B 1 = lim. 1+e t te t = lim t 0 (e t 1) 2. = lim = 1 2.

EECE 301 Signals & Systems Prof. Mark Fowler

10. State Space Methods

KEY. Math 334 Midterm I Fall 2008 sections 001 and 003 Instructor: Scott Glasgow

EXERCISES FOR SECTION 1.5

Fractional Method of Characteristics for Fractional Partial Differential Equations

CHAPTER 2: Mathematics for Microeconomics

Stochastic models and their distributions

Linear Response Theory: The connection between QFT and experiments

Introduction to Probability and Statistics Slides 4 Chapter 4

Algorithmic Discrete Mathematics 6. Exercise Sheet

ENGI 9420 Engineering Analysis Assignment 2 Solutions

Vehicle Arrival Models : Headway

5.1 - Logarithms and Their Properties

EECE 301 Signals & Systems Prof. Mark Fowler

Two Coupled Oscillators / Normal Modes

Mon Apr 9 EP 7.6 Convolutions and Laplace transforms. Announcements: Warm-up Exercise:

PROBLEMS FOR MATH 162 If a problem is starred, all subproblems are due. If only subproblems are starred, only those are due. SLOPES OF TANGENT LINES

4.1 - Logarithms and Their Properties

Instrumentation & Process Control

e t dt e t dt = lim e t dt T (1 e T ) = 1

Differential Equations

Chapter 7: Solving Trig Equations

Solution of Integro-Differential Equations by Using ELzaki Transform

Algorithms and Data Structures 2011/12 Week 9 Solutions (Tues 15th - Fri 18th Nov)

Matrix Versions of Some Refinements of the Arithmetic-Geometric Mean Inequality

-e x ( 0!x+1! ) -e x 0!x 2 +1!x+2! e t dt, the following expressions hold. t

CHAPTER 2 Signals And Spectra

4.8 Improper Integrals

( ) ( ) if t = t. It must satisfy the identity. So, bulkiness of the unit impulse (hyper)function is equal to 1. The defining characteristic is

1 CHAPTER 14 LAPLACE TRANSFORMS

MODULE 3 FUNCTION OF A RANDOM VARIABLE AND ITS DISTRIBUTION LECTURES PROBABILITY DISTRIBUTION OF A FUNCTION OF A RANDOM VARIABLE

Guest Lectures for Dr. MacFarlane s EE3350 Part Deux

An Introduction to Malliavin calculus and its applications

s-domain Circuit Analysis

Note on Matuzsewska-Orlich indices and Zygmund inequalities

Chapter 8 The Complete Response of RL and RC Circuits

Ordinary dierential equations

Method For Solving Fuzzy Integro-Differential Equation By Using Fuzzy Laplace Transformation

Existence of positive solution for a third-order three-point BVP with sign-changing Green s function

1 Solutions to selected problems

Representation of Stochastic Process by Means of Stochastic Integrals

Continuous Time. Time-Domain System Analysis. Impulse Response. Impulse Response. Impulse Response. Impulse Response. ( t) + b 0.

Transcription:

SERIES OF CLSS NOTES FOR 5-6 TO INTRODUCE LINER ND NONLINER PROBLEMS TO ENGINEERS, SCIENTISTS, ND PPLIED MTHEMTICINS DE CLSS NOTES COLLECTION OF HNDOUTS ON SCLR LINER ORDINRY DIFFERENTIL EQUTIONS (ODE") CHPTER 7 Definiion and Properie of Laplace Tranform. Compuaion of he Laplace Tranform Uing he Definiion. Parial Table of (Indefinie) Inegral (niderivaive) 3. Properie of he Laplace Tranform: Lineariy 4. Oher Properie of he Laplace Tranform 5. Parial Table of Laplace Tranform You Mu Memorize 6. Exra Homework Shee on Laplace Tranform Ch. 7 Pg.

Laplace Tranform- COMPUTTION OF THE LPLCE Handou # TRNSFORM USING THE DEFINITION Profeor Moeley Read he inroducion and Secion 6. of Chaper 6 of ex (Elem. Diff. Eq. and BVP by Boyce and Diprima, evenh ed.). Pay paricular aenion o Example -6 page 94-97. REVIEW OF IMPROPER INTEGRLS. The Laplace ranform i defined a an improper inegral. Hence we begin wih a brief review of improper inegral. DEFINITION #. f()d = lim f()d provided he limi exi. c = c EXMPLE #. Compue d Soluion. = = = d lim d lim (ln ) = lim (ln - ln ) = lim (ln ) = (Increae wihou bound and hence he limi doe no exi) EXMPLE #. Compue d where p >. p -p Soluion. d = lim d = lim d = p p = = -p lim ( / (- p)) = lim ( -p -p = = p p ) lim ( -p p p - ) p - Recall ha hee improper inegral, ogeher wih he inegral e, imply he divergence of he harmonic erie and he convergence of he p erie if p >. n n p n DEFINITION # (Laplace Tranform). Le I = [,) and f:i R. Then he Laplace Tranform of f() i he funcion F() {f()} = F() = f() e d () provided he improper inegral exi. (Sufficien condiion for he Laplace Tranform o exi are given below.) Since i arbirary, he Laplace ranform map a given funcion f() in he n Ch. 7 Pg.

funcion pace we will denoe by T (ime domain) o he funcion F() in he funcion pace of all Laplace ranform which we denoe by F (complex frequency domain). EXMPLE# Compue {f()} = F() where f() = for all in [,). {f()} = F() = f() e d = e d = lim d = =. lim EXMPLE# Compue {f()} = F() where f() = e a for all in [,). Soluion. We wih o compue {f()} = F() = {e a }. {e a a } = F() = e e d = e a (a-) (a) d = e d = lim e d (a ) = lim e / (a ) = = = lim e (a ) (a) e = if a - < ( > a) a - a - a We begin a able of Laplace Tranform imilar o having a able of aniderivaive. PRTIL TBLE OF LPLCE TRNSFORMS Time Domain (Complex) Frequency Domain f() F() > e a /(-a) > a SUFFICIENT CONDITIONS FOR THE IMPROPER INTEGRL TO EXIST. To inure ha he improper inegral f() e d exi, we mu fir inure ha he proper inegral f() e d exi for all poiive real number. good ar i o recall ha coninuou funcion are inegrable: THEOREM. Le f be a real valued funcion of a real variable whoe domain include he cloed inerval I = [α,β]. Suppoe ha f i coninuou on I. Then he Riemann Inegral Ch. 7 Pg. 3

f() d and f() e d (4) boh exi. (Since produc of coninuou funcion are coninuou, if f i coninuou on [α,β], hen o i f() e for all value of.) However, we would like o conider a larger cla of funcion where he Riemann inegral exi. DEFINITION #3. funcion f i aid o be piecewie coninuou on a cloed finie inerval I = [α,β] if he inerval can be pariioned by a finie number of poin α = < < <... < n = β, o ha:. F i coninuou on each of he open ubinerval I n = ( i-, i ) i =,,...,n.. f approache a finie limi a he end poin of each ubinerval are approached from wihin he ubinerval; ha i he limi: lim f(), lim f(), i =,,..., n, all exi. i i EXMPLE. Le f:ir where I=[,5] be defined a follow: ( ) f() 3 3 3 4 4 5 \ / \)) ))) / * *)))))))) )))))))))))) 3 4 5 CLSS EXERCISE True or Fale. f i coninuou on (,3].. f i coninuou on [,3]. 3. f i coninuou on [3,5]. 4. f i piecewie coninuou on [,5]. 5. f i piecewie coninuou on [,3]. 6. f i piecewie coninuou on [,3]. THEOREM #. Sum and produc of piecewie coninuou funcion are piecewie coninuou. Ch. 7 Pg. 4

lo calar muliple of piecewie coninuou funcion are alo piecewie coninuou funcion. THEOREM #3. The e of piecewie coninuou funcion on he cloed inerval I = [α,β], denoed by PC( I ) = PC[α,β], i a ubpace of he vecor pace F( I ) of all real valued funcion on he cloed inerval I. In mahemaical (and phyical) problem he value of a piecewie coninuou funcion a he poin of diconinuiy uually doe no maer and we uually do no wih o diinguih beween wo piecewie coninuou funcion ha differ only a heir poin of diconinuiy. One way o eliminae he diincion beween wo piecewie coninuou funcion ha differ only a heir poin of diconinuiy i o ue he concep of an equivalence cla. (Look up he definiion of an equivalence relaion in a modern algebra ex.) ll piecewie coninuou funcion ha differ only a heir poin of diconinuiy are aid o be in he ame equivalence cla and we perform Laplace ranformaion on equivalence clae of funcion. n eaier way concepually i o imply pecify a unique funcion in each equivalence cla which we place in a new e we call PC a [α,β] (a i for average). Le fpc[α,β]. If f i diconinuou a α, hen redefine f(α) a f(α) = lim f(). Similarly, if f i diconinuou a β, redefine f(β) a f(β) = lim f(). any oher poin of diconinuiy le f(x) = [f(x) + f(x+)]/ where f() = lim f(h) and f(x+) = lim f(). Since he new f only differ from he old f a he poin of h h diconinuiy, hey are in he ame equivalence cla. (There i a mo one coninuo funcion in each equivalence cla.) Le PC a [α,β] be he e of all uch funcion (a and for average value). We ee ha we have exacly one funcion from each equivalence cla. lo, if we add uch funcion ogeher, we ge uch a funcion. Such funcion are alo cloed under calar muliplicaion. Hence hey form a ubpace of PC[α,β], bu each having unique value a he poin of diconinuiy. THEOREM #4. Le f be a real valued funcion of a real variable whoe domain include he cloed inerval [α,β]. Suppoe ha f i piecewie coninuou on I. Then he Riemann Inegral f() d and f() e d boh exi. lo, if fpc a [α,β], hen f() d = for all x[α,β] implie ha f() = for all [α,β]; ha i, he zero funcion i he only funcion in PC a [α,β] wih hi propery. (Such funcion are called null funcion and we wih he zero funcion o be he only null funcion in our funcion pace.) DEFINITION #4. If he domain of a funcion i [,), and f PC[,] >, hen we ay f i piecewie coninuou on [,). If for all >, f PC a [,], hen f PC a [,). THEOREM #5. The e of piecewie coninuou funcion on I = [,), denoed by PC[,) i a ubpace of he e of all real valued funcion on I. PC a [,) i a ubpace of PC[,). x Ch. 7 Pg. 5

To inure ha he Laplace ranform exi, we no only need for he proper inegral on [,] o exi for all, we need for he funcion f() e o grow ufficienly lowly o ha he improper inegral exi. DEFINITION #5. funcion f:[,)r i aid o be of exponenial order if here exi conan K, a, and M uch ha *f()* Ke a M. THEOREM #6. Sum and produc of funcion of exponenial order, are of exponenial order. Noe alo ha calar muliple of funcion of exponenial order are of exponenial order. In fac, THEOREM #7. The e of funcion of exponenial order, denoed by E xp, i a ubpace of he e (I,R) of all real valued funcion on I = [,). THEOREM #8. Suppoe ha ) f i piecewie coninuou on [,); ha i, f i piecewie coninuou on he inerval [,] > and ) f i of exponenial order o ha here exi K, a, and M uch ha *f()* Ke a M, hen he Laplace ranform {f()} = F() = f() e d exi wih domain (a,). i.e. for > a. THEOREM #9. PC[,) E xp i a ubpace of T. So i T pcexp = PC a [,) E xp. EXMPLE #3 Compue {f()} = F() where f() = for. Soluion. We wih o compue {f()} = F() = {}. = {e a lim e / ( ) } = f() e d = lim e d = = = = lim e = if - < ( > ) lim e () e We coninue our able of Laplace Tranform. Ch. 7 Pg. 6

PRTIL TBLE OF LPLCE TRNSFORMS Time Domain (Complex) Frequency Domain f() F() > e a /(-a) > a / > Noe ha he new enry i ju a pecial cae of he old enry, e a, wih a =. EXMPLE #4 Compue {f()} = F() where f() = in(a) for. Soluion. We wih o compue {f()} = F() = {in(a)}. {in(a)} = [in (a)] e d = lim [in (a)] e d = We fir compue he aniderivaive (or look i up in a able) Compuaion of he niderivaive Ue inegraion by par. Le e in a e a co a e in a e a co a I = in(a) e d = d = + d u = in(a) dv = e du = a co(a) v = e /() Bu co(a) e d = e co a - e a in a e co a e a in a d = d u = co(a ) dv = e du = -a in(a) v = e /(-) Hence e in a a e in a e co a e a in a I = + co(a) e d = + [ d ] a e in a e co a a e in a e co a a = + [ I ] = I Hence a e in a e co a + a e in a e co a I + I = o ha I =, - e in a - a e co a ( + a ) I = e in(a) a e co(a) and hence I =. a Back o compuing he Laplace Tranform a Ch. 7 Pg. 7

F() = {in(a)} = lim - e in a - a e co a a () () - e in a - a e co a - e in a() - a e co a() = lim a a - e co a - a e co a a a = lim = >. a a a We coninue our able of Laplace Tranform. PRTIL TBLE OF LPLCE TRNSFORMS Time Domain (Complex) Frequency Domain f() F() > e a /(-a) > a / > in(a) a a > EXERCISES on Compuaion of he Laplace Tranform Uing he Definiion EXERCISE#. Provide a more rigorou aemen of Theorem # for funcion defined on he cloed inerval I = [α,β]. EXERCISE #. Provide a more rigorou aemen of Theorem #6 by including pecific. Ch. 7 Pg. 8

Laplace Tranform- PRTIL TBLE OF NTIDERIVTIVES Handou # (INDEFINITE) INTEGRLS Profeor Moeley.. 3. 4. 5. 6. 7. 8. 9.. Ch. 7 Pg. 9

Laplace Tranform- PROPERTIES OF LPLCE TRNSFORMS: Handou #3 LINERITY Profeor Moeley Read he inroducion and Secion 6. of Chaper 6 of ex (Elem. Diff. Eq. and BVP by Boyce and Diprima, evenh ed.) again. Pay paricular aenion o Example -6 page 94-97. Pay pecial aenion o he paragraph afer Example 6, in paricular Equaion (5). The e T = { f:[,)r * f ha a Laplace ranform } i a ubpace of he funcion pace ([,),R) vecor pace and hence i a vecor pace in i own righ. We have een ha he e T pcexp = PC[,) E xp = { f T : f i piecewie coninuou on [,) and of exponenial order } i a ubpace of T and hence a vecor pace in i own righ. THEOREM #. The Laplace ranform {f()} = f() e d = F() () i a linear operaor acing on he vecor pace T Proof: To verify ha i a linear operaor from T o F, we fir ae he definiion of a linear operaor. Definiion. n operaor T:V W (which map he vecor pace V o he vecor pace W) i aid o be linear if, V and calar α,β we have x x y y x y T(α + β ) = α T( ) + β T( ). () pplying () o we ee ha o how ha i i a linear operaor, we wih o verify he ideniy: {c f () + c f ()} = c {f ()} + c {f ()} c, c R, f, f T (3) We ue he andard forma for proving ideniie. Le c,c R and f,f T STTEMENT. {c f ()+c f ()}= [c f (x) c f (x)]e dx RESON. Def n. of Laplace Tran. = lim [c f (x) c f (x)]e dx Def n. of Improper Inegral = lim c [f (x)]e dx c [f (x)]e dx Propery of Riemann Inegral Ch. 7 Pg.

= lim c [f (x)]e dx lim c [f (x)]e dx Propery of Limi = c [f (x)]e dx c [f (x)]e dx Def n. of Improper Inegral = c { f () }+ c {f ()} Def n.of Laplace ranform QED. Thu if f() i a linear combinaion of funcion: f() = c f () + c f (), hen i Laplace ranform F() i a linear combinaion of ranform: F() = c F () + c F () where {f()} = F(), {f ()} = F (), and {f ()} = F (). We can ue lineariy o compue he ranform of linear combinaion of funcion in our able. EXMPLE # Compue {f()} = F() where f() = 3 e 3 + 5 in() for. Soluion. We wih o compue {f()} = F() = { 3 e 3 + 5 in()}. { 3 e 3 + 5 in() } = 3 { e 3 }+ 5 {in() } = 3 + 5. 3 When dealing wih Laplace ranform, i i uually no neceary or deirable o find a common 3 5 denominaor. However, imple arihmeic i expeced: F() = +. 3 EXERCISES on Properie of Laplace Tranform: Lineariy EXERCISES. Uing he able compued o far, find F() = {f()}() if a) f() = 4 e -3 + 5 b) f() = 4 e -3 + 5 e 4 + 3.5 c) f() = 8 e 8 + 9 e 7 + 3 in(3) Ch. 7 Pg.

Laplace Tranform- OTHER PROPERTIES OF Handou No. 4 THE LPLCE TRNSFORM Profeor Moeley Read Secion 6. - 6.3 of Chaper 6 of ex (Elem. Diff. Eq. and BVP by Boyce and Diprima, evenh ed.). Pay paricular aenion o Theorem 6.. on page 3, he Corollary on page 3, Theorem 6.3. on page 3, and Theorem 6.3. on page 33. THEOREM # Suppoe f T pcexp ; ha i, f i piecewie coninuou on [,] >, and of exponenial order o ha T,M and σ uch ha *f()*< Me σ >T. Then each of he following properie hold: d ) { f() } = { f() }(), > σ, d ) { e a f(r) } = { f() }(-a), > σ, Shifing propery, r 3) { f(r)dr } = { f() }(), r > σ, If in addiion, f i coninuou and f' piecewie coninuou on [,),hen 4) { f'() } = { f() } - f(), > σ. More generally, if f, f',..., f (n-), are coninuou on [,) and of exponenial order, and f (n) i piecewie coninuou on [,), hen 5) { f (n) () } = n { f() } ) n- f() ) f (n-) () ) f (n-) (), > σ. Specifically 6) { f"() } = { f() } - f() - f'(), > σ. Proof. Thee are all ideniie and can be verified uing he andard forma. We prove only ). ) hrough 6) are lef a exercie. For ) we ar wih he righ hand ide (RHS) STTEMENT. RESON. d d { f() }() = f()e d > σ Definiion of he Laplace Tranform d d d = lim f()e d > σ Definiion of an Improper Inegral d = lim d f()e d > σ Propery of limi and derivaive from d advanced analyi: The limi and derivaive can be wiched under cerain condiion. = lim > σ Propery of derivaive and inegral from advanced f()e d analyi. Derivaive and inegral can be wiched under cerain condiion. Derivaive become parial. Ch. 7 Pg.

= lim (-)f()e d > σ Propery of parial derivaive = lim f()e d > σ Properie of inegral and limi = f()e d > σ Definiion of improper inegral = { f() } Definiion of Laplace Tranform Q.E.D. EXMPLE # Compue {f()} = F() where f() = for. Soluion. We wih o compue {f()} = F() = { }. STTEMENT. RESON. { } = { () } lgebra d = ( { } ) d Par ) of heorem above d = ( ) ) d From he TBLE { } = d = - d lgebra = ( ) - Calculu = lgebra Similarly we can compue > 3 (3)() 3! 3 = > 4 4 nd by mahemaical inducion we can prove ha n! n > n+ We coninue he developmen of our able of Laplace Tranform. Ch. 7 Pg. 3

PRTIL TBLE OF LPLCE TRNSFORMS Time Domain (Complex) Frequency Domain f() F() > e a /(-a) > a / > in(a) a a > > > 3 (3)() 3! 3 = > 4 4 n! n > n+ Now by uing he lineariy of he Laplace Tranform, we can compue he ranform for any polynomial. EXMPLE # Compue {f()} = F() where f() = 3 + 5 + 7 for. Soluion. We wih o compue {f()} = F() = { 3 + 5 + 7 }. STTEMENT. RESON. { 3 + 5 + 7 } = 3 { } + 5 { } + 7 { } Lineariy of Laplace Tranform = 3 + 5 + 7 3 Table of known Laplace Tranform = 3 5 4 + + 3 lgebra We can ue Theorem # o obain oher ranform pair: EXMPLE #3 Compue {f()} = F() where f() = in(a) for. Soluion. We wih o compue {f()} = F() = { in(a) }. Ch. 7 Pg. 4

STTEMENT. RESON. d { in(a) } = ( { in(a) } ) d Par ) of heorem above d a = From he TBLE { in(a) } = d a d = lgebra d a a = a ( ) ( + a ) - () Calculu = a a lgebra EXMPLE #4 Compue {f()} = F() where f() = e a in(ω) for. Soluion. We wih o compue {f()} = F() = { e a in(ω) }. a a STTEMENT. RESON. { e a in(ω) } = { in(ω) }( - a ) Par ) of heorem above = (- a) From he TBLE {in(ω) } = EXMPLE #5 Compue {f()} = F() where f() = co(ω) for. Soluion. We wih o compue {f()} = F() = { co(ω) }. We will ue propery in( ) d in( ) 4): { f'() } = { f() } - f() wih f() = o ha f() = = co(ω). d in( ) in( ( ) ) in( ) Hence { co(ω) } = { } = { }= = We coninue he developmen of our able of Laplace Tranform. Ch. 7 Pg. 5

PRTIL TBLE OF LPLCE TRNSFORMS Time Domain (Complex) Frequency Domain f() F() > e a /(-a) > a / > in(a) a a > > > 3 3! 3 > 4 n! n > n+ a in(a) > a e a in(ω) co(ω) (- a) > a Ch. 7 Pg. 6

Laplace ranform TBLE OF LPLCE TRNSFORMS Handou No. 5 TO BE MEMORIZED Profeor Moeley lhough i i no reaonable o memorize all Laplace Tranform pair, i i reaonable o memorize he mo common one. Below i a li of he Laplace Tranform pair you mu memorize. f() F(S) = {f()}() Domain of F() )) > o )) > o )) 3 > o n n n! )) n+ > o e a )) a > a in(ω) co(ω) ω )))) + ω )))) + ω > o > o e a in(ω) e a co(ω) ω )))) ( a) + ω > a -a ))))) ( a) + ω > a Ch. 7 Pg. 7

EXERCISES on Oher Properie of he Laplace Tranform EXERCISE # Uing a Table and Your Knowledge find F() = {f()}() if ) f() = 3 + 4+5 ) f() = (+) 3) f() = in }Hin: Ue rig ideniie 4) f() = in (3) 5) f() = e 3 6) f() = e - 7) f() = e - co 3 Ch. 7 Pg. 8