Class AlgebraicFFT

java.lang.Object
org.episteme.core.mathematics.analysis.transform.AlgebraicFFT
public final class AlgebraicFFT extends Object
Algebraic Fast Fourier Transform (FFT).

Uses the Cooley-Tukey algorithm for efficient computation of the Discrete Fourier Transform (DFT). Designed for mathematical `Vector` objects.

Formerly known as FastFourierTransform.

Since:
1.0
Author:
Silvere Martin-Michiellot, Gemini AI (Google DeepMind)

  • Method Details

    • transform

      public static Vector<Complex> transform(Vector<Complex> input)
      Computes the Forward FFT of a complex vector.

      The input size must be a power of 2.

      Parameters:
      input - the input vector of complex numbers
      Returns:
      the transformed vector
      Throws:
      IllegalArgumentException - if input size is not a power of 2

    • inverseTransform

      public static Vector<Complex> inverseTransform(Vector<Complex> input)
      Computes the Inverse FFT of a complex vector.
      Parameters:
      input - the input vector of complex numbers
      Returns:
      the inverse transformed vector