fft_example.cc File Reference

Detailed demonstration of the Fast Fourier Transform (FFT). More...

#include <algorithm>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <numbers>
#include <vector>
#include <fft.H>
#include <print_rule.H>
#include <tpl_array.H>

Include dependency graph for fft_example.cc:

Go to the source code of this file.

Functions
int	main ()
	Main entry point.

Detailed Description

Detailed demonstration of the Fast Fourier Transform (FFT).

This example illustrates three primary use cases for the FFT:

1. Spectral Analysis: Breaking down a signal into its constituent frequencies.
2. Real-valued Convolution: Using the "Convolution Theorem" to filter data.
3. Polynomial Multiplication: Efficiently multiplying polynomials with complex coefficients.

Definition in file fft_example.cc.

Function Documentation

main()

int main

(

)

Main entry point.

Definition at line 669 of file fft_example.cc.

References Aleph::divide_and_conquer_partition_dp().