diff --git a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg index c072bbbf3..7f693e43e 100644 --- a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg +++ b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg @@ -1,7 +1,7 @@ - diff --git a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg index e0f5a9998..71a2ef85e 100644 --- a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg +++ b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - diff --git a/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg index b3b062acd..6b817c557 100644 --- a/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg +++ b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg @@ -1,7 +1,7 @@ - - - diff --git a/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg index 7e12bb786..009961780 100644 --- a/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg +++ b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 11b03d5e1..0e1ab80b0 100644 --- a/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - diff --git a/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg index a0de5227b..208d811bb 100644 --- a/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg +++ b/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg @@ -1,7 +1,7 @@ - - + + + + + + + diff --git a/d0/d15/fast__fourier__transform_8cpp__incl.md5 b/d0/d15/fast__fourier__transform_8cpp__incl.md5 new file mode 100644 index 000000000..9f865cdbe --- /dev/null +++ b/d0/d15/fast__fourier__transform_8cpp__incl.md5 @@ -0,0 +1 @@ +27d2c5f3e1ad8b3d762fb8e25121540b \ No newline at end of file diff --git a/d0/d15/fast__fourier__transform_8cpp__incl.svg b/d0/d15/fast__fourier__transform_8cpp__incl.svg new file mode 100644 index 000000000..483121cfe --- /dev/null +++ b/d0/d15/fast__fourier__transform_8cpp__incl.svg @@ -0,0 +1,98 @@ + + + + + + +numerical_methods/fast_fourier_transform.cpp + + + +Node1 + + +numerical_methods/fast +_fourier_transform.cpp + + + + + +Node2 + + +cassert + + + + + +Node1->Node2 + + + + + +Node3 + + +cmath + + + + + +Node1->Node3 + + + + + +Node4 + + +complex + + + + + +Node1->Node4 + + + + + +Node5 + + +iostream + + + + + +Node1->Node5 + + + + + +Node6 + + +vector + + + + + +Node1->Node6 + + + + + diff --git a/d0/d1f/structnode__coll__graph.svg b/d0/d1f/structnode__coll__graph.svg index 49c078599..e5c5e6c9e 100644 --- a/d0/d1f/structnode__coll__graph.svg +++ b/d0/d1f/structnode__coll__graph.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph_org.svg b/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph_org.svg index 2c0a1e8af..99d3b3077 100644 --- a/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph_org.svg +++ b/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph_org.svg b/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph_org.svg index c7b0657b9..b9f186290 100644 --- a/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph_org.svg +++ b/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - diff --git a/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph_org.svg b/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph_org.svg index f62c08cab..28e0f1a37 100644 --- a/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph_org.svg +++ b/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph_org.svg @@ -1,7 +1,7 @@ - - diff --git a/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph_org.svg b/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph_org.svg index 135cd2bc7..a25b21b6d 100644 --- a/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph_org.svg +++ b/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg index 54b6d6681..be594d746 100644 --- a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg +++ b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - diff --git a/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg index 5e12e132b..33b5cafe8 100644 --- a/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg +++ b/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - -
+
+Functions
numerical_methods Namespace Reference

for io operations More...

+ + + + + +

+Functions

std::complex< double > * FastFourierTransform (std::complex< double > *p, uint8_t n)
 FastFourierTransform is a recursive function which returns list of complex numbers. More...
 

Detailed Description

for io operations

Numerical Methods.

for std::map container

+

for std::vector

for math operations

Numerical methods

+

for assert for mathematical-related functions for storing points and coefficents for IO operations

+

Numerical algorithms/methods

for assert for math functions for integer allocation for std::atof for std::function for IO operations

Numerical algorithms/methods

-
+

Function Documentation

+ +

◆ FastFourierTransform()

+ +
+
+ + + + + + + + + + + + + + + + + + +
std::complex< double > * numerical_methods::FastFourierTransform (std::complex< double > * p,
uint8_t n 
)
+
+ +

FastFourierTransform is a recursive function which returns list of complex numbers.

+
Parameters
+ + + +
pList of Coefficents in form of complex numbers
nCount of elements in list p
+
+
+
Returns
p if n==1
+
+y if n!=1
+

Base Case To return

+

Declaring value of pi

+

Calculating value of omega

+

Coefficients of even power

+

Coefficients of odd power

+

Assigning values of even Coefficients

+

Assigning value of odd Coefficients

+

Recursive Call

+

Recursive Call

+

Final value representation list

+

Updating the first n/2 elements

+

Updating the last n/2 elements

+

Deleting dynamic array ye

+

Deleting dynamic array yo

+
40 {
+
41 if (n == 1) {
+
42 return p; /// Base Case To return
+
43 }
+
44
+
45 double pi = 2 * asin(1.0); /// Declaring value of pi
+
46
+
47 std::complex<double> om = std::complex<double>(
+
48 cos(2 * pi / n), sin(2 * pi / n)); /// Calculating value of omega
+
49
+
50 auto *pe = new std::complex<double>[n / 2]; /// Coefficients of even power
+
51
+
52 auto *po = new std::complex<double>[n / 2]; /// Coefficients of odd power
+
53
+
54 int k1 = 0, k2 = 0;
+
55 for (int j = 0; j < n; j++) {
+
56 if (j % 2 == 0) {
+
57 pe[k1++] = p[j]; /// Assigning values of even Coefficients
+
58
+
59 } else
+
60 po[k2++] = p[j]; /// Assigning value of odd Coefficients
+
61 }
+
62
+
63 std::complex<double> *ye =
+
64 FastFourierTransform(pe, n / 2); /// Recursive Call
+
65
+
66 std::complex<double> *yo =
+
67 FastFourierTransform(po, n / 2); /// Recursive Call
+
68
+
69 auto *y = new std::complex<double>[n]; /// Final value representation list
+
70
+
71 k1 = 0, k2 = 0;
+
72
+
73 for (int i = 0; i < n / 2; i++) {
+
74 y[i] =
+
75 ye[k1] + pow(om, i) * yo[k2]; /// Updating the first n/2 elements
+
76 y[i + n / 2] =
+
77 ye[k1] - pow(om, i) * yo[k2]; /// Updating the last n/2 elements
+
78
+
79 k1++;
+
80 k2++;
+
81 }
+
82
+
83 if(n!=2){
+
84
+
85 delete[] pe;
+
86 delete[] po;
+
87
+
88 }
+
89
+
90 delete[] ye; /// Deleting dynamic array ye
+
91 delete[] yo; /// Deleting dynamic array yo
+
92 return y;
+
93}
+ +
numerical_methods::FastFourierTransform
std::complex< double > * FastFourierTransform(std::complex< double > *p, uint8_t n)
FastFourierTransform is a recursive function which returns list of complex numbers.
Definition: fast_fourier_transform.cpp:40
+
std::pow
T pow(T... args)
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ diff --git a/globals_func_m.html b/globals_func_m.html index 6b9392b7d..b677eefe8 100644 --- a/globals_func_m.html +++ b/globals_func_m.html @@ -93,7 +93,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl  

- m -