🌐 US-Proxy
id="topics">
TOPICS
Search

Convolution


A convolution is an integral that expresses the amount of overlap of one function g as it is shifted over another function f. It therefore "blends" one function with another. For example, in synthesis imaging, the measured dirty map is a convolution of the "true" CLEAN map with the dirty beam (the Fourier transform of the sampling distribution). The convolution is sometimes also known by its German name, faltung ("folding").

Convolution is implemented in the Wolfram Language as Convolve[f, g, x, y] and DiscreteConvolve[f, g, n, m].

Convolution defines a product on the algebra of Schwartz functions on R^n. For functions f and g that vanish for negative arguments, their convolution for t>=0 reduces to the finite interval [0,t] and is given by

 [f*g](t)=int_0^tf(tau)g(t-tau)dtau,
(1)

where the symbol [f*g](t) denotes convolution of f and g, provided the integral exists.

More generally, convolution is taken over the entire real line,

f*g=int_(-infty)^inftyf(tau)g(t-tau)dtau
(2)
=int_(-infty)^inftyg(tau)f(t-tau)dtau
(3)

(Bracewell 1965, p. 25), when the integral exists, with the variable (in this case t) implied, and also occasionally written as f tensor g.

Convolution of two rectangle functions
Convolution of two Gaussian functions

The animations above graphically illustrate the convolution of two boxcar functions (left) and two Gaussians (right). In the plots, the green curve shows the convolution of the blue and red curves as a function of t, the position indicated by the vertical green line. The gray region indicates the product g(tau)f(t-tau) as a function of tau for fixed t, so its area as a function of t is precisely the convolution. One feature to emphasize and which is not conveyed by these illustrations (since they both exclusively involve symmetric functions) is that the function g must be mirrored before lagging it across f and integrating.

The convolution of two boxcar functions f=Pi_(t_1,t_2)(t) and g=Pi_(u_1,u_2)(t) has the particularly simple form, for t_1<t_2 and u_1<u_2,

 f*g=[(t-t_1-u_1)H(t-t_1-u_1)-(t-t_2-u_1)H(t-t_2-u_1)
-(t-t_1-u_2)H(t-t_1-u_2)+(t-t_2-u_2)H(t-t_2-u_2)],
(4)

where H(x) is the Heaviside step function. The convolution of two Gaussians, with sigma_1>0 and sigma_2>0,

f=e^(-(t-mu_1)^2/(2sigma_1^2))/(sigma_1sqrt(2pi))
(5)
g=e^(-(t-mu_2)^2/(2sigma_2^2))/(sigma_2sqrt(2pi))
(6)

is another Gaussian

 f*g=1/(sqrt(2pi(sigma_1^2+sigma_2^2)))e^(-[t-(mu_1+mu_2)]^2/[2(sigma_1^2+sigma_2^2)]).
(7)

For the following algebraic and differentiation identities, let f, g, and h be Schwartz functions on R and a a constant. Convolution satisfies the properties

f*g=g*f
(8)
f*(g*h)=(f*g)*h
(9)
f*(g+h)=(f*g)+(f*h)
(10)

(Bracewell 1965, p. 27), as well as

a(f*g)=(af)*g
(11)
=f*(ag)
(12)

(Bracewell 1965, p. 49).

Taking the derivative of a convolution gives

(f*g)^'=f^'*g
(13)
=f*g^'
(14)

(Bracewell 1965, p. 119).

For Lebesgue-integrable functions f and g, the integral of their convolution is the product of their integrals,

int_(-infty)^infty(f*g)dt=int_(-infty)^infty[int_(-infty)^inftyf(u)g(t-u)du]dt
(15)
=int_(-infty)^inftyf(u)[int_(-infty)^inftyg(t-u)dt]du
(16)
=[int_(-infty)^inftyf(u)du][int_(-infty)^inftyg(t)dt].
(17)

For nonnegative functions f and g with finite second raw moments and positive finite integrals, the horizontal function centroids of their convolution add

 <t>_(f*g)=<t>_f+<t>_g,
(18)

and provided that either f or g has its function centroid at the origin, the second raw moments do as well

 <t^2>_(f*g)=<t^2>_f+<t^2>_g
(19)

(Bracewell 1965, p. 142), where

 <t^n>_f=(int_(-infty)^inftyt^nf(t)dt)/(int_(-infty)^inftyf(t)dt).
(20)

For cumulative distribution functions F and G, their convolution in probability theory is given by

 F(t)*G(t)=intF(t-x)dG(x),
(21)

where the Stieltjes integral is taken over the real line.


See also

Autocorrelation, Cauchy Product, Convolution Matrix, Convolution Theorem, Cross-Correlation, Recurrence Plot, Riesz Potential, Wiener-Khinchin Theorem Explore this topic in the MathWorld classroom

Explore with Wolfram|Alpha

References

Bracewell, R. "Convolution" and "Two-Dimensional Convolution." Ch. 3 in The Fourier Transform and Its Applications. New York: McGraw-Hill, pp. 25-50 and 243-244, 1965.Hirschman, I. I. and Widder, D. V. The Convolution Transform. Princeton, NJ: Princeton University Press, 1955.Morse, P. M. and Feshbach, H. Methods of Theoretical Physics, Part I. New York: McGraw-Hill, pp. 464-465, 1953.Press, W. H.; Flannery, B. P.; Teukolsky, S. A.; and Vetterling, W. T. "Convolution and Deconvolution Using the FFT." §13.1 in Numerical Recipes in FORTRAN: The Art of Scientific Computing, 2nd ed. Cambridge, England: Cambridge University Press, pp. 531-537, 1992.Weisstein, E. W. "Books about Convolution." http://www.ericweisstein.com/encyclopedias/books/Convolution.html.

Referenced on Wolfram|Alpha

Convolution

Cite this as:

Weisstein, Eric W. "Convolution." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Convolution.html

Subject classifications