| Home |
| About |
| Submission Guidelines |
| Search |
| Download |
project summary
Fast Fourier Transform
| Title: | Fast Fourier Transform |
| Author: | Clemens Ballarin |
| Submission date: | 2005-10-12 |
| Abstract: | We formalise a functional implementation of the FFT algorithm over the complex numbers, and its inverse. Both are shown equivalent to the usual definitions of these operations through Vandermonde matrices. They are also shown to be inverse to each other, more precisely, that composition of the inverse and the transformation yield the identity up to a scalar. |
| Status: [ok] | This is the development version of this entry generated for Isabelle-16-Sep-2009. The development version might change over time and is only permanently archived at Isabelle release points. It is provided as a preview of the next upcoming release. Please refer to release versions only in citations. If the status shows [FAIL], the links below will point to the last working version if any. |
|
Proof outline Proof document |
| Browse theories |
| Download this entry |
Older releases:
|