Convolution is an extension of CompositeFunction which performs convolution of its members using Fast Fourier Transform.
Here is the first member function and is the second member. A Convolution must have exactly two member functions. The members can be composite if necessary. Interval is the fitting interval. The function is evaluated by first transforming and to the Fourier domain, multiplying the transforms, then transforming back to the original domain. The GSL FFT routines are used to do the actual transformations.
It should be noted that the two functions ( and ) are evaluated on different intervals. is computed on while is computed on , where .
In the following example a Convolution is convolved with a box function:
Note that the box function is defined on interval [-5, 5]:
Name | Type | Default | Description |
---|---|---|---|
FixResolution | |||
NumDeriv |
Categories: FitFunctions | General