Differential equations - inverse laplace transforms

sugarplum31
Messages
7
Reaction score
0

Homework Statement



We are given the following LaPlace Transformations and we are to find g(t) and h(t).

L(g)(t) = 1/[(1-e^(-2s))(s-1)]

L(h)(t) = (e^-s)/s(1-e^-s)

Homework Equations



By looking at the Table of LaPlace Transformations, the only one I found that could possibly work for both of these is

f(t+T) = f(t) ---> (integral from 0 to T of e^(-st)f(t) dt)/ 1-e^(-sT)

The Attempt at a Solution



For the first one, I broke it into two separate equations, 1/(1-e^-2s) * 1/(s-1) and for the second part it would be e^t. However, I am very confused on the equation I found in the Table and I'm not sure how to use it on either of these.
 
Physics news on Phys.org
sugarplum31 said:

Homework Equations



By looking at the Table of LaPlace Transformations, the only one I found that could possibly work for both of these is

f(t+T) = f(t) ---> (integral from 0 to T of e^(-st)f(t) dt)/ 1-e^(-sT)

That formula makes it easy to compute the Laplace transform of a periodic function, but I don't see how it's going to make it easy to do the inverse transform. I think the following is a better approach.

* Use the summation formula for convergent geometric series:

\sum_{n=0}^\infty x^n = \frac{1}{1-x}, |x|<1.

Here, x=e^-Ts. Since T>0, you can apply the above sum formula.

Once you have done that, then...

* Make repeated use the time shift property of Laplace transforms:

e^{-Ts}F(s) \longrightarrow f(t-T)U(t-T)

I think you'll have more success taking that route.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top