Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Convolutions and Fourier Transforms. Definition. Suppose
 

Summary: Convolutions and Fourier Transforms.
Definition. Suppose
f : R R.
We say f is summable if f is integrable over each bounded interval (whatever that means) and
||f|| =

-
|f(x)| dx < .
Definition. Suppose f and g are summable. Then
f g(x) =

-
f(x - y)g(y) dy
is defined and continous for all x (althought this is not immediately obvious) and f g is summable. In fact
||f g|| =

-
|f g(x)| dx
=

  

Source: Allard, William K. - Department of Mathematics, Duke University

 

Collections: Mathematics