Introduction

This appendix describes some numerical methods useful in microcomputer-based data analysis. The fast Fourier transform function performs a discrete Fourier transform of a waveform sampled at periodic time intervals. The PARFIT function permits nonlinear fitting by varying parameters to minimize a goodness-of-fit quantity (such as chi-squared). The VARFIT function varies the parameters about their best-fit values to determine their statistical uncertainties. The ADSINT function performs numerical integration using adaptive quadrature and dynamically divides the integration interval into smaller steps to evaluate the integral with the desired accuracy and the minimum number of integrand evaluations. An example is given for computing the probability of exceeding a particular value of Student's t. Several methods for function inversion are given using both Newton's method and quadratic approximation. The ADSINT function and Newton's method were used to compute the chi-squared and Student's t probability tables in Chapter 5. The RAMDOME function provides floating point numbers randomly distributed between 0 and 1 with 231 different values, a period of 261 numbers, and with a low degree of correlation.

Fast Fourier transform

The fast Fourier transform (FFT) is discussed in Section 5.8. This algorithm is basically a way to compute the discrete Fourier transform rapidly.