FFT-based Convolution
quantlib-numerical
FFT-based Convolution
Convolve two sequences using FFT, which is more efficient than direct convolution for long sequences (O(n log n) vs O(n^2)). Convolution is fundamental in signal processing, filtering, polynomial multiplication, and probability distribution calculations. Returns the convolution of sequences a and b. [Tier: BASIC, Credits: 1]
POST
FFT-based Convolution
Authorizations
API key for authentication. Get your key at https://api.fincept.in/auth/register
Body
application/json
