Fast Fourier Transform: Scaling Multi-Point Evaluationby@Vitalik
652 reads

Fast Fourier Transform: Scaling Multi-Point Evaluation

tldt arrow
Read on Terminal Reader
Read this story w/o Javascript

Too Long; Didn't Read

The Fast Fourier transform (FFT) is a key building block in many algorithms, including multiplication of large numbers and multiplication of polynomials. Fourier transforms also have important applications in signal processing, quantum mechanics, and other areas, and help make significant parts of the global economy happen. We'll talk about two different operations: multi-point polynomial evaluation (evaluating a degree) and its inverse, polynomial interpolation (given the evaluations of a degree <N polynomial at N different points)

Company Mentioned

Mention Thumbnail

Coin Mentioned

Mention Thumbnail
featured image - Fast Fourier Transform: Scaling Multi-Point Evaluation
Vitalik Buterin HackerNoon profile picture

@Vitalik

Vitalik Buterin

Receive Stories from @Vitalik

react to story with heart

RELATED STORIES

L O A D I N G
. . . comments & more!