|
Software: |
To fit a tabulated function with a Fourier approximation Fast Fourier Transform methods are used. This type of method factors the Fourier transform into the product of two transforms, if the number M of data points can be factored. Using complex notation, the coefficients are given by 1
M-1
2pi We will assume the interval to be [0,2p] so its length is L=2p. Also, the points are assumed to be evenly spaced and M is assumed to be even. Let's call M=M0. If M0 is factorable into M0=H0 H1 we write
2p Some manipulation would bring us to the desired factorization: 1 H0-1
2pi
H1-1
2pi Of course, if H1 can be in turn factored, then the second å can be further factored into two other å's. With multivariable functions the program takes advantage of the fact that the grid is rectangular to shorten the computations. An example of a tabulated function in two variables which
can be approximated by the FOURIER TRANSFORMS program is: The correlation coefficient is computed with
å
[festimated - fmean]2 where the summations are over all independent data points. The standard error of estimate is calculated using
å
[f - festimated ]2 where the summations are also over all independent data points. The festimated is found using the approximation obtained. |
|
Copyright © 2001-2010 Numerical Mathematics. All rights reserved.
|