- 1 CLENSHAW, C . W. Curve-fitting with a digital computer, Comput. J . 2, 170-173.Google Scholar
- 2 WATT, J. M. A note on the evaluation of trigonometric series. Comput. J . 1, 162;Google Scholar
- 1 FISHER, R.A. Metron 5 (1925), 109-112.Google Scholar
- 2 Statistical Methods for Research Workers. Oliver and Boyd, Edinburgh, 1965.Google Scholar
- 3 Gosset W. S. (Student). The probable error of a mean. Biometrika 6 (1908), 1.Google ScholarCross Ref
- 4 ____, New tables for testing the significance of observations. Metron 5 (1925), 105.Google Scholar
- 5 GUILFORD, J. P. Fundamental Statistics in Psychology and Education. McGraw-Hill, New York, 1956, pp. 219-221.Google Scholar
- 6 IBBETSON, D. Algorithm 209, Gauss. Comm. ACM, 6 (Oct. 1963), 616. Google ScholarDigital Library
Recommendations
Algorithm 338: algol procedures for the fast Fourier transform
The following procedures are based on the Cooley-Tukey algorithm [1] for computing the finite Fourier transform of a complex data vector; the dimension of the data vector is assumed here to be a power of two. Procedure COMPLEXTRANSFORM computes either ...
Fast Fourier Transforms for Nonequispaced Data
A group of algorithms is presented generalizing the fast Fourier transform to the case of noninteger frequencies and nonequispaced nodes on the interval $[ - \pi ,\pi ]$. The schemes of this paper are based on a combination of certain analytical ...
Comments