21.04.2015 Views

Lecture Notes in Differential Equations - Bruce E. Shapiro

Lecture Notes in Differential Equations - Bruce E. Shapiro

Lecture Notes in Differential Equations - Bruce E. Shapiro

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

332 LESSON 32. THE LAPLACE TRANSFORM<br />

Solution. From the def<strong>in</strong>ition of the Laplace Transform<br />

L [ e 2t] =<br />

∫ ∞<br />

0<br />

e 2t e −st dt =<br />

= 1<br />

2 − s e(2−s)t ∣ ∣∣∣<br />

∞<br />

= 1<br />

s − 2<br />

0<br />

∫ ∞<br />

0<br />

e (2−s)t dt (32.5)<br />

(32.6)<br />

so long as s > 2 (32.7)<br />

Remark. As a generalization of the last example we can observe that<br />

L [ e at] = 1<br />

s − a , s > a (32.8)<br />

Def<strong>in</strong>ition 32.2 (Inverse Transform). If F (s) is the Laplace Transform of<br />

f(t) then we say that f(t) is the Inverse Laplace Transform of F (s) and<br />

write<br />

f(t) = L −1 [F (s)] (32.9)<br />

Example 32.3. From the example 32.1 we can make the follow<strong>in</strong>g observations:<br />

1. The Laplace Transform of the function f(t) = t is the function<br />

L[f(t)] = 1/s 2 .<br />

2. The Inverse Laplace Transform of the function F (s) = 1/s 2 is the<br />

function f(t) = t.<br />

In order to prove a condition that will guarantee the existence of a Laplace<br />

transform we will need some results from Calculus.<br />

Def<strong>in</strong>ition 32.3 (Exponentially Bounded). Suppose that there exist some<br />

constants K > 0, a, and M > 0, such that<br />

|f(t)| ≤ Ke at (32.10)<br />

for all t ≥ M. Then f(t) is said to be Exponentially Bounded.<br />

Def<strong>in</strong>ition 32.4 (Piecewise Cont<strong>in</strong>uous). A function is said to be Piecewise<br />

Cont<strong>in</strong>uous on an <strong>in</strong>terval (a, b) if the <strong>in</strong>terval can be partitioned<br />

<strong>in</strong>to a f<strong>in</strong>ite number of sub<strong>in</strong>tervals<br />

a = t 0 < t 1 < t 2 < · · · < t n = b (32.11)<br />

such that f(t) is cont<strong>in</strong>uous on each sub-<strong>in</strong>terval (t i , t i+1 ) (figure 32).

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!