HOME PAGE - Companion material for the ArXiv paper:
"An Approximate Convolution Algorithm with Θ(n) Time and Θ(1) Auxiliary Space"
(Prof. T. Gastaldi, Dept. Statistics and Dept. Computer Science, Univ. Sapienza, Rome)
Benchmark 1 - Operational Integrity
FALC vs. FFT: The 100M Point Threshold
Direct computational benchmark comparing standard spectral methods against the FALC (Fast Approximate Linear Convolution) engine.
The test demonstrates a clear divergence: FFT reaches its threshold at 34M points, while FALC maintains operational continuity up to 100M points (10^8).
Author contact: WhatsApp chat: https://wa.link/bfrgne, Email:
tommaso.gastaldi@uniroma1.it
Related Resources
ArXiv Article: "An Approximate Convolution Algorithm with Θ(n) Time and Θ(1) Auxiliary Space"