Fourier SeriesFourier series are demonstrated by building a square wave and a sawtooth wave as sums of sine waves. We see how adding more terms to the sum gets us closer to the desired wave forms. |
Document |
Code |

Fourier TransformWe use the fast Fourier transform (FFT) to calculate the spectrum of a simple sine wave, a sum of two sine waves, and a decaying sine wave. Users that run the program may change the frequency, the decay rate, and other parameters and see how they affect the results. |
Document |
Code |

Correlation of Noisy SignalsCorrelation of noisy signals is demonstrated using the fast Fourier transform (FFT) algorithm. We show how important it is to correctly filter the signals before calculating the correlation. |
Document |
Code |

Nonlinear FitAn implementation of the Levenberg-Marquardt algorithm is used to demonstrate fitting of experimental data to a given model. The model we use in this example is a sum of three Gaussians with variable positions, amplitudes, and widths. |
Document |
Code |

Towers of HanoiA recursive algorithm is demonstrated by showing a solution to the well known game - the Towers of Hanoi. |
Document |
Code |