<!-- iframe showing the search results (closed by default) -->
<divid="MSearchResultsWindow">
<iframesrc="javascript:void(0)"frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<divclass="header">
<divclass="headertitle">
<divclass="title">qr_decompose.h</div></div>
</div><!--header-->
<divclass="contents">
<ahref="../../d4/d68/qr__decompose_8h.html">Go to the documentation of this file.</a><divclass="fragment"><divclass="line"><aname="l00001"></a><spanclass="lineno"> 1</span> <spanclass="comment">/**</span></div>
<divclass="line"><aname="l00003"></a><spanclass="lineno"> 3</span> <spanclass="comment"> * \brief Library functions to compute [QR</span></div>
<divclass="line"><aname="l00004"></a><spanclass="lineno"> 4</span> <spanclass="comment"> * decomposition](https://en.wikipedia.org/wiki/QR_decomposition) of a given</span></div>
<divclass="line"><aname="l00022"></a><spanclass="lineno"><aclass="line"href="../../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a"> 22</a></span> <spanclass="keywordtype">void</span><aclass="code"href="../../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a">print_matrix</a>(<spanclass="keywordtype">double</span> **A, <spanclass="comment">/**< matrix to print */</span></div>
<divclass="line"><aname="l00023"></a><spanclass="lineno"> 23</span> <spanclass="keywordtype">int</span> M, <spanclass="comment">/**< number of rows of matrix */</span></div>
<divclass="line"><aname="l00024"></a><spanclass="lineno"> 24</span> <spanclass="keywordtype">int</span><aclass="code"href="../../dc/d18/structsudoku.html#a160365012280c3e10f1b31e914e8f129">N</a>) <spanclass="comment">/**< number of columns of matrix */</span></div>
<divclass="line"><aname="l00035"></a><spanclass="lineno"> 35</span> <spanclass="comment"> * Compute dot product of two vectors of equal lengths</span></div>
<divclass="line"><aname="l00071"></a><spanclass="lineno"> 71</span> <spanclass="comment"> * Compute projection of vector \f$\vec{a}\f$ on \f$\vec{b}\f$ defined as</span></div>
<divclass="line"><aname="l00080"></a><spanclass="lineno"> 80</span> <spanclass="keywordflow">if</span> (deno == 0) <spanclass="comment">/*! check for division by zero */</span></div>
<divclass="line"><aname="l00130"></a><spanclass="lineno"> 130</span> <spanclass="comment"> * Q &=& \begin{bmatrix}\mathbf{e}_0 & \mathbf{e}_1 & \mathbf{e}_2 & \dots &</span></div>
<divclass="line"><aname="l00134"></a><spanclass="lineno"> 134</span> <spanclass="comment"> *\langle\mathbf{e}_2\,,\mathbf{a}_2\rangle & \dots \\</span></div>
<divclass="line"><aname="l00135"></a><spanclass="lineno"> 135</span> <spanclass="comment"> * 0 & \langle\mathbf{e}_1\,,\mathbf{a}_1\rangle &</span></div>
<divclass="line"><aname="l00136"></a><spanclass="lineno"> 136</span> <spanclass="comment"> *\langle\mathbf{e}_2\,,\mathbf{a}_2\rangle & \dots\\</span></div>
<divclass="line"><aname="l00137"></a><spanclass="lineno"> 137</span> <spanclass="comment"> * 0 & 0 & \langle\mathbf{e}_2\,,\mathbf{a}_2\rangle & \dots\\</span></div>
<divclass="line"><aname="l00138"></a><spanclass="lineno"> 138</span> <spanclass="comment"> * \vdots & \vdots & \vdots & \ddots</span></div>
<divclass="line"><aname="l00145"></a><spanclass="lineno"> 145</span> <spanclass="keywordtype">int</span> M, <spanclass="comment">/**< number of rows of matrix A */</span></div>
<divclass="line"><aname="l00146"></a><spanclass="lineno"> 146</span> <spanclass="keywordtype">int</span><aclass="code"href="../../dc/d18/structsudoku.html#a160365012280c3e10f1b31e914e8f129">N</a><spanclass="comment">/**< number of columns of matrix A */</span></div>
<divclass="line"><aname="l00152"></a><spanclass="lineno"> 152</span> <spanclass="keywordflow">for</span> (<spanclass="keywordtype">int</span> i = 0; i <<aclass="code"href="../../dc/d18/structsudoku.html#a160365012280c3e10f1b31e914e8f129">N</a>;</div>
<divclass="line"><aname="l00153"></a><spanclass="lineno"> 153</span>  i++) <spanclass="comment">/* for each column => R is a square matrix of NxN */</span></div>
<divclass="line"><aname="l00170"></a><spanclass="lineno"> 170</span>  tmp_vector[j] = A[j][i]; <spanclass="comment">/* accumulator for uk */</span></div>
<divclass="line"><aname="l00175"></a><spanclass="lineno"> 175</span> <spanclass="keywordflow">for</span> (<spanclass="keywordtype">int</span> k = 0; k < M; k++) col_vector2[k] = Q[k][j];</div>
<divclass="line"><aname="l00187"></a><spanclass="lineno"> 187</span> <spanclass="comment">/* compute upper triangular values of R */</span></div>
<divclass="line"><aname="l00188"></a><spanclass="lineno"> 188</span> <spanclass="keywordflow">for</span> (<spanclass="keywordtype">int</span> kk = 0; kk < M; kk++) col_vector[kk] = Q[kk][i];</div>
<divclass="line"><aname="l00189"></a><spanclass="lineno"> 189</span> <spanclass="keywordflow">for</span> (<spanclass="keywordtype">int</span> k = i; k <<aclass="code"href="../../dc/d18/structsudoku.html#a160365012280c3e10f1b31e914e8f129">N</a>; k++)</div>
<divclass="line"><aname="l00191"></a><spanclass="lineno"> 191</span> <spanclass="keywordflow">for</span> (<spanclass="keywordtype">int</span> kk = 0; kk < M; kk++) col_vector2[kk] = A[kk][k];</div>
<divclass="ttc"id="astruct__large__num_html"><divclass="ttname"><ahref="../../d3/d5a/struct__large__num.html">_large_num</a></div><divclass="ttdoc">dynamically large number</div><divclass="ttdef"><b>Definition:</b> factorial_large_number.c:15</div></div>
<divclass="ttc"id="akohonen__som__trace_8c_html_a0283886819c7c140a023582b7269e2d0"><divclass="ttname"><ahref="../../d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><divclass="ttdeci">void test2()</div><divclass="ttdoc">Test that creates a random set of points distributed near the locus of the Lamniscate of Gerono and t...</div><divclass="ttdef"><b>Definition:</b> kohonen_som_trace.c:358</div></div>
<divclass="ttc"id="aunion__find_8c_html_a0592dba56693fad79136250c11e5a7fe"><divclass="ttname"><ahref="../../df/df3/union__find_8c.html#a0592dba56693fad79136250c11e5a7fe">MAX_SIZE</a></div><divclass="ttdeci">#define MAX_SIZE</div><divclass="ttdoc">maximum number of elements in the set</div><divclass="ttdef"><b>Definition:</b> union_find.c:8</div></div>
<divclass="ttc"id="astructadaline_html_a32e58c03fd9258709eae6138ad0ec657"><divclass="ttname"><ahref="../../d2/daa/structadaline.html#a32e58c03fd9258709eae6138ad0ec657">adaline::weights</a></div><divclass="ttdeci">double * weights</div><divclass="ttdoc">weights of the neural network</div><divclass="ttdef"><b>Definition:</b> adaline_learning.c:46</div></div>
<divclass="ttc"id="agroup__sudoku_html_ga702ff4f95dde780c7d04fcdd1021b6c1"><divclass="ttname"><ahref="../../d5/df4/group__sudoku.html#ga702ff4f95dde780c7d04fcdd1021b6c1">print</a></div><divclass="ttdeci">void print(const struct sudoku *a)</div><divclass="ttdoc">Print the matrix to stdout.</div><divclass="ttdef"><b>Definition:</b> sudoku_solver.c:126</div></div>
<divclass="ttc"id="akohonen__som__topology_8c_html_a6d0455dd5c30adda100e95f0423c786e"><divclass="ttname"><ahref="../../d2/df6/kohonen__som__topology_8c.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><divclass="ttdeci">void test3()</div><divclass="ttdoc">Test that creates a random set of points distributed in eight clusters in 3D space and trains an SOM ...</div><divclass="ttdef"><b>Definition:</b> kohonen_som_topology.c:609</div></div>
<divclass="ttc"id="agroup__hash_html_ga994ea8b243b6c0fbef734551ec5765dd"><divclass="ttname"><ahref="../../d7/d3b/group__hash.html#ga994ea8b243b6c0fbef734551ec5765dd">test_adler32</a></div><divclass="ttdeci">void test_adler32()</div><divclass="ttdoc">Test function for adler32.</div><divclass="ttdef"><b>Definition:</b> hash_adler32.c:38</div></div>
<divclass="ttc"id="astruct__cantor__set_html_a2f7f9f19125725d3e5673fdb4ac8cfb1"><divclass="ttname"><ahref="../../d9/dd7/struct__cantor__set.html#a2f7f9f19125725d3e5673fdb4ac8cfb1">_cantor_set::next</a></div><divclass="ttdeci">struct _cantor_set * next</div><divclass="ttdoc">pointer to next set</div><divclass="ttdef"><b>Definition:</b> cantor_set.c:15</div></div>
<divclass="ttc"id="astructobservation_html_a2db8ace685c08aa7b52f5a28b0843aab"><divclass="ttname"><ahref="../../d1/d5e/structobservation.html#a2db8ace685c08aa7b52f5a28b0843aab">observation::group</a></div><divclass="ttdeci">int group</div><divclass="ttdoc">the group no in which this observation would go</div><divclass="ttdef"><b>Definition:</b> k_means_clustering.c:42</div></div>
<divclass="ttc"id="astructsudoku_html_a0f01e2782e82306e6fab9a8578006f56"><divclass="ttname"><ahref="../../dc/d18/structsudoku.html#a0f01e2782e82306e6fab9a8578006f56">sudoku::N2</a></div><divclass="ttdeci">uint8_t N2</div><divclass="ttdoc">block of elements</div><divclass="ttdef"><b>Definition:</b> sudoku_solver.c:36</div></div>
<divclass="ttc"id="aproblem__26_2sol1_8c_html_ac70138609ef6aa6fabca57aca8681e83"><divclass="ttname"><ahref="../../d1/df9/problem__26_2sol1_8c.html#ac70138609ef6aa6fabca57aca8681e83">compare</a></div><divclass="ttdeci">int compare(const void *a, const void *b)</div><divclass="ttdoc">comparison function for use with internal qsort algorithm</div><divclass="ttdef"><b>Definition:</b> sol1.c:19</div></div>
<divclass="ttc"id="acantor__set_8c_html_a1f156d2b53b80305bd2fa3ff5fdf3c97"><divclass="ttname"><ahref="../../dc/d80/cantor__set_8c.html#a1f156d2b53b80305bd2fa3ff5fdf3c97">propagate</a></div><divclass="ttdeci">void propagate(CantorSet *head)</div><divclass="ttdoc">Iterative constructor of all sets in the current level.</div><divclass="ttdef"><b>Definition:</b> cantor_set.c:23</div></div>
<divclass="ttc"id="aqr__decompose_8h_html_abeec1f78a7a7e7251687e75340331212"><divclass="ttname"><ahref="../../d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212">vector_mag</a></div><divclass="ttdeci">double vector_mag(double *vector, int L)</div><divclass="ttdoc">Compute magnitude of vector.</div><divclass="ttdef"><b>Definition:</b> qr_decompose.h:64</div></div>
<divclass="ttc"id="agroup__adaline_html_gaa52120912e32d2893fe1c6d78da5befd"><divclass="ttname"><ahref="../../da/d2a/group__adaline.html#gaa52120912e32d2893fe1c6d78da5befd">adaline_fit</a></div><divclass="ttdeci">void adaline_fit(struct adaline *ada, double **X, const int *y, const int N)</div><divclass="ttdoc">Update the weights of the model using supervised learning for an array of vectors.</div><divclass="ttdef"><b>Definition:</b> adaline_learning.c:184</div></div>
<divclass="ttc"id="aunion__find_8c_html_af2f3ff6d98641f7d3be11f071c97908a"><divclass="ttname"><ahref="../../df/df3/union__find_8c.html#af2f3ff6d98641f7d3be11f071c97908a">join</a></div><divclass="ttdeci">void join(int *p, int x, int y)</div><divclass="ttdoc">Function to join.</div><divclass="ttdef"><b>Definition:</b> union_find.c:42</div></div>
<divclass="ttc"id="akohonen__som__trace_8c_html_a107f00650b8041f77767927073ddddb8"><divclass="ttname"><ahref="../../d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8">test_circle</a></div><divclass="ttdeci">void test_circle(double *const *data, int N)</div><divclass="ttdoc">Creates a random set of points distributed near the circumference of a circle and trains an SOM that ...</div><divclass="ttdef"><b>Definition:</b> kohonen_som_trace.c:223</div></div>
<divclass="ttc"id="aode__forward__euler_8c_html_aaf88ad8f9f7c39fc38f3f03d6fea9df9"><divclass="ttname"><ahref="../../d4/d07/ode__forward__euler_8c.html#aaf88ad8f9f7c39fc38f3f03d6fea9df9">forward_euler</a></div><divclass="ttdeci">double forward_euler(double dx, double x0, double x_max, double *y, char save_to_file)</div><divclass="ttdoc">Compute approximation using the forward-Euler method in the given limits.</div><divclass="ttdef"><b>Definition:</b> ode_forward_euler.c:99</div></div>
<divclass="ttc"id="anewton__raphson__root_8c_html_ae713a1fd0c275fbec7edf263ac2c0337"><divclass="ttname"><ahref="../../dd/d08/newton__raphson__root_8c.html#ae713a1fd0c275fbec7edf263ac2c0337">d_func</a></div><divclass="ttdeci">double complex d_func(double complex x)</div><divclass="ttdoc">Return first order derivative of the function.</div><divclass="ttdef"><b>Definition:</b> newton_raphson_root.c:32</div></div>
<divclass="ttc"id="acantor__set_8c_html_a2b95c356aff8a282eaad255008fa5a94"><divclass="ttname"><ahref="../../dc/d80/cantor__set_8c.html#a2b95c356aff8a282eaad255008fa5a94">CantorSet</a></div><divclass="ttdeci">struct _cantor_set CantorSet</div><divclass="ttdoc">structure to define Cantor set</div></div>
<divclass="ttc"id="astructkohonen__array__3d_html_ad546baa2e81c6196d5f1dc0fe2e5bd59"><divclass="ttname"><ahref="../../d8/db8/structkohonen__array__3d.html#ad546baa2e81c6196d5f1dc0fe2e5bd59">kohonen_array_3d::data</a></div><divclass="ttdeci">double * data</div><divclass="ttdoc">pointer to data</div><divclass="ttdef"><b>Definition:</b> kohonen_som_topology.c:52</div></div>
<divclass="ttc"id="akohonen__som__topology_8c_html_ad9e25202bb8b481461f932668f249dbc"><divclass="ttname"><ahref="../../d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc">test_3d_classes1</a></div><divclass="ttdeci">void test_3d_classes1(double *const *data, int N)</div><divclass="ttdoc">Creates a random set of points distributed in four clusters in 3D space with centroids at the points.</div><divclass="ttdef"><b>Definition:</b> kohonen_som_topology.c:465</div></div>
<divclass="ttc"id="agroup__kohonen__2d_html_ga6824dc6d973eb3339af7aef5fea78b0c"><divclass="ttname"><ahref="../../d1/d6b/group__kohonen__2d.html#ga6824dc6d973eb3339af7aef5fea78b0c">save_2d_data</a></div><divclass="ttdeci">int save_2d_data(const char *fname, double **X, int num_points, int num_features)</div><divclass="ttdoc">Save a given n-dimensional data martix to file.</div><divclass="ttdef"><b>Definition:</b> kohonen_som_topology.c:102</div></div>
<divclass="ttc"id="astruct_b_s_t_iterator_html"><divclass="ttname"><ahref="../../d4/d02/struct_b_s_t_iterator.html">BSTIterator</a></div><divclass="ttdoc">Definition for a binary tree node.</div><divclass="ttdef"><b>Definition:</b> 173.c:13</div></div>
<divclass="ttc"id="agroup__kohonen__2d_html_gaf5ce14f026d6d231bef29161bac2b485"><divclass="ttname"><ahref="../../d1/d6b/group__kohonen__2d.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a></div><divclass="ttdeci">double _random(double a, double b)</div><divclass="ttdoc">Helper function to generate a random number in a given interval.</div><divclass="ttdef"><b>Definition:</b> kohonen_som_topology.c:87</div></div>
<divclass="ttc"id="astructnode_html"><divclass="ttname"><ahref="../../d5/da1/structnode.html">node</a></div><divclass="ttdoc">Node, the basic data structure in the tree.</div><divclass="ttdef"><b>Definition:</b> binary_search_tree.c:15</div></div>
<divclass="ttc"id="aqr__decompose_8h_html_a82b20e027437df768d7e994cf4cae29f"><divclass="ttname"><ahref="../../d4/d68/qr__decompose_8h.html#a82b20e027437df768d7e994cf4cae29f">vector_proj</a></div><divclass="ttdeci">double * vector_proj(double *a, double *b, double *out, int L)</div><divclass="ttdoc">Compute projection of vector on defined as.</div><divclass="ttdef"><b>Definition:</b> qr_decompose.h:76</div></div>
<divclass="ttc"id="astruct__large__num_html_a3fd11c0b413bbabfb8737d4ae73e5aa0"><divclass="ttname"><ahref="../../d3/d5a/struct__large__num.html#a3fd11c0b413bbabfb8737d4ae73e5aa0">_large_num::num_digits</a></div><divclass="ttdeci">unsigned int num_digits</div><divclass="ttdoc">number of digits in the number</div><divclass="ttdef"><b>Definition:</b> factorial_large_number.c:17</div></div>
<divclass="ttc"id="akohonen__som__trace_8c_html_a6d0455dd5c30adda100e95f0423c786e"><divclass="ttname"><ahref="../../d0/d46/kohonen__som__trace_8c.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><divclass="ttdeci">void test3()</div><divclass="ttdoc">Test that creates a random set of points distributed in six clusters in 3D space.</div><divclass="ttdef"><b>Definition:</b> kohonen_som_trace.c:462</div></div>
<divclass="ttc"id="agroup__kohonen__1d_html_ga7b84b14e60f47812b581d1f93057c85a"><divclass="ttname"><ahref="../../d0/dcb/group__kohonen__1d.html#ga7b84b14e60f47812b581d1f93057c85a">save_nd_data</a></div><divclass="ttdeci">int save_nd_data(const char *fname, double **X, int num_points, int num_features)</div><divclass="ttdoc">Save a given n-dimensional data martix to file.</div><divclass="ttdef"><b>Definition:</b> kohonen_som_trace.c:70</div></div>
<divclass="ttc"id="astructkohonen__array__3d_html_a888d7e007b38c91c7933e12a9566af1d"><divclass="ttname"><ahref="../../d8/db8/structkohonen__array__3d.html#a888d7e007b38c91c7933e12a9566af1d">kohonen_array_3d::dim2</a></div><divclass="ttdeci">int dim2</div><divclass="ttdoc">lengths of second dimension</div><divclass="ttdef"><b>Definition:</b> kohonen_som_topology.c:50</div></div>
<divclass="ttc"id="akohonen__som__topology_8c_html_a5bb02a8322d717ead1b11182c5f02a3a"><divclass="ttname"><ahref="../../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a">test_3d_classes2</a></div><divclass="ttdeci">void test_3d_classes2(double *const *data, int N)</div><divclass="ttdoc">Creates a random set of points distributed in four clusters in 3D space with centroids at the points.</div><divclass="ttdef"><b>Definition:</b> kohonen_som_topology.c:564</div></div>
<divclass="ttc"id="astructkohonen__array__3d_html_a160f14830bdfbbf9f422f382ee754dbf"><divclass="ttname"><ahref="../../d8/db8/structkohonen__array__3d.html#a160f14830bdfbbf9f422f382ee754dbf">kohonen_array_3d::dim3</a></div><divclass="ttdeci">int dim3</div><divclass="ttdoc">lengths of thirddimension</div><divclass="ttdef"><b>Definition:</b> kohonen_som_topology.c:51</div></div>
<divclass="ttc"id="astructobservation_html_a04f3dcfd59dd91353395e35c9831fade"><divclass="ttname"><ahref="../../d1/d5e/structobservation.html#a04f3dcfd59dd91353395e35c9831fade">observation::x</a></div><divclass="ttdeci">double x</div><divclass="ttdoc">abscissa of 2D data point</div><divclass="ttdef"><b>Definition:</b> k_means_clustering.c:40</div></div>
<divclass="ttc"id="astructsudoku_html_a160365012280c3e10f1b31e914e8f129"><divclass="ttname"><ahref="../../dc/d18/structsudoku.html#a160365012280c3e10f1b31e914e8f129">sudoku::N</a></div><divclass="ttdeci">uint8_t N</div><divclass="ttdoc">number of elements</div><divclass="ttdef"><b>Definition:</b> sudoku_solver.c:35</div></div>
<divclass="ttc"id="aqr__decompose_8h_html_a45c7640d9d22c89c11beb1f567843c56"><divclass="ttname"><ahref="../../d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56">qr_decompose</a></div><divclass="ttdeci">void qr_decompose(double **A, double **Q, double **R, int M, int N)</div><divclass="ttdoc">Decompose matrix using Gram-Schmidt process.</div><divclass="ttdef"><b>Definition:</b> qr_decompose.h:142</div></div>
<divclass="ttc"id="adurand__kerner__roots_8c_html_afa5b04ce11475d67049cba8273741fb7"><divclass="ttname"><ahref="../../da/d38/durand__kerner__roots_8c.html#afa5b04ce11475d67049cba8273741fb7">complex_str</a></div><divclass="ttdeci">const char * complex_str(long double complex x)</div><divclass="ttdoc">create a textual form of complex number</div><divclass="ttdef"><b>Definition:</b> durand_kerner_roots.c:66</div></div>
<divclass="ttc"id="afactorial__large__number_8c_html_ab54882961780c41a4929a6d390f6522d"><divclass="ttname"><ahref="../../d6/d3d/factorial__large__number_8c.html#ab54882961780c41a4929a6d390f6522d">large_num</a></div><divclass="ttdeci">struct _large_num large_num</div><divclass="ttdoc">dynamically large number</div></div>
<divclass="ttc"id="abinary__search__tree_8c_html_ac73c73be92dbbeeaad942c0103b9540d"><divclass="ttname"><ahref="../../da/d02/binary__search__tree_8c.html#ac73c73be92dbbeeaad942c0103b9540d">newNode</a></div><divclass="ttdeci">node * newNode(int data)</div><divclass="ttdoc">The node constructor, which receives the key value input and returns a node pointer.</div><divclass="ttdef"><b>Definition:</b> binary_search_tree.c:28</div></div>
<divclass="ttc"id="afactorial__large__number_8c_html_ad8101f58545bd891ae8b6e11caadd7eb"><divclass="ttname"><ahref="../../d6/d3d/factorial__large__number_8c.html#ad8101f58545bd891ae8b6e11caadd7eb">new_number</a></div><divclass="ttdeci">large_num * new_number(void)</div><divclass="ttdoc">create a new large number</div><divclass="ttdef"><b>Definition:</b> factorial_large_number.c:24</div></div>
<divclass="ttc"id="aode__semi__implicit__euler_8c_html_ad80059877222f885b549f2d0a3dc6b55"><divclass="ttname"><ahref="../../d4/d99/ode__semi__implicit__euler_8c.html#ad80059877222f885b549f2d0a3dc6b55">semi_implicit_euler</a></div><divclass="ttdeci">double semi_implicit_euler(double dx, double x0, double x_max, double *y, char save_to_file)</div><divclass="ttdoc">Compute approximation using the semi-implicit-Euler method in the given limits.</div><divclass="ttdef"><b>Definition:</b> ode_semi_implicit_euler.c:109</div></div>
<divclass="ttc"id="apalindrome_8c_html_a6320493ddee0ca4614423721c5d6f4ba"><divclass="ttname"><ahref="../../df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba">isPalindrome</a></div><divclass="ttdeci">bool isPalindrome(int number)</div><divclass="ttdoc">Check given number whether is palindrome number or not.</div><divclass="ttdef"><b>Definition:</b> palindrome.c:29</div></div>
<divclass="ttc"id="adurand__kerner__roots_8c_html_a321f9781a9744ccdaf0aba89f35ec29c"><divclass="ttname"><ahref="../../da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c">poly_function</a></div><divclass="ttdeci">long double complex poly_function(long double *coeffs, unsigned int degree, long double complex x)</div><divclass="ttdoc">Evaluate the value of a polynomial with given coefficients.</div><divclass="ttdef"><b>Definition:</b> durand_kerner_roots.c:50</div></div>
<divclass="ttc"id="afactorial__large__number_8c_html_ad398ddbd594ca69a5e6dfc894925341e"><divclass="ttname"><ahref="../../d6/d3d/factorial__large__number_8c.html#ad398ddbd594ca69a5e6dfc894925341e">multiply</a></div><divclass="ttdeci">void multiply(large_num *num, unsigned long n)</div><divclass="ttdoc">multiply large number with another integer and store the result in the same large number</div><divclass="ttdef"><b>Definition:</b> factorial_large_number.c:66</div></div>
<divclass="ttc"id="astructcluster_html_a10fa7010c12d0f03a422d68321495479"><divclass="ttname"><ahref="../../d1/d99/structcluster.html#a10fa7010c12d0f03a422d68321495479">cluster::y</a></div><divclass="ttdeci">double y</div><divclass="ttdoc">ordinate of centroid of this cluster</div><divclass="ttdef"><b>Definition:</b> k_means_clustering.c:55</div></div>
<divclass="ttc"id="agroup__kohonen__1d_html_gae334493a0917a24736fe5ba82aa6f81f"><divclass="ttname"><ahref="../../d0/dcb/group__kohonen__1d.html#gae334493a0917a24736fe5ba82aa6f81f">kohonen_update_weights</a></div><divclass="ttdeci">void kohonen_update_weights(double const *x, double *const *W, double *D, int num_out, int num_features, double alpha, int R)</div><divclass="ttdoc">Update weights of the SOM using Kohonen algorithm.</div><divclass="ttdef"><b>Definition:</b> kohonen_som_trace.c:129</div></div>
<divclass="ttc"id="akohonen__som__trace_8c_html_aa2246f940155472084ee461f3685d614"><divclass="ttname"><ahref="../../d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614">test_lamniscate</a></div><divclass="ttdeci">void test_lamniscate(double *const *data, int N)</div><divclass="ttdoc">Creates a random set of points distributed near the locus of the Lamniscate of Gerono.</div><divclass="ttdef"><b>Definition:</b> kohonen_som_trace.c:319</div></div>
<divclass="ttc"id="aproblem__5_2sol_8c_html_ae9606f1867e9921867d6572f51377b4c"><divclass="ttname"><ahref="../../df/de7/problem__5_2sol_8c.html#ae9606f1867e9921867d6572f51377b4c">lcm</a></div><divclass="ttdeci">unsigned long lcm(unsigned long a, unsigned long b)</div><divclass="ttdoc">Compute Least Common Multiple (LCM) of two numbers.</div><divclass="ttdef"><b>Definition:</b> sol.c:31</div></div>
<divclass="ttc"id="agroup__sudoku_html_ga62e94fc39f116e2c81daed8f5437431b"><divclass="ttname"><ahref="../../d5/df4/group__sudoku.html#ga62e94fc39f116e2c81daed8f5437431b">get_next_unknown</a></div><divclass="ttdeci">bool get_next_unknown(const struct sudoku *a, int *x, int *y)</div><divclass="ttdoc">Find and get the location for next empty cell.</div><divclass="ttdef"><b>Definition:</b> sudoku_solver.c:144</div></div>
<divclass="ttc"id="astructcluster_html_aaacf0562ee2d9e8866c66ddaa6527c2b"><divclass="ttname"><ahref="../../d1/d99/structcluster.html#aaacf0562ee2d9e8866c66ddaa6527c2b">cluster::count</a></div><divclass="ttdeci">size_t count</div><divclass="ttdoc">count of observations present in this cluster</div><divclass="ttdef"><b>Definition:</b> k_means_clustering.c:56</div></div>
<divclass="ttc"id="abubble__sort_8c_html_ad126fa7239be97373c96861adc70b1d3"><divclass="ttname"><ahref="../../dd/de4/bubble__sort_8c.html#ad126fa7239be97373c96861adc70b1d3">swap</a></div><divclass="ttdeci">void swap(int *first, int *second)</div><divclass="ttdoc">Swap two values by using pointer.</div><divclass="ttdef"><b>Definition:</b> bubble_sort.c:31</div></div>
<divclass="ttc"id="aspirograph_8c_html_a0daa148091ec953809fc172289f773d3"><divclass="ttname"><ahref="../../d7/d98/spirograph_8c.html#a0daa148091ec953809fc172289f773d3">spirograph</a></div><divclass="ttdeci">void spirograph(double *x, double *y, double l, double k, size_t N, double rot)</div><divclass="ttdoc">Generate spirograph curve into arrays x and y such that the i^th point in 2D is represented by (x[i],...</div><divclass="ttdef"><b>Definition:</b> spirograph.c:57</div></div>
<divclass="ttc"id="afibonacci__fast_8c_html_a7a3d55bd19854075cba2eed6b63cb2d3"><divclass="ttname"><ahref="../../d4/d99/fibonacci__fast_8c.html#a7a3d55bd19854075cba2eed6b63cb2d3">fib</a></div><divclass="ttdeci">void fib(unsigned long n, unsigned long *C, unsigned long *D)</div><divclass="ttdoc">Get the and Fibonacci number using recursive half-interval decimation.</div><divclass="ttdef"><b>Definition:</b> fibonacci_fast.c:23</div></div>
<divclass="ttc"id="agroup__sudoku_html_gadfe0ed5085b4775d8fa00b434cc0fdfc"><divclass="ttname"><ahref="../../d5/df4/group__sudoku.html#gadfe0ed5085b4775d8fa00b434cc0fdfc">solve</a></div><divclass="ttdeci">bool solve(struct sudoku *a)</div><divclass="ttdoc">Function to solve a partially filled sudoku matrix.</div><divclass="ttdef"><b>Definition:</b> sudoku_solver.c:172</div></div>
<divclass="ttc"id="astruct__cantor__set_html_abd2176c3cc3a1d85d15bbeaace35fa03"><divclass="ttname"><ahref="../../d9/dd7/struct__cantor__set.html#abd2176c3cc3a1d85d15bbeaace35fa03">_cantor_set::start</a></div><divclass="ttdeci">double start</div><divclass="ttdoc">start of interval</div><divclass="ttdef"><b>Definition:</b> cantor_set.c:13</div></div>
<divclass="ttc"id="astruct__cantor__set_html_acfc25ab716a3c79be8a5a4cab94e8def"><divclass="ttname"><ahref="../../d9/dd7/struct__cantor__set.html#acfc25ab716a3c79be8a5a4cab94e8def">_cantor_set::end</a></div><divclass="ttdeci">double end</div><divclass="ttdoc">end of interval</div><divclass="ttdef"><b>Definition:</b> cantor_set.c:14</div></div>
<divclass="ttc"id="agroup__hash_html_gad451622bbdca271edfa8e0d98ca422f2"><divclass="ttname"><ahref="../../d7/d3b/group__hash.html#gad451622bbdca271edfa8e0d98ca422f2">test_crc32</a></div><divclass="ttdeci">void test_crc32()</div><divclass="ttdoc">Test function for crc32.</div><divclass="ttdef"><b>Definition:</b> hash_crc32.c:42</div></div>
<divclass="ttc"id="agroup__hash_html_ga9f76001544014905468dc812336110d5"><divclass="ttname"><ahref="../../d7/d3b/group__hash.html#ga9f76001544014905468dc812336110d5">test_djb2</a></div><divclass="ttdeci">void test_djb2(void)</div><divclass="ttdoc">Test function for djb2.</div><divclass="ttdef"><b>Definition:</b> hash_djb2.c:34</div></div>
<divclass="ttc"id="agroup__adaline_html_ga20d3642e0a87f36fdb7bf91b023cd166"><divclass="ttname"><ahref="../../da/d2a/group__adaline.html#ga20d3642e0a87f36fdb7bf91b023cd166">adaline_fit_sample</a></div><divclass="ttdeci">double adaline_fit_sample(struct adaline *ada, const double *x, const int y)</div><divclass="ttdoc">Update the weights of the model using supervised learning for one feature vector.</div><divclass="ttdef"><b>Definition:</b> adaline_learning.c:158</div></div>
<divclass="ttc"id="agroup__sudoku_html_ga85d25d3b40017436f264a103685e4c55"><divclass="ttname"><ahref="../../d5/df4/group__sudoku.html#ga85d25d3b40017436f264a103685e4c55">OKrow</a></div><divclass="ttdeci">bool OKrow(const struct sudoku *a, int x, int y, int v)</div><divclass="ttdoc">Check if x^th row is valid.</div><divclass="ttdef"><b>Definition:</b> sudoku_solver.c:48</div></div>
<divclass="ttc"id="aqr__decompose_8h_html_a90562ce8c3707401e9c5809dece68d6a"><divclass="ttname"><ahref="../../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a">print_matrix</a></div><divclass="ttdeci">void print_matrix(double **A, int M, int N)</div><divclass="ttdoc">function to display matrix on stdout</div><divclass="ttdef"><b>Definition:</b> qr_decompose.h:22</div></div>
<divclass="ttc"id="aqr__decompose_8h_html_a3a584b79941a43d775f9d4ce446dbe05"><divclass="ttname"><ahref="../../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05">vector_dot</a></div><divclass="ttdeci">double vector_dot(double *a, double *b, int L)</div><divclass="ttdoc">Compute dot product of two vectors of equal lengths.</div><divclass="ttdef"><b>Definition:</b> qr_decompose.h:43</div></div>
<divclass="ttc"id="astructadaline_html_a85dbd7cce6195d11ebb388220b96bde2"><divclass="ttname"><ahref="../../d2/daa/structadaline.html#a85dbd7cce6195d11ebb388220b96bde2">adaline::eta</a></div><divclass="ttdeci">double eta</div><divclass="ttdoc">learning rate of the algorithm</div><divclass="ttdef"><b>Definition:</b> adaline_learning.c:45</div></div>
<divclass="ttc"id="agroup__sudoku_html_ga6503128d4f5ce0a0826f72f73f9e0b2a"><divclass="ttname"><ahref="../../d5/df4/group__sudoku.html#ga6503128d4f5ce0a0826f72f73f9e0b2a">OKcol</a></div><divclass="ttdeci">bool OKcol(const struct sudoku *a, int x, int y, int v)</div><divclass="ttdoc">Check if y^th column is valid.</div><divclass="ttdef"><b>Definition:</b> sudoku_solver.c:67</div></div>
<divclass="ttc"id="astructcluster_html_a13278ef636c1d9bd9ce8fad736f4c570"><divclass="ttname"><ahref="../../d1/d99/structcluster.html#a13278ef636c1d9bd9ce8fad736f4c570">cluster::x</a></div><divclass="ttdeci">double x</div><divclass="ttdoc">abscissa centroid of this cluster</div><divclass="ttdef"><b>Definition:</b> k_means_clustering.c:54</div></div>
<divclass="ttc"id="agroup__kohonen__1d_html_gaeaeffbff2be4d5d15b0d4f10f846abde"><divclass="ttname"><ahref="../../d0/dcb/group__kohonen__1d.html#gaeaeffbff2be4d5d15b0d4f10f846abde">kohonen_som_tracer</a></div><divclass="ttdeci">void kohonen_som_tracer(double **X, double *const *W, int num_samples, int num_features, int num_out, double alpha_min)</div><divclass="ttdoc">Apply incremental algorithm with updating neighborhood and learning rates on all samples in the given...</div><divclass="ttdef"><b>Definition:</b> kohonen_som_trace.c:179</div></div>
<divclass="ttc"id="akohonen__som__topology_8c_html_a0283886819c7c140a023582b7269e2d0"><divclass="ttname"><ahref="../../d2/df6/kohonen__som__topology_8c.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><divclass="ttdeci">void test2()</div><divclass="ttdoc">Test that creates a random set of points distributed in 4 clusters in 3D space and trains an SOM that...</div><divclass="ttdef"><b>Definition:</b> kohonen_som_topology.c:506</div></div>
<divclass="ttc"id="aunion__find_8c_html_a3e13b69cce5a1b25ae034798092f3d86"><divclass="ttname"><ahref="../../df/df3/union__find_8c.html#a3e13b69cce5a1b25ae034798092f3d86">find</a></div><divclass="ttdeci">int find(int *p, int x)</div><divclass="ttdoc">Find index of or value in an array.</div><divclass="ttdef"><b>Definition:</b> union_find.c:17</div></div>
<divclass="ttc"id="aode__forward__euler_8c_html_a97075291390a68c262ed66e157a57eb4"><divclass="ttname"><ahref="../../d4/d07/ode__forward__euler_8c.html#a97075291390a68c262ed66e157a57eb4">problem</a></div><divclass="ttdeci">void problem(const double *x, double *y, double *dy)</div><divclass="ttdoc">Problem statement for a system with first-order differential equations.</div><divclass="ttdef"><b>Definition:</b> ode_forward_euler.c:55</div></div>
<divclass="ttc"id="aode__semi__implicit__euler_8c_html_a97075291390a68c262ed66e157a57eb4"><divclass="ttname"><ahref="../../d4/d99/ode__semi__implicit__euler_8c.html#a97075291390a68c262ed66e157a57eb4">problem</a></div><divclass="ttdeci">void problem(const double *x, double *y, double *dy)</div><divclass="ttdoc">Problem statement for a system with first-order differential equations.</div><divclass="ttdef"><b>Definition:</b> ode_semi_implicit_euler.c:58</div></div>
<divclass="ttc"id="akohonen__som__trace_8c_html_a2256c10b16edba377b64a44b6c656908"><divclass="ttname"><ahref="../../d0/d46/kohonen__som__trace_8c.html#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a></div><divclass="ttdeci">double get_clock_diff(clock_t start_t, clock_t end_t)</div><divclass="ttdoc">Convert clock cycle difference to time in seconds.</div><divclass="ttdef"><b>Definition:</b> kohonen_som_trace.c:511</div></div>
<divclass="ttc"id="agroup__kohonen__1d_html_gac6afabdc09a49a433ee19d8a9486056d"><divclass="ttname"><ahref="../../d0/dcb/group__kohonen__1d.html#gac6afabdc09a49a433ee19d8a9486056d">min</a></div><divclass="ttdeci">#define min(a, b)</div><divclass="ttdoc">shorthand for minimum value</div><divclass="ttdef"><b>Definition:</b> kohonen_som_trace.c:36</div></div>
<divclass="ttc"id="aode__semi__implicit__euler_8c_html_a9ceb646336224ee890a269d0b4600d09"><divclass="ttname"><ahref="../../d4/d99/ode__semi__implicit__euler_8c.html#a9ceb646336224ee890a269d0b4600d09">order</a></div><divclass="ttdeci">#define order</div><divclass="ttdoc">number of dependent variables in problem</div><divclass="ttdef"><b>Definition:</b> ode_semi_implicit_euler.c:47</div></div>
<divclass="ttc"id="agroup__kohonen__2d_html_gadc22d512c00a9f5799ee067f4fb90b4b"><divclass="ttname"><ahref="../../d1/d6b/group__kohonen__2d.html#gadc22d512c00a9f5799ee067f4fb90b4b">get_min_2d</a></div><divclass="ttdeci">void get_min_2d(double **X, int N, double *val, int *x_idx, int *y_idx)</div><divclass="ttdoc">Get minimum value and index of the value in a matrix.</div><divclass="ttdef"><b>Definition:</b> kohonen_som_topology.c:204</div></div>
<divclass="ttc"id="aprime_8c_html_a6384596f117decd77da25af95ab1704f"><divclass="ttname"><ahref="../../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f">isPrime</a></div><divclass="ttdeci">bool isPrime(int x)</div><divclass="ttdoc">Check if a given number is prime number or not.</div><divclass="ttdef"><b>Definition:</b> prime.c:16</div></div>
<divclass="ttc"id="athreaded__binary__trees_8c_html_a306d567466f22e1e927aaed97d8bb58c"><divclass="ttname"><ahref="../../df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c">search</a></div><divclass="ttdeci">void search(node *root, int ele)</div><divclass="ttdoc">searches for the element</div><divclass="ttdef"><b>Definition:</b> threaded_binary_trees.c:98</div></div>
<divclass="ttc"id="aspirograph_8c_html_a708a4c1a4d0c4acc4c447310dd4db27f"><divclass="ttname"><ahref="../../d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f">test</a></div><divclass="ttdeci">void test(void)</div><divclass="ttdoc">Test function to save resulting points to a CSV file.</div><divclass="ttdef"><b>Definition:</b> spirograph.c:74</div></div>
<divclass="ttc"id="agroup__kohonen__1d_html_gaffe776513b24d84b39af8ab0930fef7f"><divclass="ttname"><ahref="../../d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a></div><divclass="ttdeci">#define max(a, b)</div><divclass="ttdoc">shorthand for maximum value</div><divclass="ttdef"><b>Definition:</b> kohonen_som_trace.c:32</div></div>
<divclass="ttc"id="agroup__sudoku_html_ga1cd43df3f4187845ce186042fe53e6f1"><divclass="ttname"><ahref="../../d5/df4/group__sudoku.html#ga1cd43df3f4187845ce186042fe53e6f1">OKbox</a></div><divclass="ttdeci">bool OKbox(const struct sudoku *a, int x, int y, int v)</div><divclass="ttdoc">Check if a 3x3 box is valid.</div><divclass="ttdef"><b>Definition:</b> sudoku_solver.c:85</div></div>
<divclass="ttc"id="aproblem__5_2sol_8c_html_a59347107cbfdf48d51108e50280e760d"><divclass="ttname"><ahref="../../df/de7/problem__5_2sol_8c.html#a59347107cbfdf48d51108e50280e760d">gcd</a></div><divclass="ttdeci">unsigned long gcd(unsigned long a, unsigned long b)</div><divclass="ttdoc">Compute Greatest Common Divisor (GCD) of two numbers using Euclids algorithm.</div><divclass="ttdef"><b>Definition:</b> sol.c:11</div></div>
<divclass="ttc"id="agroup__hash_html_gab87679863646255178427a56dc33e453"><divclass="ttname"><ahref="../../d7/d3b/group__hash.html#gab87679863646255178427a56dc33e453">test_sdbm</a></div><divclass="ttdeci">void test_sdbm()</div><divclass="ttdoc">Test function for sdbm.</div><divclass="ttdef"><b>Definition:</b> hash_sdbm.c:34</div></div>
<divclass="ttc"id="agroup__adaline_html_ga555ba960994e9bccb2029764588f694f"><divclass="ttname"><ahref="../../da/d2a/group__adaline.html#ga555ba960994e9bccb2029764588f694f">MAX_ADALINE_ITER</a></div><divclass="ttdeci">#define MAX_ADALINE_ITER</div><divclass="ttdoc">Maximum number of iterations to learn.</div><divclass="ttdef"><b>Definition:</b> adaline_learning.c:40</div></div>
<divclass="ttc"id="afactorial__large__number_8c_html_ab5c854e0df76165c31899e69eceeeaae"><divclass="ttname"><ahref="../../d6/d3d/factorial__large__number_8c.html#ab5c854e0df76165c31899e69eceeeaae">delete_number</a></div><divclass="ttdeci">void delete_number(large_num *num)</div><divclass="ttdoc">delete all memory allocated for large number</div><divclass="ttdef"><b>Definition:</b> factorial_large_number.c:37</div></div>
<divclass="ttc"id="alu__decompose_8c_html_aae40b90a8efd645c749128cf8072bbb4"><divclass="ttname"><ahref="../../dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4">lu_decomposition</a></div><divclass="ttdeci">int lu_decomposition(double **A, double **L, double **U, int mat_size)</div><divclass="ttdoc">Perform LU decomposition on matrix.</div><divclass="ttdef"><b>Definition:</b> lu_decompose.c:20</div></div>
<divclass="ttc"id="astructkohonen__array__3d_html"><divclass="ttname"><ahref="../../d8/db8/structkohonen__array__3d.html">kohonen_array_3d</a></div><divclass="ttdoc">to store info regarding 3D arrays</div><divclass="ttdef"><b>Definition:</b> kohonen_som_topology.c:48</div></div>
<divclass="ttc"id="agroup__kohonen__2d_html_gacb42eda8af6ebd6a141a34ab00a0b710"><divclass="ttname"><ahref="../../d1/d6b/group__kohonen__2d.html#gacb42eda8af6ebd6a141a34ab00a0b710">kohonen_som</a></div><divclass="ttdeci">void kohonen_som(double **X, struct kohonen_array_3d *W, int num_samples, int num_features, int num_out, double alpha_min)</div><divclass="ttdoc">Apply incremental algorithm with updating neighborhood and learning rates on all samples in the given...</div><divclass="ttdef"><b>Definition:</b> kohonen_som_topology.c:314</div></div>
<divclass="ttc"id="agroup__kohonen__2d_html_gaffe776513b24d84b39af8ab0930fef7f"><divclass="ttname"><ahref="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a></div><divclass="ttdeci">#define max(a, b)</div><divclass="ttdoc">shorthand for maximum value</div><divclass="ttdef"><b>Definition:</b> kohonen_som_topology.c:39</div></div>
<divclass="ttc"id="astrong__number_8c_html_a03654cadb0cfe1195810dbe5da0265b5"><divclass="ttname"><ahref="../../d4/dcc/strong__number_8c.html#a03654cadb0cfe1195810dbe5da0265b5">isStrong</a></div><divclass="ttdeci">bool isStrong(int number)</div><divclass="ttdoc">Check if given number is strong number or not.</div><divclass="ttdef"><b>Definition:</b> strong_number.c:15</div></div>
<divclass="ttc"id="aadaline__learning_8c_html_a3f37b9f073f7e57fd0b39d70718af1b1"><divclass="ttname"><ahref="../../dd/d8c/adaline__learning_8c.html#a3f37b9f073f7e57fd0b39d70718af1b1">test3</a></div><divclass="ttdeci">void test3(double eta)</div><divclass="ttdoc">test function to predict points in a 3D coordinate system lying within the sphere of radius 1 and cen...</div><divclass="ttdef"><b>Definition:</b> adaline_learning.c:336</div></div>
<divclass="ttc"id="alu__decompose_8c_html_a0789beb8d3396582d77b7aedf5e5554a"><divclass="ttname"><ahref="../../dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a">display</a></div><divclass="ttdeci">void display(double **A, int N)</div><divclass="ttdoc">Function to display square matrix.</div><divclass="ttdef"><b>Definition:</b> lu_decompose.c:66</div></div>
<divclass="ttc"id="agroup__sudoku_html_ga3a0ec150ac9d0cb6b28279d36d95d72f"><divclass="ttname"><ahref="../../d5/df4/group__sudoku.html#ga3a0ec150ac9d0cb6b28279d36d95d72f">OK</a></div><divclass="ttdeci">bool OK(const struct sudoku *a, int x, int y, int v)</div><divclass="ttdoc">Check if element v is valid to place at (x,y) location.</div><divclass="ttdef"><b>Definition:</b> sudoku_solver.c:111</div></div>
<divclass="ttc"id="aode__midpoint__euler_8c_html_a9ceb646336224ee890a269d0b4600d09"><divclass="ttname"><ahref="../../d1/dc2/ode__midpoint__euler_8c.html#a9ceb646336224ee890a269d0b4600d09">order</a></div><divclass="ttdeci">#define order</div><divclass="ttdoc">number of dependent variables in problem</div><divclass="ttdef"><b>Definition:</b> ode_midpoint_euler.c:43</div></div>
<divclass="ttc"id="aode__forward__euler_8c_html_a8caee977b26888d34040b122e0e28e3a"><divclass="ttname"><ahref="../../d4/d07/ode__forward__euler_8c.html#a8caee977b26888d34040b122e0e28e3a">exact_solution</a></div><divclass="ttdeci">void exact_solution(const double *x, double *y)</div><divclass="ttdoc">Exact solution of the problem.</div><divclass="ttdef"><b>Definition:</b> ode_forward_euler.c:68</div></div>
<divclass="ttc"id="agroup__hash_html_ga39d4c16427acbf8bbe744f6d8ed61dc0"><divclass="ttname"><ahref="../../d7/d3b/group__hash.html#ga39d4c16427acbf8bbe744f6d8ed61dc0">test_xor8</a></div><divclass="ttdeci">void test_xor8()</div><divclass="ttdoc">Test function for xor8.</div><divclass="ttdef"><b>Definition:</b> hash_xor8.c:35</div></div>
<divclass="ttc"id="akohonen__som__trace_8c_html_a1440a7779ac56f47a3f355ce4a8c7da0"><divclass="ttname"><ahref="../../d0/d46/kohonen__som__trace_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><divclass="ttdeci">void test1()</div><divclass="ttdoc">Test that creates a random set of points distributed near the circumference of a circle and trains an...</div><divclass="ttdef"><b>Definition:</b> kohonen_som_trace.c:261</div></div>
<divclass="ttc"id="agroup__kohonen__1d_html_gaf5ce14f026d6d231bef29161bac2b485"><divclass="ttname"><ahref="../../d0/dcb/group__kohonen__1d.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a></div><divclass="ttdeci">double _random(double a, double b)</div><divclass="ttdoc">Helper function to generate a random number in a given interval.</div><divclass="ttdef"><b>Definition:</b> kohonen_som_trace.c:54</div></div>
<divclass="ttc"id="astructkohonen__array__3d_html_a16720581653fa9a34d1029e7229a7377"><divclass="ttname"><ahref="../../d8/db8/structkohonen__array__3d.html#a16720581653fa9a34d1029e7229a7377">kohonen_array_3d::dim1</a></div><divclass="ttdeci">int dim1</div><divclass="ttdoc">lengths of first dimension</div><divclass="ttdef"><b>Definition:</b> kohonen_som_topology.c:49</div></div>
<divclass="ttc"id="anewton__raphson__root_8c_html_a72f87d423a488946b319627a454d3925"><divclass="ttname"><ahref="../../dd/d08/newton__raphson__root_8c.html#a72f87d423a488946b319627a454d3925">func</a></div><divclass="ttdeci">double complex func(double complex x)</div><divclass="ttdoc">Return value of the function to find the root for.</div><divclass="ttdef"><b>Definition:</b> newton_raphson_root.c:22</div></div>
<divclass="ttc"id="astructsudoku_html_a507f788b793d4d3d6f6a70415be84ded"><divclass="ttname"><ahref="../../dc/d18/structsudoku.html#a507f788b793d4d3d6f6a70415be84ded">sudoku::a</a></div><divclass="ttdeci">uint8_t * a</div><divclass="ttdoc">matrix as a flattened 1D row-major array</div><divclass="ttdef"><b>Definition:</b> sudoku_solver.c:34</div></div>
<divclass="ttc"id="aadaline__learning_8c_html_ab4ecb3accf5d9e0263087e7265bbe3a9"><divclass="ttname"><ahref="../../dd/d8c/adaline__learning_8c.html#ab4ecb3accf5d9e0263087e7265bbe3a9">test1</a></div><divclass="ttdeci">void test1(double eta)</div><divclass="ttdoc">test function to predict points in a 2D coordinate system above the line as +1 and others as -1.</div><divclass="ttdef"><b>Definition:</b> adaline_learning.c:225</div></div>
<divclass="ttc"id="aadaline__learning_8c_html_a05cc9a0acb524fde727a4d7b4a747ee6"><divclass="ttname"><ahref="../../dd/d8c/adaline__learning_8c.html#a05cc9a0acb524fde727a4d7b4a747ee6">test2</a></div><divclass="ttdeci">void test2(double eta)</div><divclass="ttdoc">test function to predict points in a 2D coordinate system above the line as +1 and others as -1.</div><divclass="ttdef"><b>Definition:</b> adaline_learning.c:273</div></div>
<divclass="ttc"id="astructsudoku_html"><divclass="ttname"><ahref="../../dc/d18/structsudoku.html">sudoku</a></div><divclass="ttdoc">Structure to hold the matrix and dimensions.</div><divclass="ttdef"><b>Definition:</b> sudoku_solver.c:33</div></div>
<divclass="ttc"id="aode__midpoint__euler_8c_html_a148003d8b261d040c1c41e73b40af1dd"><divclass="ttname"><ahref="../../d1/dc2/ode__midpoint__euler_8c.html#a148003d8b261d040c1c41e73b40af1dd">midpoint_euler</a></div><divclass="ttdeci">double midpoint_euler(double dx, double x0, double x_max, double *y, char save_to_file)</div><divclass="ttdoc">Compute approximation using the midpoint-Euler method in the given limits.</div><divclass="ttdef"><b>Definition:</b> ode_midpoint_euler.c:106</div></div>
<divclass="ttc"id="agroup__kohonen__2d_html_ga83abb572c60d202e100595a989dfe123"><divclass="ttname"><ahref="../../d1/d6b/group__kohonen__2d.html#ga83abb572c60d202e100595a989dfe123">kohonen_update_weights</a></div><divclass="ttdeci">double kohonen_update_weights(const double *X, struct kohonen_array_3d *W, double **D, int num_out, int num_features, double alpha, int R)</div><divclass="ttdoc">Update weights of the SOM using Kohonen algorithm.</div><divclass="ttdef"><b>Definition:</b> kohonen_som_topology.c:234</div></div>
<divclass="ttc"id="abinary__search__tree_8c_html_af4aeda155dbe167f1c1cf38cb65bf324"><divclass="ttname"><ahref="../../da/d02/binary__search__tree_8c.html#af4aeda155dbe167f1c1cf38cb65bf324">node</a></div><divclass="ttdeci">struct node node</div><divclass="ttdoc">Node, the basic data structure in the tree.</div></div>
<divclass="ttc"id="akohonen__som__trace_8c_html_a41ae16442e3e5b891a58d2e5932a2cd0"><divclass="ttname"><ahref="../../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0">test_3d_classes</a></div><divclass="ttdeci">void test_3d_classes(double *const *data, int N)</div><divclass="ttdoc">Creates a random set of points distributed in four clusters in 3D space with centroids at the points.</div><divclass="ttdef"><b>Definition:</b> kohonen_som_trace.c:410</div></div>
<divclass="ttc"id="agroup__adaline_html_gac70b578aee679005fd336073969c3d94"><divclass="ttname"><ahref="../../da/d2a/group__adaline.html#gac70b578aee679005fd336073969c3d94">adaline_predict</a></div><divclass="ttdeci">int adaline_predict(struct adaline *ada, const double *x, double *out)</div><divclass="ttdoc">predict the output of the model for given set of features</div><divclass="ttdef"><b>Definition:</b> adaline_learning.c:136</div></div>
<divclass="ttc"id="astructadaline_html"><divclass="ttname"><ahref="../../d2/daa/structadaline.html">adaline</a></div><divclass="ttdoc">structure to hold adaline model parameters</div><divclass="ttdef"><b>Definition:</b> adaline_learning.c:44</div></div>
<divclass="ttc"id="acartesian__to__polar_8c_html_a60e62b809ca9dcb1b20a140b30d30f60"><divclass="ttname"><ahref="../../d6/d2e/cartesian__to__polar_8c.html#a60e62b809ca9dcb1b20a140b30d30f60">get_rand</a></div><divclass="ttdeci">double get_rand(double lim1, double lim2)</div><divclass="ttdoc">Generate a random number in the given limits.</div><divclass="ttdef"><b>Definition:</b> cartesian_to_polar.c:88</div></div>
<divclass="ttc"id="abinary__search__tree_8c_html_ae4a66d8b0c2b0d626aea45977e358c83"><divclass="ttname"><ahref="../../da/d02/binary__search__tree_8c.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><divclass="ttdeci">int height(node *root)</div><divclass="ttdoc">Utilitary procedure to measure the height of the binary tree.</div><divclass="ttdef"><b>Definition:</b> binary_search_tree.c:187</div></div>
<divclass="ttc"id="agroup__kohonen__2d_html_ga49d35f68f5d11d8ef6f8cce0d0e7bcba"><divclass="ttname"><ahref="../../d1/d6b/group__kohonen__2d.html#ga49d35f68f5d11d8ef6f8cce0d0e7bcba">save_u_matrix</a></div><divclass="ttdeci">int save_u_matrix(const char *fname, struct kohonen_array_3d *W)</div><divclass="ttdoc">Create the distance matrix or U-matrix from the trained weights and save to disk.</div><divclass="ttdef"><b>Definition:</b> kohonen_som_topology.c:139</div></div>
<divclass="ttc"id="akohonen__som__topology_8c_html_a1440a7779ac56f47a3f355ce4a8c7da0"><divclass="ttname"><ahref="../../d2/df6/kohonen__som__topology_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><divclass="ttdeci">void test1()</div><divclass="ttdoc">Test that creates a random set of points distributed in four clusters in 2D space and trains an SOM t...</div><divclass="ttdef"><b>Definition:</b> kohonen_som_topology.c:406</div></div>
<divclass="ttc"id="astruct__cantor__set_html"><divclass="ttname"><ahref="../../d9/dd7/struct__cantor__set.html">_cantor_set</a></div><divclass="ttdoc">structure to define Cantor set</div><divclass="ttdef"><b>Definition:</b> cantor_set.c:12</div></div>
<divclass="ttc"id="astructobservation_html_ab6be1fa7024b2d5f3a30d6c6b70efdd7"><divclass="ttname"><ahref="../../d1/d5e/structobservation.html#ab6be1fa7024b2d5f3a30d6c6b70efdd7">observation::y</a></div><divclass="ttdeci">double y</div><divclass="ttdoc">ordinate of 2D data point</div><divclass="ttdef"><b>Definition:</b> k_means_clustering.c:41</div></div>
<divclass="ttc"id="astruct__large__num_html_afaf353a072cf050ac86ac6e39868bcc9"><divclass="ttname"><ahref="../../d3/d5a/struct__large__num.html#afaf353a072cf050ac86ac6e39868bcc9">_large_num::digits</a></div><divclass="ttdeci">char * digits</div><divclass="ttdoc">array to store individual digits</div><divclass="ttdef"><b>Definition:</b> factorial_large_number.c:16</div></div>
<divclass="ttc"id="agroup__adaline_html_ga251695a79baa885cafdcf6d8ed4ac120"><divclass="ttname"><ahref="../../da/d2a/group__adaline.html#ga251695a79baa885cafdcf6d8ed4ac120">adaline_get_weights_str</a></div><divclass="ttdeci">char * adaline_get_weights_str(const struct adaline *ada)</div><divclass="ttdoc">Operator to print the weights of the model.</div><divclass="ttdef"><b>Definition:</b> adaline_learning.c:112</div></div>
<divclass="ttc"id="agroup__kohonen__2d_html_ga8df35f04c1762a01dcf108fa13b897d6"><divclass="ttname"><ahref="../../d1/d6b/group__kohonen__2d.html#ga8df35f04c1762a01dcf108fa13b897d6">kohonen_data_3d</a></div><divclass="ttdeci">double * kohonen_data_3d(const struct kohonen_array_3d *arr, int x, int y, int z)</div><divclass="ttdoc">Function that returns the pointer to (x, y, z) ^th location in the linear 3D array given by:</div><divclass="ttdef"><b>Definition:</b> kohonen_som_topology.c:67</div></div>
<divclass="ttc"id="agroup__kohonen__1d_html_ga4a57a413a3cef286a7da6d4666575586"><divclass="ttname"><ahref="../../d0/dcb/group__kohonen__1d.html#ga4a57a413a3cef286a7da6d4666575586">kohonen_get_min_1d</a></div><divclass="ttdeci">void kohonen_get_min_1d(double const *X, int N, double *val, int *idx)</div><divclass="ttdoc">Get minimum value and index of the value in a vector.</div><divclass="ttdef"><b>Definition:</b> kohonen_som_trace.c:104</div></div>
<divclass="ttc"id="aode__midpoint__euler_8c_html_a97075291390a68c262ed66e157a57eb4"><divclass="ttname"><ahref="../../d1/dc2/ode__midpoint__euler_8c.html#a97075291390a68c262ed66e157a57eb4">problem</a></div><divclass="ttdeci">void problem(const double *x, double *y, double *dy)</div><divclass="ttdoc">Problem statement for a system with first-order differential equations.</div><divclass="ttdef"><b>Definition:</b> ode_midpoint_euler.c:54</div></div>
<divclass="ttc"id="acantor__set_8c_html_a75ee530cd7148a63249784ad3dda8fab"><divclass="ttname"><ahref="../../dc/d80/cantor__set_8c.html#a75ee530cd7148a63249784ad3dda8fab">print</a></div><divclass="ttdeci">void print(CantorSet *head)</div><divclass="ttdoc">Print sets in the current range to stdout</div><divclass="ttdef"><b>Definition:</b> cantor_set.c:55</div></div>
<divclass="ttc"id="aode__forward__euler_8c_html_a9ceb646336224ee890a269d0b4600d09"><divclass="ttname"><ahref="../../d4/d07/ode__forward__euler_8c.html#a9ceb646336224ee890a269d0b4600d09">order</a></div><divclass="ttdeci">#define order</div><divclass="ttdoc">number of dependent variables in problem</div><divclass="ttdef"><b>Definition:</b> ode_forward_euler.c:44</div></div>
<divclass="ttc"id="astructadaline_html_a53314e737a0a5ff4552a03bcc9dafbc1"><divclass="ttname"><ahref="../../d2/daa/structadaline.html#a53314e737a0a5ff4552a03bcc9dafbc1">adaline::num_weights</a></div><divclass="ttdeci">int num_weights</div><divclass="ttdoc">number of weights of the neural network</div><divclass="ttdef"><b>Definition:</b> adaline_learning.c:47</div></div>
<divclass="ttc"id="afactorial__large__number_8c_html_af2869d36c22a2b8f93d3166a84e124b3"><divclass="ttname"><ahref="../../d6/d3d/factorial__large__number_8c.html#af2869d36c22a2b8f93d3166a84e124b3">add_digit</a></div><divclass="ttdeci">void add_digit(large_num *num, unsigned int value)</div><divclass="ttdoc">add a digit to the large number</div><divclass="ttdef"><b>Definition:</b> factorial_large_number.c:48</div></div>
<divclass="ttc"id="akohonen__som__topology_8c_html_a2256c10b16edba377b64a44b6c656908"><divclass="ttname"><ahref="../../d2/df6/kohonen__som__topology_8c.html#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a></div><divclass="ttdeci">double get_clock_diff(clock_t start_t, clock_t end_t)</div><divclass="ttdoc">Convert clock cycle difference to time in seconds.</div><divclass="ttdef"><b>Definition:</b> kohonen_som_topology.c:663</div></div>
<divclass="ttc"id="akohonen__som__topology_8c_html_adb5ded007be1fd666fab9affe6764018"><divclass="ttname"><ahref="../../d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018">test_2d_classes</a></div><divclass="ttdeci">void test_2d_classes(double *const *data, int N)</div><divclass="ttdoc">Creates a random set of points distributed in four clusters in 3D space with centroids at the points.</div><divclass="ttdef"><b>Definition:</b> kohonen_som_topology.c:366</div></div>
