Laplace transform

From testwiki
Jump to navigation Jump to search

Template:Short description Template:CS1 config In mathematics, the Laplace transform, named after Pierre-Simon Laplace (Template:IPAc-en), is an integral transform that converts a function of a real variable (usually Template:Tmath, in the time domain) to a function of a complex variable s (in the complex-valued frequency domain, also known as s-domain or s-plane). The functions are often denoted using a lowercase symbol for the time-domain function and the corresponding uppercase symbol for the frequency-domain function, e.g. x(t) and Template:Tmath.

The transform is useful for converting differentiation and integration in the time domain into the algebraic operations multiplication and division in the Laplace domain (analogous to how logarithms are useful for simplifying multiplication and division into addition and subtraction). This gives the transform many applications in science and engineering, mostly as a tool for solving linear differential equations[1] and dynamical systems by replacing ordinary differential equations and integral equations with algebraic polynomial equations, and by replacing convolution with multiplication.[2][3]

For example, through the Laplace transform, the equation of the simple harmonic oscillator (Hooke's law) x″(t)+kx(t)=0 is converted into the algebraic equation s2X(s)−sx(0)−x′(0)+kX(s)=0, which incorporates the initial conditions x(0) and Template:Tmath, and can be solved for the unknown function Template:Tmath. Once solved, the inverse Laplace transform can be used to transform it to the original domain. This is often aided by referencing tables such as that given below.

The Laplace transform is defined (for suitable functions Template:Tmath) by the integral ℒ{f}(s)=∫0∞f(t)e−stdt, where Template:Tmath is a complex number.

The Laplace transform is related to many other transforms. It is essentially the same as the Mellin transform and is closely related to the Fourier transform. Unlike for the Fourier transform, the Laplace transform of a function is often an analytic function, meaning that it can be expressed as a power series that converges locally, the coefficients of which represent the moments of the original function. Moreover, the techniques of complex analysis, especially contour integrals, can be used for simplifying calculations.

History

Pierre-Simon, marquis de Laplace

The Laplace transform is named after mathematician and astronomer Pierre-Simon, Marquis de Laplace, who used a similar transform in his work on probability theory.[4][5] Laplace wrote extensively about the use of generating functions (1814), and the integral form of the Laplace transform evolved naturally as a result.[6]

Laplace's use of generating functions was similar to what is now known as the z-transform, and he gave little attention to the continuous variable case which was discussed by Niels Henrik Abel.[7]

From 1744, Leonhard Euler investigated integrals of the form z=∫X(x)eaxdx and z=∫X(x)xAdx as solutions of differential equations, introducing in particular the gamma function.[8] Joseph-Louis Lagrange was an admirer of Euler and, in his work on integrating probability density functions, investigated expressions of the form ∫X(x)e−axaxdx, which resembles a Laplace transform.[9][10]

These types of integrals seem first to have attracted Laplace's attention in 1782, where he was following in the spirit of Euler in using the integrals themselves as solutions of equations.[11] However, in 1785, Laplace took the critical step forward when, rather than simply looking for a solution in the form of an integral, he started to apply the transforms in the sense that was later to become popular. He used an integral of the form ∫xsφ(x)dx, akin to a Mellin transform, to transform the whole of a difference equation, in order to look for solutions of the transformed equation. He then went on to apply the Laplace transform in the same way and started to derive some of its properties, beginning to appreciate its potential power.[12]

Laplace also recognised that Joseph Fourier's method of Fourier series for solving the diffusion equation could only apply to a limited region of space, because those solutions were periodic. In 1809, Laplace applied his transform to find solutions that diffused indefinitely in space.[13] In 1821, Cauchy developed an operational calculus for the Laplace transform that could be used to study linear differential equations in much the same way the transform is now used in basic engineering. This method was popularized, and perhaps rediscovered, by Oliver Heaviside around the turn of the century.[14]

Bernhard Riemann used the Laplace transform in his 1859 paper On the number of primes less than a given magnitude, in which he also developed the inversion theorem. Riemann used the Laplace transform to develop the functional equation of the Riemann zeta function, and his method is still used to relate the modular transformation law of the Jacobi theta function, which is readily proved via Poisson summation, to the functional equation.[15]

Hjalmar Mellin was among the first to study the Laplace transform rigorously in the Karl Weierstrass school of analysis, and apply it to the study of differential equations and special functions, at the turn of the 20th century.[16] At around the same time, Heaviside was busy with his operational calculus. Thomas Joannes Stieltjes considered a generalization of the Laplace transform connected to his work on moments. Other contributors in this time period included Mathias Lerch,[17] Oliver Heaviside, and Thomas Bromwich.[18]

In 1929, Vannevar Bush and Norbert Wiener published Operational Circuit Analysis as a text for engineering analysis of electrical circuits, applying both Fourier transforms and operational calculus, and in which they included one of the first predecessors of the modern table of Laplace transforms. In 1934, Raymond Paley and Norbert Wiener published the important work Fourier transforms in the complex domain, about what is now called the Laplace transform (see below). Also during the 30s, the Laplace transform was instrumental in Godfrey Harold Hardy and John Edensor Littlewood's study of tauberian theorems, and this application was later expounded on by Template:Harvtxt, who developed other aspects of the theory such as a new method for inversion. Edward Charles Titchmarsh wrote the influential Introduction to the theory of the Fourier integral (1937).

The current widespread use of the transform (mainly in engineering) came about during and soon after World War II,[19] replacing the earlier Heaviside operational calculus. The advantages of the Laplace transform had been emphasized by Gustav Doetsch.[20]

Formal definition

ℜ(e−st) for various complex frequencies in the Template:Math-domain Template:Tmath, which can be expressed as Template:Tmath. The axis at σ=0 contains pure cosines. Positive σ contains damped cosines. Negative σ contains exponentially growing cosines.

The Laplace transform of a function Template:Math, defined for all real numbers Template:Math, is the function Template:Math defined by Template:Equation box 1 where s is a complex frequency-domain parameter s=σ+iω with real numbers Template:Mvar and Template:Mvar.[21]

An alternate notation for the Laplace transform is Template:Anchorℒ{f} instead of Template:Math.[3] Thus F(s)=ℒ{f}(s) in functional notation. This is often written, especially in engineering settings, as Template:Tmath, with the understanding that the dummy variable t does not appear in the function Template:Tmath.

The meaning of the integral depends on types of functions of interest. A necessary condition for existence of the integral is that Template:Mvar must be locally integrable on Template:Closed-open. For locally integrable functions that decay at infinity or are of exponential type (Template:Tmath), the integral can be understood to be a (proper) Lebesgue integral. However, for many applications it is necessary to regard it as a conditionally convergent improper integral at Template:Math. Still more generally, the integral can be understood in a weak sense, and this is dealt with below.

One can define the Laplace transform of a finite Borel measure Template:Mvar by the Lebesgue integral[22] ℒ{μ}(s)=∫[0,∞)e−stdμ(t).

An important special case is where Template:Mvar is a probability measure, for example, the Dirac delta function. In operational calculus, the Laplace transform of a measure is often treated as though the measure came from a probability density function Template:Mvar. In that case, to avoid potential confusion, one often writes ℒ{f}(s)=∫0−∞f(t)e−stdt, where the lower limit of Template:Math is shorthand notation for limε→0+∫−ε∞.

This limit emphasizes that any point mass located at Template:Math is entirely captured by the Laplace transform. Although with the Lebesgue integral, it is not necessary to take such a limit, it does appear more naturally in connection with the Laplace–Stieltjes transform.

Bilateral Laplace transform

Template:Main

When one says "the Laplace transform" without qualification, the unilateral or one-sided transform is usually intended. The Laplace transform can be alternatively defined as the bilateral Laplace transform, or two-sided Laplace transform, by extending the limits of integration to be the entire real axis. If that is done, the common unilateral transform becomes a special case of the bilateral transform, where the definition of the function being transformed includes being multiplied by the Heaviside step function.

The bilateral Laplace transform Template:Math is defined as follows: Template:Equation box 1 An alternate notation for the bilateral Laplace transform is Template:Tmath, instead of Template:Mvar.

Inverse Laplace transform

Template:Main

Two integrable functions have the same Laplace transform only if they differ on a set of Lebesgue measure zero. This means that, on the range of the transform, there is an inverse transform. In fact, besides integrable functions, the Laplace transform is a one-to-one mapping from one function space into another in many other function spaces as well, although there is usually no easy characterization of the range.

Typical function spaces in which this is true include the spaces of bounded continuous functions, the space Template:Math, or more generally tempered distributions on Template:Open-open. The Laplace transform is also defined and injective for suitable spaces of tempered distributions.

In these cases, the image of the Laplace transform lives in a space of analytic functions in the region of convergence. The inverse Laplace transform is given by the following complex integral, which is known by various names (the Bromwich integral, the Fourier–Mellin integral, and Mellin's inverse formula): Template:Equation box 1 where Template:Mvar is a real number so that the contour path of integration is in the region of convergence of Template:Math. In most applications, the contour can be closed, allowing the use of the residue theorem. An alternative formula for the inverse Laplace transform is given by Post's inversion formula. The limit here is interpreted in the weak-* topology.

In practice, it is typically more convenient to decompose a Laplace transform into known transforms of functions obtained from a table and construct the inverse by inspection.

Probability theory

In pure and applied probability, the Laplace transform is defined as an expected value. If Template:Mvar is a random variable with probability density function Template:Mvar, then the Laplace transform of Template:Mvar is given by the expectation ℒ{f}(s)=E⁡[e−sX], where E⁡[r] is the expectation of random variable Template:Tmath.

By convention, this is referred to as the Laplace transform of the random variable Template:Mvar itself. Here, replacing Template:Mvar by Template:Math gives the moment generating function of Template:Mvar. The Laplace transform has applications throughout probability theory, including first passage times of stochastic processes such as Markov chains, and renewal theory.

Of particular use is the ability to recover the cumulative distribution function of a continuous random variable Template:Mvar by means of the Laplace transform as follows:[23] FX(x)=ℒ−1{1sE⁡[e−sX]}(x)=ℒ−1{1sℒ{f}(s)}(x).

Algebraic construction

The Laplace transform can be alternatively defined in a purely algebraic manner by applying a field of fractions construction to the convolution ring of functions on the positive half-line. The resulting space of abstract operators is exactly equivalent to Laplace space, but in this construction the forward and reverse transforms never need to be explicitly defined (avoiding the related difficulties with proving convergence).[24]

Region of convergence

Template:See also If Template:Math is a locally integrable function (or more generally a Borel measure locally of bounded variation), then the Laplace transform Template:Math of Template:Math converges provided that the limit limR→∞∫0Rf(t)e−stdt exists.

The Laplace transform converges absolutely if the integral ∫0∞|f(t)e−st|dt exists as a proper Lebesgue integral. The Laplace transform is usually understood as conditionally convergent, meaning that it converges in the former but not in the latter sense.

The set of values for which Template:Math converges absolutely is either of the form Template:Math or Template:Math, where Template:Math is an extended real constant with Template:Math (a consequence of the dominated convergence theorem). The constant Template:Math is known as the abscissa of absolute convergence, and depends on the growth behavior of Template:Math.[25] Analogously, the two-sided transform converges absolutely in a strip of the form Template:Math, and possibly including the lines Template:Math or Template:Math.[26] The subset of values of Template:Math for which the Laplace transform converges absolutely is called the region of absolute convergence, or the domain of absolute convergence. In the two-sided case, it is sometimes called the strip of absolute convergence. The Laplace transform is analytic in the region of absolute convergence: this is a consequence of Fubini's theorem and Morera's theorem.

Similarly, the set of values for which Template:Math converges (conditionally or absolutely) is known as the region of conditional convergence, or simply the region of convergence (ROC). If the Laplace transform converges (conditionally) at Template:Math, then it automatically converges for all Template:Math with Template:Math. Therefore, the region of convergence is a half-plane of the form Template:Math, possibly including some points of the boundary line Template:Math.

In the region of convergence Template:Math, the Laplace transform of Template:Math can be expressed by integrating by parts as the integral F(s)=(s−s0)∫0∞e−(s−s0)tβ(t)dt,β(u)=∫0ue−s0tf(t)dt.

That is, Template:Math can effectively be expressed, in the region of convergence, as the absolutely convergent Laplace transform of some other function. In particular, it is analytic. In its most general form, the Laplace transform gives a one-to-one correspondence between the holomorphic functions which, for some Template:Tmath, are defined on {s∈ℂ | Re(s)>σ} and are bounded there in absolute value by a polynomial, and the distributions on the real line supported on Template:Tmath which become tempered distributions after multiplied by e−σt for some Template:Tmath.[27]

There are several Paley–Wiener theorems concerning the relationship between the decay properties of Template:Math, and the properties of the Laplace transform within the region of convergence.

In engineering applications, a function corresponding to a linear time-invariant (LTI) system is stable if every bounded input produces a bounded output. This is equivalent to the absolute convergence of the Laplace transform of the impulse response function in the region Template:Math. As a result, LTI systems are stable, provided that the poles of the Laplace transform of the impulse response function have negative real part.

This ROC is used in knowing about the causality and stability of a system.

Properties and theorems

The Laplace transform's key property is that it converts differentiation and integration in the time domain into multiplication and division by Template:Math in the Laplace domain. Thus, the Laplace variable Template:Math is also known as an operator variable in the Laplace domain: either the derivative operator or (for Template:Math the integration operator.

Given the functions Template:Math and Template:Math, and their respective Laplace transforms Template:Math and Template:Math, f(t)=ℒ−1{F(s)},g(t)=ℒ−1{G(s)},

the following table is a list of properties of unilateral Laplace transform:[28]

Properties of the unilateral Laplace transform
Property Time domain Template:Math domain Comment
Linearity af(t)+bg(t)  aF(s)+bG(s)  Can be proved using basic rules of integration.
Frequency-domain derivative tf(t)  −F′(s)  Template:Math is the first derivative of Template:Math with respect to Template:Math.
Frequency-domain general derivative tnf(t)  (−1)nF(n)(s)  More general form, Template:Mathth derivative of Template:Math.
Derivative f′(t)  sF(s)−f(0−)  Template:Math is assumed to be a differentiable function, and its derivative is assumed to be of exponential type. This can then be obtained by integration by parts
Second derivative f″(t)  s2F(s)−sf(0−)−f′(0−)  Template:Math is assumed twice differentiable and the second derivative to be of exponential type. Follows by applying the Differentiation property to Template:Math.
General derivative f(n)(t)  snF(s)−∑k=1nsn−kf(k−1)(0−)  Template:Math is assumed to be Template:Math-times differentiable, with Template:Mathth derivative of exponential type. Follows by mathematical induction.
Frequency-domain integration 1tf(t)  ∫s∞F(σ)dσ  This is deduced using the nature of frequency differentiation and conditional convergence.
Time-domain integration ∫0tf(τ)dτ=(u∗f)(t) 1sF(s) Template:Math is the Heaviside step function and Template:Math is the convolution of Template:Math and Template:Math.
Frequency shifting eatf(t) F(s−a)
Time shifting f(t−a)u(t−a)

f(t)u(t−a) 

e−asF(s) 

e−asℒ{f(t+a)}

Template:Math, Template:Math is the Heaviside step function
Time scaling f(at) 1aF(sa) Template:Math
Multiplication f(t)g(t) 12πilimT→∞∫c−iTc+iTF(σ)G(s−σ)dσ  The integration is done along the vertical line Template:Math that lies entirely within the region of convergence of Template:Math.[29]
Convolution (f∗g)(t)=∫0tf(τ)g(t−τ)dτ F(s)⋅G(s) 
Circular convolution (f∗g)(t)=∫0Tf(τ)g(t−τ)dτ F(s)⋅G(s)  For periodic functions with period Template:Math.
Complex conjugation f∗(t) F∗(s∗)
Periodic function f(t) 11−e−Ts∫0Te−stf(t)dt Template:Math is a periodic function of period Template:Math so that Template:Math, for all Template:Math. This is the result of the time shifting property and the geometric series.
Periodic summation fP(t)=∑n=0∞f(t−Tn)

fP(t)=∑n=0∞(−1)nf(t−Tn)

FP(s)=11−e−TsF(s)

FP(s)=11+e−TsF(s)

Initial value theorem
f(0+)=lims→∞sF(s).
Final value theorem
Template:Tmath, if all poles of sF(s) are in the left half-plane.
The final value theorem is useful because it gives the long-term behaviour without having to perform partial fraction decompositions (or other difficult algebra). If Template:Math has a pole in the right-hand plane or poles on the imaginary axis (e.g., if f(t)=et or Template:Tmath), then the behaviour of this formula is undefined.

Relation to power series

The Laplace transform can be viewed as a continuous analogue of a power series.[30] If Template:Math is a discrete function of a positive integer Template:Math, then the power series associated to Template:Math is the series ∑n=0∞a(n)xn where Template:Math is a real variable (see Z-transform). Replacing summation over Template:Math with integration over Template:Math, a continuous version of the power series becomes ∫0∞f(t)xtdt where the discrete function Template:Math is replaced by the continuous one Template:Math.

Changing the base of the power from Template:Math to Template:Math gives ∫0∞f(t)(eln⁡x)tdt

For this to converge for, say, all bounded functions Template:Math, it is necessary to require that Template:Math. Making the substitution Template:Math gives just the Laplace transform: ∫0∞f(t)e−stdt

In other words, the Laplace transform is a continuous analog of a power series, in which the discrete parameter Template:Math is replaced by the continuous parameter Template:Math, and Template:Math is replaced by Template:Math.

Analogously to a power series, if Template:Tmath, then the power series converges to an analytic function in Template:Tmath, if Template:Tmath, the Laplace transform converges to an analytic function for Template:Tmath.Template:Sfn

Relation to moments

Template:Main

The quantities μn=∫0∞tnf(t)dt are the moments of the function Template:Math. If the first Template:Math moments of Template:Math converge absolutely, then by repeated differentiation under the integral, (−1)n(ℒf)(n)(0)=μn. This is of special significance in probability theory, where the moments of a random variable Template:Math are given by the expectation values Template:Tmath. Then, the relation holds μn=(−1)ndndsnE⁡[e−sX](0).

Transform of a function's derivative

It is often convenient to use the differentiation property of the Laplace transform to find the transform of a function's derivative. This can be derived from the basic expression for a Laplace transform as follows: ℒ{f(t)}=∫0−∞e−stf(t)dt=[f(t)e−st−s]0−∞−∫0−∞e−st−sf′(t)dt(by parts)=[−f(0−)−s]+1sℒ{f′(t)}, yielding ℒ{f′(t)}=s⋅ℒ{f(t)}−f(0−), and in the bilateral case, ℒ{f′(t)}=s∫−∞∞e−stf(t)dt=s⋅ℒ{f(t)}.

The general result ℒ{f(n)(t)}=sn⋅ℒ{f(t)}−sn−1f(0−)−⋯−f(n−1)(0−), where f(n) denotes the Template:Mathth derivative of Template:Math, can then be established with an inductive argument.

Evaluating integrals over the positive real axis

A useful property of the Laplace transform is the following: ∫0∞f(x)g(x)dx=∫0∞(ℒf)(s)⋅(ℒ−1g)(s)ds under suitable assumptions on the behaviour of Template:Tmath and Template:Tmath in a right neighbourhood of 0 and on the decay rate of Template:Tmath and Template:Tmath in a left neighbourhood of Template:Tmath. The above formula is a variation of integration by parts, with the operators ddx and ∫dx being replaced by ℒ and Template:Tmath. Let us prove the equivalent formulation: ∫0∞(ℒf)(x)g(x)dx=∫0∞f(s)(ℒg)(s)ds.

By plugging in (ℒf)(x)=∫0∞f(s)e−sxds the left-hand side turns into: ∫0∞∫0∞f(s)g(x)e−sxdsdx, but assuming Fubini's theorem holds, by reversing the order of integration we get the wanted right-hand side.

This method can be used to compute integrals that would otherwise be difficult to compute using elementary methods of real calculus. For example, the Dirichlet integral can be evaluated using the Laplace transform: ∫0∞sin⁡xxdx=∫0∞ℒ(1)(x)sin⁡xdx=∫0∞1⋅ℒ(sin⁡)(x)dx=∫0∞dxx2+1=π2.

Relationship to other transforms

Laplace–Stieltjes transform

The (unilateral) Laplace–Stieltjes transform of a function Template:Math is defined by the Lebesgue–Stieltjes integral {ℒ∗g}(s)=∫0∞e−stdg(t).

The function Template:Math is assumed to be of bounded variation. If Template:Math is the antiderivative of Template:Math: g(x)=∫0xf(t)dt

then the Laplace–Stieltjes transform of Template:Mvar and the Laplace transform of Template:Mvar coincide. In general, the Laplace–Stieltjes transform is the Laplace transform of the Stieltjes measure associated to Template:Mvar. So in practice, the only distinction between the two transforms is that the Laplace transform is thought of as operating on the density function of the measure, whereas the Laplace–Stieltjes transform is thought of as operating on its cumulative distribution function.[31]

Fourier transform

Template:Further

Let f be a complex-valued Lebesgue integrable function supported on Template:Tmath, and let F(s)=ℒf(s) be its Laplace transform. Then, within the region of convergence, we have F(σ+iτ)=∫0∞f(t)e−σte−iτtdt, which is the Fourier transform of the function Template:Tmath.[32]

Indeed, the Fourier transform is a special case (under certain conditions) of the bilateral Laplace transform. The main difference is that the Fourier transform of a function is a complex function of a real variable (frequency Template:Tmath), the Laplace transform of a function is a complex function of a complex variable (damping factor σ and frequency Template:Tmath). The Laplace transform is usually restricted to transformation of functions of Template:Math with Template:Math. A consequence of this restriction is that the Laplace transform of a function is a holomorphic function of the variable Template:Math. Unlike the Fourier transform, the Laplace transform of a distribution is generally a well-behaved function. Techniques of complex variables can also be used to directly study Laplace transforms. As a holomorphic function, the Laplace transform has a power series representation. This power series expresses a function as a linear superposition of moments of the function. This perspective has applications in probability theory.

Formally, the Fourier transform is equivalent to evaluating the bilateral Laplace transform with imaginary argument Template:Math[33][34] when the condition explained below is fulfilled, f̂(ω)=ℱ{f(t)}=ℒ{f(t)}|s=iω=F(s)|s=iω=∫−∞∞e−iωtf(t)dt.

This convention of the Fourier transform (Template:Tmath in Template:Section link) requires a factor of Template:Math on the inverse Fourier transform. This relationship between the Laplace and Fourier transforms is often used to determine the frequency spectrum of a signal or dynamical system.

The above relation is valid as stated if and only if the region of convergence (ROC) of Template:Math contains the imaginary axis, Template:Math.

For example, the function Template:Math has a Laplace transform Template:Math whose ROC is Template:Math. As Template:Math is a pole of Template:Math, substituting Template:Math in Template:Math does not yield the Fourier transform of Template:Math, which contains terms proportional to the Dirac delta functions Template:Math.

However, a relation of the form limσ→0+F(σ+iω)=f̂(ω) holds under much weaker conditions. For instance, this holds for the above example provided that the limit is understood as a weak limit of measures (see vague topology). General conditions relating the limit of the Laplace transform of a function on the boundary to the Fourier transform take the form of Paley–Wiener theorems.

Mellin transform

Template:Main

The Mellin transform and its inverse are related to the two-sided Laplace transform by a change of variables.

If in the Mellin transform G(s)=ℳ{g(θ)}=∫0∞θsg(θ)dθθ we set Template:Math we get a two-sided Laplace transform.

Z-transform

Template:Further

The unilateral or one-sided Z-transform is the Laplace transform of an ideally sampled signal with the substitution of z=defesT, where Template:Math is the sampling interval (in units of time e.g., seconds) and Template:Math is the sampling rate (in samples per second or hertz).

Let ΔT(t) =def ∑n=0∞δ(t−nT) be a sampling impulse train (also called a Dirac comb) and xq(t)=defx(t)ΔT(t)=x(t)∑n=0∞δ(t−nT)=∑n=0∞x(nT)δ(t−nT)=∑n=0∞x[n]δ(t−nT) be the sampled representation of the continuous-time Template:Math x[n]=defx(nT).

The Laplace transform of the sampled signal Template:Math is Xq(s)=∫0−∞xq(t)e−stdt=∫0−∞∑n=0∞x[n]δ(t−nT)e−stdt=∑n=0∞x[n]∫0−∞δ(t−nT)e−stdt=∑n=0∞x[n]e−nsT.

This is the precise definition of the unilateral Z-transform of the discrete function Template:Math X(z)=∑n=0∞x[n]z−n with the substitution of Template:Math.

Comparing the last two equations, we find the relationship between the unilateral Z-transform and the Laplace transform of the sampled signal, Xq(s)=X(z)|z=esT.

The similarity between the Z- and Laplace transforms is expanded upon in the theory of time scale calculus.

Borel transform

The integral form of the Borel transform F(s)=∫0∞f(z)e−szdz is a special case of the Laplace transform for Template:Math an entire function of exponential type, meaning that |f(z)|≤AeB|z| for some constants Template:Math and Template:Math. The generalized Borel transform allows a different weighting function to be used, rather than the exponential function, to transform functions not of exponential type. Nachbin's theorem gives necessary and sufficient conditions for the Borel transform to be well defined.

Fundamental relationships

Since an ordinary Laplace transform can be written as a special case of a two-sided transform, and since the two-sided transform can be written as the sum of two one-sided transforms, the theory of the Laplace-, Fourier-, Mellin-, and Z-transforms are at bottom the same subject. However, a different point of view and different characteristic problems are associated with each of these four major integral transforms.

Table of selected Laplace transforms

Template:Main

The following table provides Laplace transforms for many common functions of a single variable.[35][36] For definitions and explanations, see the Explanatory Notes at the end of the table.

Because the Laplace transform is a linear operator,

  • The Laplace transform of a sum is the sum of Laplace transforms of each term.ℒ{f(t)+g(t)}=ℒ{f(t)}+ℒ{g(t)}
  • The Laplace transform of a multiple of a function is that multiple times the Laplace transformation of that function.ℒ{af(t)}=aℒ{f(t)}

Using this linearity, and various trigonometric, hyperbolic, and complex number (etc.) properties and/or identities, some Laplace transforms can be obtained from others more quickly than by using the definition directly.

The unilateral Laplace transform takes as input a function whose time domain is the non-negative reals, which is why all of the time domain functions in the table below are multiples of the Heaviside step function, Template:Math.

The entries of the table that involve a time delay Template:Math are required to be causal (meaning that Template:Math). A causal system is a system where the impulse response Template:Math is zero for all time Template:Mvar prior to Template:Math. In general, the region of convergence for causal systems is not the same as that of anticausal systems.

Selected Laplace transforms
Function Time domain Template:Br f(t)=ℒ−1{F(s)} Laplace Template:Math-domain
F(s)=ℒ{f(t)}
Region of convergence Reference
unit impulse δ(t)  1 all Template:Math inspection
delayed impulse δ(t−τ)  e−τs  all Template:Math time shift ofTemplate:Brunit impulse
unit step u(t)  1s Re⁡(s)>0 integrate unit impulse
delayed unit step u(t−τ)  1se−τs Re⁡(s)>0 time shift ofTemplate:Brunit step
product of delayed function and delayed step f(t−τ)u(t−τ) e−sτℒ{f(t)} u-substitution, u=t−τ
rectangular impulse u(t)−u(t−τ) 1s(1−e−τs) Re⁡(s)>0
ramp t⋅u(t)  1s2 Re⁡(s)>0 integrate unitTemplate:Brimpulse twice
Template:Mathth power
(for integer Template:Math)
tn⋅u(t) n!sn+1 Re⁡(s)>0
(Template:Math)
integrate unitTemplate:Brstep Template:Math times
Template:Mathth power
(for complex Template:Math)
tq⋅u(t) Γ⁡(q+1)sq+1 Re⁡(s)>0
Re⁡(q)>−1
[37][38]
Template:Mathth root tn⋅u(t) 1s1n+1Γ⁡(1n+1) Re⁡(s)>0 Set Template:Math above.
Template:Mathth power with frequency shift tne−αt⋅u(t) n!(s+α)n+1 Re⁡(s)>−α Integrate unit step,
apply frequency shift
delayed Template:Mathth power
with frequency shift
(t−τ)ne−α(t−τ)⋅u(t−τ) n!⋅e−τs(s+α)n+1 Re⁡(s)>−α integrate unit step,Template:Brapply frequency shift,Template:Brapply time shift
exponential decay e−αt⋅u(t) 1s+α Re⁡(s)>−α Frequency shift ofTemplate:Brunit step
two-sided exponential decay Template:Br(only for bilateral transform) e−α|t|  2αα2−s2 −α<Re⁡(s)<α Frequency shift ofTemplate:Brunit step
exponential approach (1−e−αt)⋅u(t)  αs(s+α) Re⁡(s)>0 unit step minus
exponential decay
sine sin⁡(ωt)⋅u(t)  ωs2+ω2 Re⁡(s)>0 Template:Sfn
cosine cos⁡(ωt)⋅u(t)  ss2+ω2 Re⁡(s)>0 Template:Sfn
hyperbolic sine sinh⁡(αt)⋅u(t)  αs2−α2 Re⁡(s)>|α| Template:Sfn
hyperbolic cosine cosh⁡(αt)⋅u(t)  ss2−α2 Re⁡(s)>|α| Template:Sfn
exponentially decaying
sine wave
e−αtsin⁡(ωt)⋅u(t)  ω(s+α)2+ω2 Re⁡(s)>−α Template:Sfn
exponentially decaying
cosine wave
e−αtcos⁡(ωt)⋅u(t)  s+α(s+α)2+ω2 Re⁡(s)>−α Template:Sfn
natural logarithm ln⁡(t)⋅u(t) −1s[ln⁡(s)+γ] Re⁡(s)>0 Template:Sfn
Bessel function Template:Br of the first kind,
of order Template:Math
Jn(ωt)⋅u(t) (s2+ω2−s)nωns2+ω2 Re⁡(s)>0
(Template:Math)
Template:Sfn
Error function erf⁡(t)⋅u(t) 1ses2/4(1−erf⁡s2) Re⁡(s)>0 Template:Sfn
Explanatory notes:

Template:Col-begin Template:Col-break

Template:Col-break

Template:Col-end

s-domain equivalent circuits and impedances

The Laplace transform is often used in circuit analysis by conversions to the Template:Math-domain of circuit elements. Circuit elements can be transformed into impedances, very similar to phasor impedances.

Here is a summary of equivalents:

Template:Math-domain equivalent circuits
Template:Math-domain equivalent circuits

Note that the resistor is exactly the same in the time domain and the Template:Math-domain. The sources are put in if there are initial conditions on the circuit elements. For example, if a capacitor has an initial voltage across it, or if the inductor has an initial current through it, the sources inserted in the Template:Math-domain account for that.

The equivalents for current and voltage sources are derived from the transformations in the table above.

Examples and applications

The Laplace transform is used frequently in engineering and physics; the output of a linear time-invariant system can be calculated by convolving its unit impulse response with the input signal. Performing this calculation in Laplace space turns the convolution into a multiplication; the latter being easier to solve because of its algebraic form. For more information, see control theory. The Laplace transform is invertible on a large class of functions. Given a mathematical or functional description of an input or output to a system, the Laplace transform provides an alternative functional description that often simplifies the process of analyzing the behavior of the system, or in synthesizing a new system based on a set of specifications.[39]

The Laplace transform can also be used to solve differential equations and is used extensively in mechanical engineering and electrical engineering. The Laplace transform reduces a linear differential equation to an algebraic equation, which can then be solved by the formal rules of algebra. The original differential equation can then be solved by applying the inverse Laplace transform. English electrical engineer Oliver Heaviside first proposed a similar scheme, although without using the Laplace transform; and the resulting operational calculus is credited as the Heaviside calculus.

Evaluating improper integrals

Let Template:Tmath. Then (see the table above) ∂sℒ{f(t)t}=∂s∫0∞f(t)te−stdt=−∫0∞f(t)e−stdt=−F(s)

From which one gets: ℒ{f(t)t}=∫s∞F(p)dp.

In the limit Template:Tmath, one gets ∫0∞f(t)tdt=∫0∞F(p)dp, provided that the interchange of limits can be justified. This is often possible as a consequence of the final value theorem. Even when the interchange cannot be justified the calculation can be suggestive. For example, with Template:Math, proceeding formally one has ∫0∞cos⁡(at)−cos⁡(bt)tdt=∫0∞(pp2+a2−pp2+b2)dp=[12ln⁡p2+a2p2+b2]0∞=12ln⁡b2a2=ln⁡|ba|.

Complex impedance of a capacitor

In the theory of electrical circuits, the current flow in a capacitor is proportional to the capacitance and rate of change in the electrical potential (with equations as for the SI unit system). Symbolically, this is expressed by the differential equation i=Cdvdt, where Template:Math is the capacitance of the capacitor, Template:Math is the electric current through the capacitor as a function of time, and Template:Math is the voltage across the terminals of the capacitor, also as a function of time.

Taking the Laplace transform of this equation, we obtain I(s)=C(sV(s)−V0), where I(s)=ℒ{i(t)},V(s)=ℒ{v(t)}, and V0=v(0).

Solving for Template:Math we have V(s)=I(s)sC+V0s.

The definition of the complex impedance Template:Math (in ohms) is the ratio of the complex voltage Template:Math divided by the complex current Template:Math while holding the initial state Template:Math at zero: Z(s)=V(s)I(s)|V0=0.

Using this definition and the previous equation, we find: Z(s)=1sC, which is the correct expression for the complex impedance of a capacitor. In addition, the Laplace transform has large applications in control theory.

Impulse response

Consider a linear time-invariant system with transfer function H(s)=1(s+α)(s+β).

The impulse response is the inverse Laplace transform of this transfer function: h(t)=ℒ−1{H(s)}.

Partial fraction expansion

To evaluate this inverse transform, we begin by expanding Template:Math using the method of partial fraction expansion, 1(s+α)(s+β)=Ps+α+Rs+β.

The unknown constants Template:Math and Template:Math are the residues located at the corresponding poles of the transfer function. Each residue represents the relative contribution of that singularity to the transfer function's overall shape.

By the residue theorem, the inverse Laplace transform depends only upon the poles and their residues. To find the residue Template:Math, we multiply both sides of the equation by Template:Math to get 1s+β=P+R(s+α)s+β.

Then by letting Template:Math, the contribution from Template:Math vanishes and all that is left is P=1s+β|s=−α=1β−α.

Similarly, the residue Template:Math is given by R=1s+α|s=−β=1α−β.

Note that R=−1β−α=−P and so the substitution of Template:Math and Template:Math into the expanded expression for Template:Math gives H(s)=(1β−α)⋅(1s+α−1s+β).

Finally, using the linearity property and the known transform for exponential decay (see Item #3 in the Table of Laplace Transforms, above), we can take the inverse Laplace transform of Template:Math to obtain h(t)=ℒ−1{H(s)}=1β−α(e−αt−e−βt), which is the impulse response of the system.

Convolution

The same result can be achieved using the convolution property as if the system is a series of filters with transfer functions Template:Math and Template:Math. That is, the inverse of H(s)=1(s+α)(s+β)=1s+α⋅1s+β is ℒ−1{1s+α}∗ℒ−1{1s+β}=e−αt∗e−βt=∫0te−αxe−β(t−x)dx=e−αt−e−βtβ−α.

Phase delay

Time function Laplace transform
sin⁡(ωt+φ) ssin⁡(φ)+ωcos⁡(φ)s2+ω2
cos⁡(ωt+φ) scos⁡(φ)−ωsin⁡(φ)s2+ω2.

Starting with the Laplace transform, X(s)=ssin⁡(φ)+ωcos⁡(φ)s2+ω2 we find the inverse by first rearranging terms in the fraction: X(s)=ssin⁡(φ)s2+ω2+ωcos⁡(φ)s2+ω2=sin⁡(φ)(ss2+ω2)+cos⁡(φ)(ωs2+ω2).

We are now able to take the inverse Laplace transform of our terms: x(t)=sin⁡(φ)ℒ−1{ss2+ω2}+cos⁡(φ)ℒ−1{ωs2+ω2}=sin⁡(φ)cos⁡(ωt)+cos⁡(φ)sin⁡(ωt).

This is just the sine of the sum of the arguments, yielding: x(t)=sin⁡(ωt+φ).

We can apply similar logic to find that ℒ−1{scos⁡φ−ωsin⁡φs2+ω2}=cos⁡(ωt+φ).

Statistical mechanics

In statistical mechanics, the Laplace transform of the density of states g(E) defines the partition function.[40] That is, the canonical partition function Z(β) is given by Z(β)=∫0∞e−βEg(E)dE and the inverse is given by g(E)=12πi∫β0−i∞β0+i∞eβEZ(β)dβ

Spatial (not time) structure from astronomical spectrum

The wide and general applicability of the Laplace transform and its inverse is illustrated by an application in astronomy which provides some information on the spatial distribution of matter of an astronomical source of radiofrequency thermal radiation too distant to resolve as more than a point, given its flux density spectrum, rather than relating the time domain with the spectrum (frequency domain).

Assuming certain properties of the object, e.g. spherical shape and constant temperature, calculations based on carrying out an inverse Laplace transformation on the spectrum of the object can produce the only possible model of the distribution of matter in it (density as a function of distance from the center) consistent with the spectrum.[41] When independent information on the structure of an object is available, the inverse Laplace transform method has been found to be in good agreement.

Birth and death processes

Consider a random walk, with steps {+1,−1} occurring with probabilities Template:Tmath.[42] Suppose also that the time step is a Poisson process, with parameter Template:Tmath. Then the probability of the walk being at the lattice point n at time t is Pn(t)=∫0tλe−λ(t−s)(pPn−1(s)+qPn+1(s))ds(+e−λtwhen n=0). This leads to a system of integral equations (or equivalently a system of differential equations). However, because it is a system of convolution equations, the Laplace transform converts it into a system of linear equations for πn(s)=ℒ(Pn)(s), namely: πn(s)=λλ+s(pπn−1(s)+qπn+1(s))(+1λ+swhen n=0) which may now be solved by standard methods.

Tauberian theory

The Laplace transform of the measure μ on [0,∞) is given by ℒμ(s)=∫0∞e−stdμ(t). It is intuitively clear that, for small Template:Tmath, the exponentially decaying integrand will become more sensitive to the concentration of the measure μ on larger subsets of the domain. To make this more precise, introduce the distribution function: M(t)=μ([0,t)). Formally, we expect a limit of the following kind: lims→0+ℒμ(s)=limt→∞M(t). Tauberian theorems are theorems relating the asymptotics of the Laplace transform, as Template:Tmath, to those of the distribution of μ as Template:Tmath. They are thus of importance in asymptotic formulae of probability and statistics, where often the spectral side has asymptotics that are simpler to infer.[42]

Two Tauberian theorems of note are the Hardy–Littlewood Tauberian theorem and Wiener's Tauberian theorem. The Wiener theorem generalizes the Ikehara Tauberian theorem, which is the following statement:

Let Template:Tmath be a non-negative, monotonic nondecreasing function of Template:Tmath, defined for Template:Tmath. Suppose that f(s)=∫0∞A(x)e−xsdx converges for Template:Tmath to the function Template:Tmath and that, for some non-negative number Template:Tmath, f(s)−cs−1 has an extension as a continuous function for Template:Tmath. Then the limit as Template:Tmath goes to infinity of Template:Tmath is equal to Template:Tmath.

This statement can be applied in particular to the logarithmic derivative of Riemann zeta function, and thus provides an extremely short way to prove the prime number theorem.[43]

See also

Template:Portal Template:Div col

Template:Div col end

Notes

Template:Reflist

References

Modern

Historical

Further reading

Template:Wikiquote Template:Commons category

Template:Authority control