Laplace Transform, Inversion & Convolution

The Laplace transform adds exponential damping so growth, derivatives, delays, and convolution become algebraic in a complex variable. This chapter keeps the region of convergence explicit, derives the derivative and shift rules, explains inversion, and works a complete initial-value problem without misusing the delay theorem.

The Laplace transform multiplies a time function by e−ste^{-st} before integrating. The real part of ss supplies adjustable exponential damping; the imaginary part supplies oscillation. This converts differentiation and causal convolution into algebra while preserving initial conditions, which is why the transform is effective for linear ODEs, circuits, and piecewise inputs.

Definition and region of convergence #

The unilateral Laplace transform is

F(s)=L{f}(s)=∫0∞e−stf(t) dt,s=σ+iω.F(s)=\mathcal L\{f\}(s)=\int_0^{\infty}e^{-st}f(t)\,dt, \qquad s=\sigma+i\omega.

If ff is piecewise continuous on finite intervals and ∣f(t)∣≤Meαt|f(t)|\le Me^{\alpha t} for large tt, then the integral converges absolutely for Res>α\mathop{\mathrm{Re}}s>\alpha. In that half-plane, FF is holomorphic.

The region of convergence is part of the transform. The same algebraic expression can represent different time functions in the bilateral transform if the region differs. For unilateral causal problems, the right-half-plane ROC is often implicit, but it should still be checked.

If tt has units of seconds, then ss has units s−1\mathrm{s}^{-1}. The exponential stst must be dimensionless. Unless ff already includes compensating units, integration contributes a factor of time to the units of FF.

Core transform pairs #

For the indicated half-planes:

f(t)f(t) for t≥0t\ge0 F(s)F(s) ROC
11 1/s1/s Res>0\mathop{\mathrm{Re}}s>0
eate^{at} 1/(s−a)1/(s-a) Res>Rea\mathop{\mathrm{Re}}s>\mathop{\mathrm{Re}}a
tnt^n n!/sn+1n!/s^{n+1} Res>0\mathop{\mathrm{Re}}s>0
sin⁡ω0t\sin\omega_0t ω0/(s2+ω02)\omega_0/(s^2+\omega_0^2) Res>0\mathop{\mathrm{Re}}s>0
cos⁡ω0t\cos\omega_0t s/(s2+ω02)s/(s^2+\omega_0^2) Res>0\mathop{\mathrm{Re}}s>0

These are seeds for algebra, not a substitute for the definition. A table entry without its ROC and convention is incomplete.

Differentiation carries the initial data #

Integration by parts gives

L{f′(t)}=sF(s)−f(0+).\mathcal L\{f'(t)\}=sF(s)-f(0^+).

Applying the rule repeatedly,

L{f(n)(t)}=snF(s)−sn−1f(0+)−sn−2f′(0+)−⋯−f(n−1)(0+).\mathcal L\{f^{(n)}(t)\} =s^nF(s)-s^{n-1}f(0^+)-s^{n-2}f'(0^+)-\cdots-f^{(n-1)}(0^+).

For example,

L{f′′}=s2F(s)−sf(0+)−f′(0+).\mathcal L\{f''\}=s^2F(s)-sf(0^+)-f'(0^+).

The factor s2s^2 is essential. Transforming an initial-value problem works because these boundary terms carry the initial state into the algebraic equation.

Time integration divides by ss:

L{∫0tf(τ) dτ}=F(s)s.\mathcal L\left\{\int_0^t f(\tau)\,d\tau\right\}=\frac{F(s)}s.

Multiplication by time differentiates in the transform variable:

L{tnf(t)}=(−1)ndnFdsn.\mathcal L\{t^nf(t)\}=(-1)^n\frac{d^nF}{ds^n}.

Two different shift rules #

Multiplying by an exponential shifts ss:

L{eatf(t)}=F(s−a).\mathcal L\{e^{at}f(t)\}=F(s-a).

Delaying a causal waveform by a>0a>0 requires a Heaviside gate:

L{u(t−a)f(t−a)}=e−asF(s).\mathcal L\{u(t-a)f(t-a)\}=e^{-as}F(s).

For a finite gate,

u(t−a)−u(t−b)u(t-a)-u(t-b)

selects a≤t<ba\le t<b. This is the clean way to encode piecewise forcing before applying the delay rule.

Convolution is multiplication after transformation #

For causal functions,

(f∗g)(t)=∫0tf(τ)g(t−τ) dτ,(f*g)(t)=\int_0^t f(\tau)g(t-\tau)\,d\tau,

and

L{f∗g}=F(s)G(s).\mathcal L\{f*g\}=F(s)G(s).

Mechanically, convolution flips one input, shifts it, multiplies the overlap, and integrates. Systemically, if hh is an impulse response and uu an input, then

y(t)=(h∗u)(t)y(t)=(h*u)(t)

is the superposition of delayed impulse responses.

Differentiating a convolution exposes a boundary term:

ddt(f∗g)(t)=f(t)g(0+)+∫0tf(τ)g′(t−τ) dτ.\frac{d}{dt}(f*g)(t) =f(t)g(0^+)+\int_0^t f(\tau)g'(t-\tau)\,d\tau.

Any Duhamel formula that drops the first term must include a condition such as g(0+)=0g(0^+)=0 or use the alternate differentiated factor with its own boundary term.

Laplace region of convergence, causal delay, and convolution The top-left panel shades a right-half-plane region of convergence and places the Bromwich line inside it. The top-right panel contrasts an ungated time shift with a causal delayed waveform that is zero before the delay. The bottom panel shows convolution as flipping, sliding, multiplying over the overlap, and integrating. Region of convergence A delay is a gated shift Convolution: flip, slide, multiply, integrate σ iω α γ Bromwich line s = γ + iω Re s > α F is holomorphic here poles stay left of the line ungated f(t−a) may have values before a u(t−a)f(t−a) exactly zero a t t u(t−a)f(t−a) ↔ e⁻ᵃˢF(s) g(τ) g(−τ) f(τ) · g(t−τ) flip slide by t f(τ) g(t−τ) (f∗g)(t) = ∫₀ᵗ f(τ)g(t−τ)dτ — integrate the overlap-weighted product
The region of convergence constrains inversion, a true delay is zero before its gate, and convolution multiplies only after one function is flipped and slid over the other.

Inversion and poles #

Under standard regularity and growth conditions, the Bromwich inversion formula is

f(t)=12πilim⁡T→∞∫σ−iTσ+iTestF(s) ds,f(t)=\frac1{2\pi i} \lim_{T\to\infty} \int_{\sigma-iT}^{\sigma+iT}e^{st}F(s)\,ds,

where the vertical line lies to the right of the singularities and inside the ROC.

For rational FF, partial fractions are usually simpler. A simple pole at s=ps=p contributes a term proportional to epte^{pt}. A repeated pole of order mm contributes tm−1eptt^{m-1}e^{pt} terms. Complex-conjugate poles combine into real damped sinusoids when the original signal is real.

Poles describe modes, but the ROC and cancellations still matter. A pole-zero cancellation in an algebraic transfer function can hide an internal mode in a state-space realization; transform algebra alone does not prove internal stability.

Worked physical example: an RC step response #

For an ideal first-order resistor–capacitor model, let τ=RC=2 s\tau=RC=2\ \mathrm s be the time constant and V0=5 VV_0=5\ \mathrm V the step amplitude. Zero initial capacitor voltage gives

τv′(t)+v(t)=V0,v(0)=0.\tau v'(t)+v(t)=V_0, \qquad v(0)=0.

Transforming the equation gives

(τs+1)V(s)=V0s,(\tau s+1)V(s)=\frac{V_0}{s},

so

V(s)=V0s(τs+1)=V0s−V0s+1/τ.V(s)=\frac{V_0}{s(\tau s+1)} =\frac{V_0}{s}-\frac{V_0}{s+1/\tau}.

Inverting,

v(t)=V0(1−e−t/τ).v(t)=V_0\left(1-e^{-t/\tau}\right).

At one time constant, v(2 s)≈3.16 Vv(2\ \mathrm s)\approx3.16\ \mathrm V, or 63.2%63.2\% of the final value. At three time constants, v(6 s)≈4.75 Vv(6\ \mathrm s)\approx4.75\ \mathrm V, or 95.0%95.0\%. The transform-domain fractions expose the constant steady response and the decaying pole at s=−1/τs=-1/\tau before the inverse is taken.

Worked initial-value problem #

Solve

y′′+3y′+2y=1,y(0)=0,y′(0)=0.y''+3y'+2y=1,\qquad y(0)=0,\qquad y'(0)=0.

Let Y(s)=L{y}Y(s)=\mathcal L\{y\}. Transforming each term gives

(s2Y)+(3sY)+2Y=1s,(s^2Y)+(3sY)+2Y=\frac1s,

so

Y(s)=1s(s+1)(s+2)=12s−1s+1+12(s+2).Y(s)=\frac1{s(s+1)(s+2)} =\frac1{2s}-\frac1{s+1}+\frac1{2(s+2)}.

Therefore

y(t)=12−e−t+12e−2t,t≥0.y(t)=\frac12-e^{-t}+\frac12e^{-2t},\qquad t\ge0.

Audit the result before trusting the algebra:

  • y(0)=1/2−1+1/2=0y(0)=1/2-1+1/2=0;
  • y′(0)=1−1=0y'(0)=1-1=0;
  • the transient exponentials decay;
  • the steady value 1/21/2 satisfies 2y=12y=1.

These checks catch missing initial terms and partial-fraction signs quickly.

Unilateral versus bilateral transforms #

The bilateral transform integrates over the whole real line:

F(s)=∫−∞∞e−stf(t) dt.F(s)=\int_{-\infty}^{\infty}e^{-st}f(t)\,dt.

Its ROC is typically a vertical strip and is indispensable for distinguishing right-sided, left-sided, and two-sided signals. The unilateral transform is tailored to causal initial-value problems and uses 0+0^+ data. Do not move formulas between the two conventions without restating support and boundary terms.

Diagnostic checklist #

  • State unilateral or bilateral convention and the ROC.
  • Carry f(0+),f′(0+),…f(0^+),f'(0^+),\ldots through every derivative transform.
  • Use u(t−a)f(t−a)u(t-a)f(t-a) for a true delay; do not attach e−ase^{-as} to an ungated algebraic shift.
  • Verify partial fractions by recombining them.
  • Check inverse results against initial values, the original equation, and long-time behavior.
  • In convolution or Duhamel formulas, retain the boundary term unless an explicit zero condition removes it.
  • For inversion contours, place the vertical line inside the ROC and to the right of relevant singularities.

Sources

  1. bookSeries, Functions of a Complex Variable and Operational Calculus: Lecture Notes and Practicumpdfnotes
  2. docsNIST DLMF §1.14(iii) — Laplace Transform
  3. docsMIT OCW 18.04 Topic 12 — Laplace Transform
  4. docsMIT OCW 2.161 — The Laplace Transform
  5. docsMIT OCW 18.03SC — Fourier Series and Laplace Transform
  6. bookOpenStax Calculus Volume 2 §3.7 — Improper Integrals

Searches titles, aliases, headings, summaries, and full text.↑↓ move ↵ open esc close