QuantLib_FastFourierTransform man page

FastFourierTransform — FFT implementation.

Synopsis

#include <ql/math/fastfouriertransform.hpp>

Public Member Functions

FastFourierTransform (std::size_t order)

std::size_t output_size () const
The required size for the output vector.
template<typename InputIterator , typename RandomAccessIterator > void transform (InputIterator inBegin, InputIterator inEnd, RandomAccessIterator out) const
FFT transform.
template<typename InputIterator , typename RandomAccessIterator > void inverse_transform (InputIterator inBegin, InputIterator inEnd, RandomAccessIterator out) const
Inverse FFT transform.

Static Public Member Functions

static std::size_t min_order (std::size_t inputSize)
the minimum order required for the given input size

Detailed Description

FFT implementation.

Member Function Documentation

void transform (InputIterator inBegin, InputIterator inEnd, RandomAccessIterator out) const

FFT transform. The output sequence must be allocated by the user

void inverse_transform (InputIterator inBegin, InputIterator inEnd, RandomAccessIterator out) const

Inverse FFT transform. The output sequence must be allocated by the user.

Author

Generated automatically by Doxygen for QuantLib from the source code.

Referenced By

FastFourierTransform(3), inverse_transform(3), min_order(3) and output_size(3) are aliases of QuantLib_FastFourierTransform(3).

Fri Sep 23 2016 Version 1.8.1 QuantLib