mirror of
https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git
synced 2023-10-11 13:05:55 +08:00
87ef61ae23
* feat : Implemented Inverse Fast Fourier Transform
Slightly different from fast Fourier transform
Just the om variable declared in line 40 is divided by n
and swapping the testing inputs with testing outputs .
* Update numerical_methods/Inverse_fast_fourier_transform.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update numerical_methods/Inverse_fast_fourier_transform.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update numerical_methods/Inverse_fast_fourier_transform.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* formatting filenames
|
||
---|---|---|
.. | ||
bisection_method.cpp | ||
brent_method_extrema.cpp | ||
CMakeLists.txt | ||
composite_simpson_rule.cpp | ||
durand_kerner_roots.cpp | ||
false_position.cpp | ||
fast_fourier_transform.cpp | ||
gaussian_elimination.cpp | ||
golden_search_extrema.cpp | ||
inverse_fast_fourier_transform.cpp | ||
lu_decompose.cpp | ||
lu_decomposition.h | ||
midpoint_integral_method.cpp | ||
newton_raphson_method.cpp | ||
ode_forward_euler.cpp | ||
ode_midpoint_euler.cpp | ||
ode_semi_implicit_euler.cpp | ||
qr_decompose.h | ||
qr_decomposition.cpp | ||
qr_eigen_values.cpp | ||
rungekutta.cpp | ||
successive_approximation.cpp |