mirror of
https://github.com/TheAlgorithms/C
synced 2024-12-15 07:52:36 +03:00
438 lines
86 KiB
HTML
438 lines
86 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.18"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>Algorithms_in_C: numerical_methods/qr_decompose.h Source File</title>
|
|
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../jquery.js"></script>
|
|
<script type="text/javascript" src="../../dynsections.js"></script>
|
|
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../resize.js"></script>
|
|
<script type="text/javascript" src="../../navtreedata.js"></script>
|
|
<script type="text/javascript" src="../../navtree.js"></script>
|
|
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
|
<script type="text/javascript" src="../../search/search.js"></script>
|
|
<script type="text/x-mathjax-config">
|
|
MathJax.Hub.Config({
|
|
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
|
|
jax: ["input/TeX","output/HTML-CSS"],
|
|
});
|
|
</script>
|
|
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
|
|
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">Algorithms_in_C
|
|
 <span id="projectnumber">1.0.0</span>
|
|
</div>
|
|
<div id="projectbrief">Set of algorithms implemented in C.</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.18 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="../../menudata.js"></script>
|
|
<script type="text/javascript" src="../../menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('../../',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','../../'); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">qr_decompose.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="../../d4/d68/qr__decompose_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">/**</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment"> * @file</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> * \brief Library functions to compute [QR</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> * decomposition](https://en.wikipedia.org/wiki/QR_decomposition) of a given</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> * matrix.</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> * \author [Krishna Vedala](https://github.com/kvedala)</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span>  </div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="preprocessor">#ifndef QR_DECOMPOSE_H</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="preprocessor">#define QR_DECOMPOSE_H</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span>  </div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="preprocessor">#include <math.h></span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="preprocessor">#include <stdio.h></span></div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include <stdlib.h></span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#ifdef _OPENMP</span></div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <omp.h></span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment"></span> </div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment">/**</span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment"> * function to display matrix on stdout</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"><a class="line" href="../../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a"> 22</a></span> <span class="keywordtype">void</span> <a class="code" href="../../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a">print_matrix</a>(<span class="keywordtype">double</span> **A, <span class="comment">/**< matrix to print */</span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  <span class="keywordtype">int</span> M, <span class="comment">/**< number of rows of matrix */</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  <span class="keywordtype">int</span> <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>) <span class="comment">/**< number of columns of matrix */</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> {</div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> row = 0; row < M; row++)</div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  {</div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> col = 0; col < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; col++) printf(<span class="stringliteral">"% 9.3g\t"</span>, A[row][col]);</div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  putchar(<span class="charliteral">'\n'</span>);</div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  }</div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  putchar(<span class="charliteral">'\n'</span>);</div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> }</div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment"></span> </div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">/**</span></div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"> * Compute dot product of two vectors of equal lengths</span></div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> * If \f$\vec{a}=\left[a_0,a_1,a_2,...,a_L\right]\f$ and</span></div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> * \f$\vec{b}=\left[b_0,b_1,b_1,...,b_L\right]\f$ then</span></div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> * \f$\vec{a}\cdot\vec{b}=\displaystyle\sum_{i=0}^L a_i\times b_i\f$</span></div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"> * \returns \f$\vec{a}\cdot\vec{b}\f$</span></div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"><a class="line" href="../../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05"> 43</a></span> <span class="keywordtype">double</span> <a class="code" href="../../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05">vector_dot</a>(<span class="keywordtype">double</span> *a, <span class="keywordtype">double</span> *b, <span class="keywordtype">int</span> <a class="code" href="../../df/db3/struct_l.html">L</a>)</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> {</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="keywordtype">double</span> mag = 0.f;</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keywordtype">int</span> i;</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="preprocessor">#ifdef _OPENMP</span></div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment">// parallelize on threads</span></div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="preprocessor">#pragma omp parallel for reduction(+ : mag)</span></div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordflow">for</span> (i = 0; i < <a class="code" href="../../df/db3/struct_l.html">L</a>; i++) mag += a[i] * b[i];</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  </div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">return</span> mag;</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span> }</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment"></span> </div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment">/**</span></div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment"> * Compute magnitude of vector.</span></div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="comment"> * If \f$\vec{a}=\left[a_0,a_1,a_2,...,a_L\right]\f$ then</span></div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="comment"> * \f$\left|\vec{a}\right|=\sqrt{\displaystyle\sum_{i=0}^L a_i^2}\f$</span></div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment"> * \returns \f$\left|\vec{a}\right|\f$</span></div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"><a class="line" href="../../d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212"> 64</a></span> <span class="keywordtype">double</span> <a class="code" href="../../d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212">vector_mag</a>(<span class="keywordtype">double</span> *vector, <span class="keywordtype">int</span> <a class="code" href="../../df/db3/struct_l.html">L</a>)</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span> {</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordtype">double</span> dot = <a class="code" href="../../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05">vector_dot</a>(vector, vector, <a class="code" href="../../df/db3/struct_l.html">L</a>);</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">return</span> sqrt(dot);</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span> }</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment"></span> </div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment">/**</span></div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment"> * Compute projection of vector \f$\vec{a}\f$ on \f$\vec{b}\f$ defined as</span></div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment"> * \f[\text{proj}_\vec{b}\vec{a}=\frac{\vec{a}\cdot\vec{b}}{\left|\vec{b}\right|^2}\vec{b}\f]</span></div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"> * \returns NULL if error, otherwise pointer to output</span></div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"><a class="line" href="../../d4/d68/qr__decompose_8h.html#a82b20e027437df768d7e994cf4cae29f"> 76</a></span> <span class="keywordtype">double</span> *<a class="code" href="../../d4/d68/qr__decompose_8h.html#a82b20e027437df768d7e994cf4cae29f">vector_proj</a>(<span class="keywordtype">double</span> *a, <span class="keywordtype">double</span> *b, <span class="keywordtype">double</span> *out, <span class="keywordtype">int</span> <a class="code" href="../../df/db3/struct_l.html">L</a>)</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> {</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> num = <a class="code" href="../../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05">vector_dot</a>(a, b, <a class="code" href="../../df/db3/struct_l.html">L</a>);</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> deno = <a class="code" href="../../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05">vector_dot</a>(b, b, <a class="code" href="../../df/db3/struct_l.html">L</a>);</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">if</span> (deno == 0) <span class="comment">/*! check for division by zero */</span></div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">return</span> NULL;</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  </div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> scalar = num / deno;</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordtype">int</span> i;</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="preprocessor">#ifdef _OPENMP</span></div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment">// parallelize on threads</span></div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="preprocessor">#pragma omp for</span></div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordflow">for</span> (i = 0; i < <a class="code" href="../../df/db3/struct_l.html">L</a>; i++) out[i] = scalar * b[i];</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  </div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordflow">return</span> out;</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span> }</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment"></span> </div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment">/**</span></div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="comment"> * Compute vector subtraction</span></div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment"> * \f$\vec{c}=\vec{a}-\vec{b}\f$</span></div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="comment"> * \returns pointer to output vector</span></div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"><a class="line" href="../../d4/d68/qr__decompose_8h.html#a6b6a0e75e75ff7919057dd275bb69145"> 101</a></span> <span class="keywordtype">double</span> *<a class="code" href="../../d4/d68/qr__decompose_8h.html#a6b6a0e75e75ff7919057dd275bb69145">vector_sub</a>(<span class="keywordtype">double</span> *a, <span class="comment">/**< minuend */</span></div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordtype">double</span> *b, <span class="comment">/**< subtrahend */</span></div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordtype">double</span> *out, <span class="comment">/**< resultant vector */</span></div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordtype">int</span> <a class="code" href="../../df/db3/struct_l.html">L</a> <span class="comment">/**< length of vectors */</span></div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span> )</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span> {</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordtype">int</span> i;</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="preprocessor">#ifdef _OPENMP</span></div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment">// parallelize on threads</span></div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="preprocessor">#pragma omp for</span></div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">for</span> (i = 0; i < <a class="code" href="../../df/db3/struct_l.html">L</a>; i++) out[i] = a[i] - b[i];</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  </div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">return</span> out;</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span> }</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="comment"></span> </div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment">/**</span></div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="comment"> * Decompose matrix \f$A\f$ using [Gram-Schmidt</span></div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment"> *process](https://en.wikipedia.org/wiki/QR_decomposition).</span></div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="comment"> * \f{eqnarray*}{</span></div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="comment"> * \text{given that}\quad A &=&</span></div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="comment"> *\left[\mathbf{a}_1,\mathbf{a}_2,\ldots,\mathbf{a}_{N-1},\right]\\</span></div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="comment"> * \text{where}\quad\mathbf{a}_i &=&</span></div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="comment"> *\left[a_{0i},a_{1i},a_{2i},\ldots,a_{(M-1)i}\right]^T\quad\ldots\mbox{(column</span></div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="comment"> *vectors)}\\</span></div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span> <span class="comment"> * \text{then}\quad\mathbf{u}_i &=& \mathbf{a}_i</span></div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="comment"> *-\sum_{j=0}^{i-1}\text{proj}_{\mathbf{u}_j}\mathbf{a}_i\\</span></div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="comment"> * \mathbf{e}_i &=&\frac{\mathbf{u}_i}{\left|\mathbf{u}_i\right|}\\</span></div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="comment"> * Q &=& \begin{bmatrix}\mathbf{e}_0 & \mathbf{e}_1 & \mathbf{e}_2 & \dots &</span></div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="comment"> *\mathbf{e}_{N-1}\end{bmatrix}\\</span></div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="comment"> * R &=& \begin{bmatrix}\langle\mathbf{e}_0\,,\mathbf{a}_0\rangle &</span></div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="comment"> *\langle\mathbf{e}_1\,,\mathbf{a}_1\rangle &</span></div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="comment"> *\langle\mathbf{e}_2\,,\mathbf{a}_2\rangle & \dots \\</span></div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="comment"> * 0 & \langle\mathbf{e}_1\,,\mathbf{a}_1\rangle &</span></div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="comment"> *\langle\mathbf{e}_2\,,\mathbf{a}_2\rangle & \dots\\</span></div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="comment"> * 0 & 0 & \langle\mathbf{e}_2\,,\mathbf{a}_2\rangle & \dots\\</span></div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="comment"> * \vdots & \vdots & \vdots & \ddots</span></div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="comment"> * \end{bmatrix}\\</span></div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="comment"> * \f}</span></div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"><a class="line" href="../../d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56"> 142</a></span> <span class="keywordtype">void</span> <a class="code" href="../../d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56">qr_decompose</a>(<span class="keywordtype">double</span> **A, <span class="comment">/**< input matrix to decompose */</span></div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keywordtype">double</span> **Q, <span class="comment">/**< output decomposed matrix */</span></div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordtype">double</span> **R, <span class="comment">/**< output decomposed matrix */</span></div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordtype">int</span> M, <span class="comment">/**< number of rows of matrix A */</span></div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordtype">int</span> <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> <span class="comment">/**< number of columns of matrix A */</span></div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span> )</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span> {</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keywordtype">double</span> *col_vector = (<span class="keywordtype">double</span> *)malloc(M * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordtype">double</span> *col_vector2 = (<span class="keywordtype">double</span> *)malloc(M * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordtype">double</span> *tmp_vector = (<span class="keywordtype">double</span> *)malloc(M * <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>;</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  i++) <span class="comment">/* for each column => R is a square matrix of NxN */</span></div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  {</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordtype">int</span> j;</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="preprocessor">#ifdef _OPENMP</span></div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="comment">// parallelize on threads</span></div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="preprocessor">#pragma omp for</span></div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordflow">for</span> (j = 0; j < i; j++) <span class="comment">/* second dimension of column */</span></div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  R[i][j] = 0.; <span class="comment">/* make R upper triangular */</span></div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  </div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="comment">/* get corresponding Q vector */</span></div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="preprocessor">#ifdef _OPENMP</span></div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="comment">// parallelize on threads</span></div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="preprocessor">#pragma omp for</span></div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keywordflow">for</span> (j = 0; j < M; j++)</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  {</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  tmp_vector[j] = A[j][i]; <span class="comment">/* accumulator for uk */</span></div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  col_vector[j] = A[j][i];</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  }</div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keywordflow">for</span> (j = 0; j < i; j++)</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  {</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 0; k < M; k++) col_vector2[k] = Q[k][j];</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <a class="code" href="../../d4/d68/qr__decompose_8h.html#a82b20e027437df768d7e994cf4cae29f">vector_proj</a>(col_vector, col_vector2, col_vector2, M);</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <a class="code" href="../../d4/d68/qr__decompose_8h.html#a6b6a0e75e75ff7919057dd275bb69145">vector_sub</a>(tmp_vector, col_vector2, tmp_vector, M);</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  }</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keywordtype">double</span> mag = <a class="code" href="../../d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212">vector_mag</a>(tmp_vector, M);</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  </div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="preprocessor">#ifdef _OPENMP</span></div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="comment">// parallelize on threads</span></div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="preprocessor">#pragma omp for</span></div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">for</span> (j = 0; j < M; j++) Q[j][i] = tmp_vector[j] / mag;</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  </div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="comment">/* compute upper triangular values of R */</span></div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> kk = 0; kk < M; kk++) col_vector[kk] = Q[kk][i];</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = i; k < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; k++)</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  {</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> kk = 0; kk < M; kk++) col_vector2[kk] = A[kk][k];</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  R[i][k] = <a class="code" href="../../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05">vector_dot</a>(col_vector, col_vector2, M);</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  }</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  }</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  </div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  free(col_vector);</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  free(col_vector2);</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  free(tmp_vector);</div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span> }</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  </div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span> <span class="preprocessor">#endif // QR_DECOMPOSE_H</span></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<div class="ttc" id="acollatz_8c_html_a0ddf1224851353fc92bfbff6f499fa97"><div class="ttname"><a href="../../dc/d80/collatz_8c.html#a0ddf1224851353fc92bfbff6f499fa97">main</a></div><div class="ttdeci">int main(int argc, char *argv[])</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> collatz.c:16</div></div>
|
|
<div class="ttc" id="astruct__large__num_html"><div class="ttname"><a href="../../d3/d5a/struct__large__num.html">_large_num</a></div><div class="ttdoc">dynamically large number</div><div class="ttdef"><b>Definition:</b> factorial_large_number.c:15</div></div>
|
|
<div class="ttc" id="akohonen__som__trace_8c_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../d0/d46/kohonen__som__trace_8c.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">Test that creates a random set of points distributed near the locus of the Lamniscate of Gerono and t...</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.c:347</div></div>
|
|
<div class="ttc" id="aadaline__learning_8c_html_acd517c6f195c75b9dd0f3aad65326f3b"><div class="ttname"><a href="../../dd/d8c/adaline__learning_8c.html#acd517c6f195c75b9dd0f3aad65326f3b">MAX_ITER</a></div><div class="ttdeci">#define MAX_ITER</div><div class="ttdoc">Maximum number of iterations to learn.</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:34</div></div>
|
|
<div class="ttc" id="astruct_l_html"><div class="ttname"><a href="../../df/db3/struct_l.html">L</a></div><div class="ttdef"><b>Definition:</b> list.h:8</div></div>
|
|
<div class="ttc" id="aadaline__learning_8c_html_a00dc6134ca22a12e0fd9cac54d601c2d"><div class="ttname"><a href="../../dd/d8c/adaline__learning_8c.html#a00dc6134ca22a12e0fd9cac54d601c2d">get_weights_str</a></div><div class="ttdeci">char * get_weights_str(struct adaline *ada)</div><div class="ttdoc">Operator to print the weights of the model.</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:100</div></div>
|
|
<div class="ttc" id="akohonen__som__trace_8c_html_a7b84b14e60f47812b581d1f93057c85a"><div class="ttname"><a href="../../d0/d46/kohonen__som__trace_8c.html#a7b84b14e60f47812b581d1f93057c85a">save_nd_data</a></div><div class="ttdeci">int save_nd_data(const char *fname, double **X, int num_points, int num_features)</div><div class="ttdoc">Save a given n-dimensional data martix to file.</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.c:64</div></div>
|
|
<div class="ttc" id="astructadaline_html_a32e58c03fd9258709eae6138ad0ec657"><div class="ttname"><a href="../../d2/daa/structadaline.html#a32e58c03fd9258709eae6138ad0ec657">adaline::weights</a></div><div class="ttdeci">double * weights</div><div class="ttdoc">weights of the neural network</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:40</div></div>
|
|
<div class="ttc" id="aode__forward__euler_8c_html_ae6c9413953c8d9d4bc9e374b29586350"><div class="ttname"><a href="../../d4/d07/ode__forward__euler_8c.html#ae6c9413953c8d9d4bc9e374b29586350">forward_euler_step</a></div><div class="ttdeci">void forward_euler_step(const double dx, const double *x, double *y, double *dy)</div><div class="ttdoc">Compute next step approximation using the forward-Euler method.</div><div class="ttdef"><b>Definition:</b> ode_forward_euler.c:82</div></div>
|
|
<div class="ttc" id="akohonen__som__trace_8c_html_affe776513b24d84b39af8ab0930fef7f"><div class="ttname"><a href="../../d0/d46/kohonen__som__trace_8c.html#affe776513b24d84b39af8ab0930fef7f">max</a></div><div class="ttdeci">#define max(a, b)</div><div class="ttdoc">shorthand for maximum value</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.c:26</div></div>
|
|
<div class="ttc" id="akohonen__som__topology_8c_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="../../d2/df6/kohonen__som__topology_8c.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">Test that creates a random set of points distributed in eight clusters in 3D space and trains an SOM ...</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:596</div></div>
|
|
<div class="ttc" id="aode__midpoint__euler_8c_html_a8caee977b26888d34040b122e0e28e3a"><div class="ttname"><a href="../../d1/dc2/ode__midpoint__euler_8c.html#a8caee977b26888d34040b122e0e28e3a">exact_solution</a></div><div class="ttdeci">void exact_solution(const double *x, double *y)</div><div class="ttdoc">Exact solution of the problem.</div><div class="ttdef"><b>Definition:</b> ode_midpoint_euler.c:67</div></div>
|
|
<div class="ttc" id="astruct__cantor__set_html_a2f7f9f19125725d3e5673fdb4ac8cfb1"><div class="ttname"><a href="../../d9/dd7/struct__cantor__set.html#a2f7f9f19125725d3e5673fdb4ac8cfb1">_cantor_set::next</a></div><div class="ttdeci">struct _cantor_set * next</div><div class="ttdoc">pointer to next set</div><div class="ttdef"><b>Definition:</b> cantor_set.c:15</div></div>
|
|
<div class="ttc" id="acantor__set_8c_html_abf9e6b7e6f15df4b525a2e7705ba3089"><div class="ttname"><a href="../../dc/d80/cantor__set_8c.html#abf9e6b7e6f15df4b525a2e7705ba3089">main</a></div><div class="ttdeci">int main(int argc, char const *argv[])</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> cantor_set.c:84</div></div>
|
|
<div class="ttc" id="aproblem__26_2sol1_8c_html_ac70138609ef6aa6fabca57aca8681e83"><div class="ttname"><a href="../../d1/df9/problem__26_2sol1_8c.html#ac70138609ef6aa6fabca57aca8681e83">compare</a></div><div class="ttdeci">int compare(const void *a, const void *b)</div><div class="ttdoc">comparison function for use with internal qsort algorithm</div><div class="ttdef"><b>Definition:</b> sol1.c:19</div></div>
|
|
<div class="ttc" id="alu__decompose_8c_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../dc/d2e/lu__decompose_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> lu_decompose.c:79</div></div>
|
|
<div class="ttc" id="aode__semi__implicit__euler_8c_html_a0ddf1224851353fc92bfbff6f499fa97"><div class="ttname"><a href="../../d4/d99/ode__semi__implicit__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97">main</a></div><div class="ttdeci">int main(int argc, char *argv[])</div><div class="ttdoc">Main Function.</div><div class="ttdef"><b>Definition:</b> ode_semi_implicit_euler.c:147</div></div>
|
|
<div class="ttc" id="akohonen__som__topology_8c_html_ac6afabdc09a49a433ee19d8a9486056d"><div class="ttname"><a href="../../d2/df6/kohonen__som__topology_8c.html#ac6afabdc09a49a433ee19d8a9486056d">min</a></div><div class="ttdeci">#define min(a, b)</div><div class="ttdoc">shorthand for minimum value</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:36</div></div>
|
|
<div class="ttc" id="acantor__set_8c_html_a1f156d2b53b80305bd2fa3ff5fdf3c97"><div class="ttname"><a href="../../dc/d80/cantor__set_8c.html#a1f156d2b53b80305bd2fa3ff5fdf3c97">propagate</a></div><div class="ttdeci">void propagate(CantorSet *head)</div><div class="ttdoc">Iterative constructor of all sets in the current level.</div><div class="ttdef"><b>Definition:</b> cantor_set.c:23</div></div>
|
|
<div class="ttc" id="aqr__decompose_8h_html_abeec1f78a7a7e7251687e75340331212"><div class="ttname"><a href="../../d4/d68/qr__decompose_8h.html#abeec1f78a7a7e7251687e75340331212">vector_mag</a></div><div class="ttdeci">double vector_mag(double *vector, int L)</div><div class="ttdoc">Compute magnitude of vector.</div><div class="ttdef"><b>Definition:</b> qr_decompose.h:64</div></div>
|
|
<div class="ttc" id="aadaline__learning_8c_html_a6f35caa3084772cc126ac7b20f67f665"><div class="ttname"><a href="../../dd/d8c/adaline__learning_8c.html#a6f35caa3084772cc126ac7b20f67f665">delete_adaline</a></div><div class="ttdeci">void delete_adaline(struct adaline *ada)</div><div class="ttdoc">delete dynamically allocated memory</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:82</div></div>
|
|
<div class="ttc" id="akohonen__som__trace_8c_html_a107f00650b8041f77767927073ddddb8"><div class="ttname"><a href="../../d0/d46/kohonen__som__trace_8c.html#a107f00650b8041f77767927073ddddb8">test_circle</a></div><div class="ttdeci">void test_circle(double *const *data, int N)</div><div class="ttdoc">Creates a random set of points distributed near the circumference of a circle and trains an SOM that ...</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.c:212</div></div>
|
|
<div class="ttc" id="aode__forward__euler_8c_html_aaf88ad8f9f7c39fc38f3f03d6fea9df9"><div class="ttname"><a href="../../d4/d07/ode__forward__euler_8c.html#aaf88ad8f9f7c39fc38f3f03d6fea9df9">forward_euler</a></div><div class="ttdeci">double forward_euler(double dx, double x0, double x_max, double *y, char save_to_file)</div><div class="ttdoc">Compute approximation using the forward-Euler method in the given limits.</div><div class="ttdef"><b>Definition:</b> ode_forward_euler.c:99</div></div>
|
|
<div class="ttc" id="akohonen__som__topology_8c_html_ad139de302fa8135a433d9c1bf971b13b"><div class="ttname"><a href="../../d2/df6/kohonen__som__topology_8c.html#ad139de302fa8135a433d9c1bf971b13b">update_weights</a></div><div class="ttdeci">double update_weights(const double *X, struct array_3d *W, double **D, int num_out, int num_features, double alpha, int R)</div><div class="ttdoc">Update weights of the SOM using Kohonen algorithm.</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:227</div></div>
|
|
<div class="ttc" id="astructarray__3d_html_ac8967b2c72769f839c09fb4cebb4339f"><div class="ttname"><a href="../../d0/dc8/structarray__3d.html#ac8967b2c72769f839c09fb4cebb4339f">array_3d::data</a></div><div class="ttdeci">double * data</div><div class="ttdoc">pointer to data</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:45</div></div>
|
|
<div class="ttc" id="astructdata_html"><div class="ttname"><a href="../../df/dea/structdata.html">data</a></div><div class="ttdef"><b>Definition:</b> prime_factoriziation.c:25</div></div>
|
|
<div class="ttc" id="astructpid_html"><div class="ttname"><a href="../../d0/d43/structpid.html">pid</a></div><div class="ttdoc">PID Controller.</div><div class="ttdef"><b>Definition:</b> pid.c:31</div></div>
|
|
<div class="ttc" id="anewton__raphson__root_8c_html_ae713a1fd0c275fbec7edf263ac2c0337"><div class="ttname"><a href="../../dd/d08/newton__raphson__root_8c.html#ae713a1fd0c275fbec7edf263ac2c0337">d_func</a></div><div class="ttdeci">double complex d_func(double complex x)</div><div class="ttdoc">Return first order derivative of the function.</div><div class="ttdef"><b>Definition:</b> newton_raphson_root.c:32</div></div>
|
|
<div class="ttc" id="acantor__set_8c_html_a2b95c356aff8a282eaad255008fa5a94"><div class="ttname"><a href="../../dc/d80/cantor__set_8c.html#a2b95c356aff8a282eaad255008fa5a94">CantorSet</a></div><div class="ttdeci">struct _cantor_set CantorSet</div><div class="ttdoc">structure to define Cantor set</div></div>
|
|
<div class="ttc" id="akohonen__som__topology_8c_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../d2/df6/kohonen__som__topology_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:656</div></div>
|
|
<div class="ttc" id="aadaline__learning_8c_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../dd/d8c/adaline__learning_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:379</div></div>
|
|
<div class="ttc" id="akohonen__som__topology_8c_html_a7237d2cf3b3f9d034477268c1d6631da"><div class="ttname"><a href="../../d2/df6/kohonen__som__topology_8c.html#a7237d2cf3b3f9d034477268c1d6631da">data_3d</a></div><div class="ttdeci">double * data_3d(const struct array_3d *arr, int x, int y, int z)</div><div class="ttdoc">Function that returns the pointer to (x, y, z) ^th location in the linear 3D array given by:</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:60</div></div>
|
|
<div class="ttc" id="akohonen__som__trace_8c_html_aeaeffbff2be4d5d15b0d4f10f846abde"><div class="ttname"><a href="../../d0/d46/kohonen__som__trace_8c.html#aeaeffbff2be4d5d15b0d4f10f846abde">kohonen_som_tracer</a></div><div class="ttdeci">void kohonen_som_tracer(double **X, double *const *W, int num_samples, int num_features, int num_out, double alpha_min)</div><div class="ttdoc">Apply incremental algorithm with updating neighborhood and learning rates on all samples in the given...</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.c:173</div></div>
|
|
<div class="ttc" id="akohonen__som__topology_8c_html_ad9e25202bb8b481461f932668f249dbc"><div class="ttname"><a href="../../d2/df6/kohonen__som__topology_8c.html#ad9e25202bb8b481461f932668f249dbc">test_3d_classes1</a></div><div class="ttdeci">void test_3d_classes1(double *const *data, int N)</div><div class="ttdoc">Creates a random set of points distributed in four clusters in 3D space with centroids at the points.</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:452</div></div>
|
|
<div class="ttc" id="akohonen__som__trace_8c_html_a9c98203f55242ff7a8f45a6370840e66"><div class="ttname"><a href="../../d0/d46/kohonen__som__trace_8c.html#a9c98203f55242ff7a8f45a6370840e66">update_weights</a></div><div class="ttdeci">void update_weights(double const *x, double *const *W, double *D, int num_out, int num_features, double alpha, int R)</div><div class="ttdoc">Update weights of the SOM using Kohonen algorithm.</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.c:123</div></div>
|
|
<div class="ttc" id="astruct_b_s_t_iterator_html"><div class="ttname"><a href="../../d4/d02/struct_b_s_t_iterator.html">BSTIterator</a></div><div class="ttdoc">Definition for a binary tree node.</div><div class="ttdef"><b>Definition:</b> 173.c:13</div></div>
|
|
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdoc">Kyler Smith, 2017 Stack data structure implementation.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:14</div></div>
|
|
<div class="ttc" id="aqr__decompose_8h_html_a82b20e027437df768d7e994cf4cae29f"><div class="ttname"><a href="../../d4/d68/qr__decompose_8h.html#a82b20e027437df768d7e994cf4cae29f">vector_proj</a></div><div class="ttdeci">double * vector_proj(double *a, double *b, double *out, int L)</div><div class="ttdoc">Compute projection of vector on defined as.</div><div class="ttdef"><b>Definition:</b> qr_decompose.h:76</div></div>
|
|
<div class="ttc" id="acantor__set_8c_html_a85df3c64a683100ac6246e1e034df43d"><div class="ttname"><a href="../../dc/d80/cantor__set_8c.html#a85df3c64a683100ac6246e1e034df43d">free_memory</a></div><div class="ttdeci">void free_memory(CantorSet *head)</div><div class="ttdoc">Clear memory allocated by propagate function.</div><div class="ttdef"><b>Definition:</b> cantor_set.c:72</div></div>
|
|
<div class="ttc" id="astruct__large__num_html_a3fd11c0b413bbabfb8737d4ae73e5aa0"><div class="ttname"><a href="../../d3/d5a/struct__large__num.html#a3fd11c0b413bbabfb8737d4ae73e5aa0">_large_num::num_digits</a></div><div class="ttdeci">unsigned int num_digits</div><div class="ttdoc">number of digits in the number</div><div class="ttdef"><b>Definition:</b> factorial_large_number.c:17</div></div>
|
|
<div class="ttc" id="akohonen__som__trace_8c_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="../../d0/d46/kohonen__som__trace_8c.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">Test that creates a random set of points distributed in six clusters in 3D space.</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.c:451</div></div>
|
|
<div class="ttc" id="akohonen__som__topology_8c_html_a5bb02a8322d717ead1b11182c5f02a3a"><div class="ttname"><a href="../../d2/df6/kohonen__som__topology_8c.html#a5bb02a8322d717ead1b11182c5f02a3a">test_3d_classes2</a></div><div class="ttdeci">void test_3d_classes2(double *const *data, int N)</div><div class="ttdoc">Creates a random set of points distributed in four clusters in 3D space with centroids at the points.</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:551</div></div>
|
|
<div class="ttc" id="aproblem__13_2sol1_8c_html_a0240ac851181b84ac374872dc5434ee4"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a></div><div class="ttdeci">#define N</div><div class="ttdoc">number of digits of the large number</div><div class="ttdef"><b>Definition:</b> sol1.c:109</div></div>
|
|
<div class="ttc" id="akohonen__som__trace_8c_html_a0a292ebd954c568934b1fd06666d27e6"><div class="ttname"><a href="../../d0/d46/kohonen__som__trace_8c.html#a0a292ebd954c568934b1fd06666d27e6">get_min_1d</a></div><div class="ttdeci">void get_min_1d(double const *X, int N, double *val, int *idx)</div><div class="ttdoc">Get minimum value and index of the value in a vector.</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.c:98</div></div>
|
|
<div class="ttc" id="aqr__decompose_8h_html_a45c7640d9d22c89c11beb1f567843c56"><div class="ttname"><a href="../../d4/d68/qr__decompose_8h.html#a45c7640d9d22c89c11beb1f567843c56">qr_decompose</a></div><div class="ttdeci">void qr_decompose(double **A, double **Q, double **R, int M, int N)</div><div class="ttdoc">Decompose matrix using Gram-Schmidt process.</div><div class="ttdef"><b>Definition:</b> qr_decompose.h:142</div></div>
|
|
<div class="ttc" id="adurand__kerner__roots_8c_html_afa5b04ce11475d67049cba8273741fb7"><div class="ttname"><a href="../../da/d38/durand__kerner__roots_8c.html#afa5b04ce11475d67049cba8273741fb7">complex_str</a></div><div class="ttdeci">const char * complex_str(long double complex x)</div><div class="ttdoc">create a textual form of complex number</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.c:66</div></div>
|
|
<div class="ttc" id="astruct_t_html"><div class="ttname"><a href="../../d5/d7e/struct_t.html">T</a></div><div class="ttdef"><b>Definition:</b> stack.c:16</div></div>
|
|
<div class="ttc" id="afibonacci__fast_8c_html_a0ddf1224851353fc92bfbff6f499fa97"><div class="ttname"><a href="../../d4/d99/fibonacci__fast_8c.html#a0ddf1224851353fc92bfbff6f499fa97">main</a></div><div class="ttdeci">int main(int argc, char *argv[])</div><div class="ttdoc">main function</div><div class="ttdef"><b>Definition:</b> fibonacci_fast.c:61</div></div>
|
|
<div class="ttc" id="afactorial__large__number_8c_html_ab54882961780c41a4929a6d390f6522d"><div class="ttname"><a href="../../d6/d3d/factorial__large__number_8c.html#ab54882961780c41a4929a6d390f6522d">large_num</a></div><div class="ttdeci">struct _large_num large_num</div><div class="ttdoc">dynamically large number</div></div>
|
|
<div class="ttc" id="akohonen__som__topology_8c_html_adee1bc3871c881f6e04cb9e0b1d01158"><div class="ttname"><a href="../../d2/df6/kohonen__som__topology_8c.html#adee1bc3871c881f6e04cb9e0b1d01158">save_u_matrix</a></div><div class="ttdeci">int save_u_matrix(const char *fname, struct array_3d *W)</div><div class="ttdoc">Create the distance matrix or U-matrix from the trained weights and save to disk.</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:132</div></div>
|
|
<div class="ttc" id="afactorial__large__number_8c_html_ad8101f58545bd891ae8b6e11caadd7eb"><div class="ttname"><a href="../../d6/d3d/factorial__large__number_8c.html#ad8101f58545bd891ae8b6e11caadd7eb">new_number</a></div><div class="ttdeci">large_num * new_number(void)</div><div class="ttdoc">create a new large number</div><div class="ttdef"><b>Definition:</b> factorial_large_number.c:24</div></div>
|
|
<div class="ttc" id="adurand__kerner__roots_8c_html_a26d5695ebed0818a3e7cf4b10aacab52"><div class="ttname"><a href="../../da/d38/durand__kerner__roots_8c.html#a26d5695ebed0818a3e7cf4b10aacab52">check_termination</a></div><div class="ttdeci">char check_termination(long double delta)</div><div class="ttdoc">check for termination condition</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.c:83</div></div>
|
|
<div class="ttc" id="aode__semi__implicit__euler_8c_html_ad80059877222f885b549f2d0a3dc6b55"><div class="ttname"><a href="../../d4/d99/ode__semi__implicit__euler_8c.html#ad80059877222f885b549f2d0a3dc6b55">semi_implicit_euler</a></div><div class="ttdeci">double semi_implicit_euler(double dx, double x0, double x_max, double *y, char save_to_file)</div><div class="ttdoc">Compute approximation using the semi-implicit-Euler method in the given limits.</div><div class="ttdef"><b>Definition:</b> ode_semi_implicit_euler.c:109</div></div>
|
|
<div class="ttc" id="adurand__kerner__roots_8c_html_a321f9781a9744ccdaf0aba89f35ec29c"><div class="ttname"><a href="../../da/d38/durand__kerner__roots_8c.html#a321f9781a9744ccdaf0aba89f35ec29c">poly_function</a></div><div class="ttdeci">long double complex poly_function(long double *coeffs, unsigned int degree, long double complex x)</div><div class="ttdoc">Evaluate the value of a polynomial with given coefficients.</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.c:50</div></div>
|
|
<div class="ttc" id="afactorial__large__number_8c_html_a0ddf1224851353fc92bfbff6f499fa97"><div class="ttname"><a href="../../d6/d3d/factorial__large__number_8c.html#a0ddf1224851353fc92bfbff6f499fa97">main</a></div><div class="ttdeci">int main(int argc, char *argv[])</div><div class="ttdoc">main function</div><div class="ttdef"><b>Definition:</b> factorial_large_number.c:94</div></div>
|
|
<div class="ttc" id="afactorial__large__number_8c_html_ad398ddbd594ca69a5e6dfc894925341e"><div class="ttname"><a href="../../d6/d3d/factorial__large__number_8c.html#ad398ddbd594ca69a5e6dfc894925341e">multiply</a></div><div class="ttdeci">void multiply(large_num *num, unsigned long n)</div><div class="ttdoc">multiply large number with another integer and store the result in the same large number</div><div class="ttdef"><b>Definition:</b> factorial_large_number.c:66</div></div>
|
|
<div class="ttc" id="akohonen__som__trace_8c_html_af5ce14f026d6d231bef29161bac2b485"><div class="ttname"><a href="../../d0/d46/kohonen__som__trace_8c.html#af5ce14f026d6d231bef29161bac2b485">_random</a></div><div class="ttdeci">double _random(double a, double b)</div><div class="ttdoc">Helper function to generate a random number in a given interval.</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.c:48</div></div>
|
|
<div class="ttc" id="akohonen__som__trace_8c_html_aa2246f940155472084ee461f3685d614"><div class="ttname"><a href="../../d0/d46/kohonen__som__trace_8c.html#aa2246f940155472084ee461f3685d614">test_lamniscate</a></div><div class="ttdeci">void test_lamniscate(double *const *data, int N)</div><div class="ttdoc">Creates a random set of points distributed near the locus of the Lamniscate of Gerono.</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.c:308</div></div>
|
|
<div class="ttc" id="aproblem__5_2sol_8c_html_ae9606f1867e9921867d6572f51377b4c"><div class="ttname"><a href="../../df/de7/problem__5_2sol_8c.html#ae9606f1867e9921867d6572f51377b4c">lcm</a></div><div class="ttdeci">unsigned long lcm(unsigned long a, unsigned long b)</div><div class="ttdoc">Compute Least Common Multiple (LCM) of two numbers.</div><div class="ttdef"><b>Definition:</b> sol.c:31</div></div>
|
|
<div class="ttc" id="aode__midpoint__euler_8c_html_affe6cc2ab040b94a29e6c41782f72d51"><div class="ttname"><a href="../../d1/dc2/ode__midpoint__euler_8c.html#affe6cc2ab040b94a29e6c41782f72d51">midpoint_euler_step</a></div><div class="ttdeci">void midpoint_euler_step(double dx, double *x, double *y, double *dy)</div><div class="ttdoc">Compute next step approximation using the midpoint-Euler method.</div><div class="ttdef"><b>Definition:</b> ode_midpoint_euler.c:83</div></div>
|
|
<div class="ttc" id="anewton__raphson__root_8c_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../dd/d08/newton__raphson__root_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdoc">main function</div><div class="ttdef"><b>Definition:</b> newton_raphson_root.c:37</div></div>
|
|
<div class="ttc" id="akohonen__som__trace_8c_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../d0/d46/kohonen__som__trace_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.c:506</div></div>
|
|
<div class="ttc" id="afibonacci__fast_8c_html_a7a3d55bd19854075cba2eed6b63cb2d3"><div class="ttname"><a href="../../d4/d99/fibonacci__fast_8c.html#a7a3d55bd19854075cba2eed6b63cb2d3">fib</a></div><div class="ttdeci">void fib(unsigned long n, unsigned long *C, unsigned long *D)</div><div class="ttdoc">Returns the and Fibonacci number.</div><div class="ttdef"><b>Definition:</b> fibonacci_fast.c:20</div></div>
|
|
<div class="ttc" id="astruct__cantor__set_html_abd2176c3cc3a1d85d15bbeaace35fa03"><div class="ttname"><a href="../../d9/dd7/struct__cantor__set.html#abd2176c3cc3a1d85d15bbeaace35fa03">_cantor_set::start</a></div><div class="ttdeci">double start</div><div class="ttdoc">start of interval</div><div class="ttdef"><b>Definition:</b> cantor_set.c:13</div></div>
|
|
<div class="ttc" id="astruct__cantor__set_html_acfc25ab716a3c79be8a5a4cab94e8def"><div class="ttname"><a href="../../d9/dd7/struct__cantor__set.html#acfc25ab716a3c79be8a5a4cab94e8def">_cantor_set::end</a></div><div class="ttdeci">double end</div><div class="ttdoc">end of interval</div><div class="ttdef"><b>Definition:</b> cantor_set.c:14</div></div>
|
|
<div class="ttc" id="aqr__decompose_8h_html_a90562ce8c3707401e9c5809dece68d6a"><div class="ttname"><a href="../../d4/d68/qr__decompose_8h.html#a90562ce8c3707401e9c5809dece68d6a">print_matrix</a></div><div class="ttdeci">void print_matrix(double **A, int M, int N)</div><div class="ttdoc">function to display matrix on stdout</div><div class="ttdef"><b>Definition:</b> qr_decompose.h:22</div></div>
|
|
<div class="ttc" id="aqr__decompose_8h_html_a3a584b79941a43d775f9d4ce446dbe05"><div class="ttname"><a href="../../d4/d68/qr__decompose_8h.html#a3a584b79941a43d775f9d4ce446dbe05">vector_dot</a></div><div class="ttdeci">double vector_dot(double *a, double *b, int L)</div><div class="ttdoc">Compute dot product of two vectors of equal lengths.</div><div class="ttdef"><b>Definition:</b> qr_decompose.h:43</div></div>
|
|
<div class="ttc" id="astructadaline_html_a85dbd7cce6195d11ebb388220b96bde2"><div class="ttname"><a href="../../d2/daa/structadaline.html#a85dbd7cce6195d11ebb388220b96bde2">adaline::eta</a></div><div class="ttdeci">double eta</div><div class="ttdoc">learning rate of the algorithm</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:39</div></div>
|
|
<div class="ttc" id="astructarray__3d_html_ad823bd5424a0fc158da52a0497d8c10a"><div class="ttname"><a href="../../d0/dc8/structarray__3d.html#ad823bd5424a0fc158da52a0497d8c10a">array_3d::dim3</a></div><div class="ttdeci">int dim3</div><div class="ttdoc">lengths of thirddimension</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:44</div></div>
|
|
<div class="ttc" id="aode__semi__implicit__euler_8c_html_a8caee977b26888d34040b122e0e28e3a"><div class="ttname"><a href="../../d4/d99/ode__semi__implicit__euler_8c.html#a8caee977b26888d34040b122e0e28e3a">exact_solution</a></div><div class="ttdeci">void exact_solution(const double *x, double *y)</div><div class="ttdoc">Exact solution of the problem.</div><div class="ttdef"><b>Definition:</b> ode_semi_implicit_euler.c:71</div></div>
|
|
<div class="ttc" id="aode__midpoint__euler_8c_html_a0ddf1224851353fc92bfbff6f499fa97"><div class="ttname"><a href="../../d1/dc2/ode__midpoint__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97">main</a></div><div class="ttdeci">int main(int argc, char *argv[])</div><div class="ttdoc">Main Function.</div><div class="ttdef"><b>Definition:</b> ode_midpoint_euler.c:144</div></div>
|
|
<div class="ttc" id="astructarray__3d_html_ad5d3ee546eea3c05dc8f0dc90ec194f4"><div class="ttname"><a href="../../d0/dc8/structarray__3d.html#ad5d3ee546eea3c05dc8f0dc90ec194f4">array_3d::dim1</a></div><div class="ttdeci">int dim1</div><div class="ttdoc">lengths of first dimension</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:42</div></div>
|
|
<div class="ttc" id="akohonen__som__topology_8c_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../d2/df6/kohonen__som__topology_8c.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">Test that creates a random set of points distributed in 4 clusters in 3D space and trains an SOM that...</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:493</div></div>
|
|
<div class="ttc" id="aode__forward__euler_8c_html_a97075291390a68c262ed66e157a57eb4"><div class="ttname"><a href="../../d4/d07/ode__forward__euler_8c.html#a97075291390a68c262ed66e157a57eb4">problem</a></div><div class="ttdeci">void problem(const double *x, double *y, double *dy)</div><div class="ttdoc">Problem statement for a system with first-order differential equations.</div><div class="ttdef"><b>Definition:</b> ode_forward_euler.c:55</div></div>
|
|
<div class="ttc" id="akohonen__som__topology_8c_html_adc22d512c00a9f5799ee067f4fb90b4b"><div class="ttname"><a href="../../d2/df6/kohonen__som__topology_8c.html#adc22d512c00a9f5799ee067f4fb90b4b">get_min_2d</a></div><div class="ttdeci">void get_min_2d(double **X, int N, double *val, int *x_idx, int *y_idx)</div><div class="ttdoc">Get minimum value and index of the value in a matrix.</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:197</div></div>
|
|
<div class="ttc" id="aode__semi__implicit__euler_8c_html_a97075291390a68c262ed66e157a57eb4"><div class="ttname"><a href="../../d4/d99/ode__semi__implicit__euler_8c.html#a97075291390a68c262ed66e157a57eb4">problem</a></div><div class="ttdeci">void problem(const double *x, double *y, double *dy)</div><div class="ttdoc">Problem statement for a system with first-order differential equations.</div><div class="ttdef"><b>Definition:</b> ode_semi_implicit_euler.c:58</div></div>
|
|
<div class="ttc" id="akohonen__som__topology_8c_html_af5ce14f026d6d231bef29161bac2b485"><div class="ttname"><a href="../../d2/df6/kohonen__som__topology_8c.html#af5ce14f026d6d231bef29161bac2b485">_random</a></div><div class="ttdeci">double _random(double a, double b)</div><div class="ttdoc">Helper function to generate a random number in a given interval.</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:80</div></div>
|
|
<div class="ttc" id="akohonen__som__trace_8c_html_a2256c10b16edba377b64a44b6c656908"><div class="ttname"><a href="../../d0/d46/kohonen__som__trace_8c.html#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a></div><div class="ttdeci">double get_clock_diff(clock_t start_t, clock_t end_t)</div><div class="ttdoc">Convert clock cycle difference to time in seconds.</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.c:500</div></div>
|
|
<div class="ttc" id="aode__semi__implicit__euler_8c_html_a9ceb646336224ee890a269d0b4600d09"><div class="ttname"><a href="../../d4/d99/ode__semi__implicit__euler_8c.html#a9ceb646336224ee890a269d0b4600d09">order</a></div><div class="ttdeci">#define order</div><div class="ttdoc">number of dependent variables in problem</div><div class="ttdef"><b>Definition:</b> ode_semi_implicit_euler.c:47</div></div>
|
|
<div class="ttc" id="aproblem__26_2sol1_8c_html_aabf4f709c8199e41cf279c77112345fe"><div class="ttname"><a href="../../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe">MAX_LEN</a></div><div class="ttdeci">#define MAX_LEN</div><div class="ttdoc">length of resulting recurring fraction number</div><div class="ttdef"><b>Definition:</b> sol1.c:15</div></div>
|
|
<div class="ttc" id="athreaded__binary__trees_8c_html_ad8ecdcce462dd8e170ae1f164935aaa6"><div class="ttname"><a href="../../df/d3c/threaded__binary__trees_8c.html#ad8ecdcce462dd8e170ae1f164935aaa6">node</a></div><div class="ttdeci">struct Node node</div><div class="ttdoc">Node, the basic data structure of the tree.</div></div>
|
|
<div class="ttc" id="athreaded__binary__trees_8c_html_a306d567466f22e1e927aaed97d8bb58c"><div class="ttname"><a href="../../df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c">search</a></div><div class="ttdeci">void search(node *root, int ele)</div><div class="ttdoc">searches for the element</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:98</div></div>
|
|
<div class="ttc" id="aproblem__5_2sol_8c_html_a59347107cbfdf48d51108e50280e760d"><div class="ttname"><a href="../../df/de7/problem__5_2sol_8c.html#a59347107cbfdf48d51108e50280e760d">gcd</a></div><div class="ttdeci">unsigned long gcd(unsigned long a, unsigned long b)</div><div class="ttdoc">Compute Greatest Common Divisor (GCD) of two numbers using Euclids algorithm.</div><div class="ttdef"><b>Definition:</b> sol.c:11</div></div>
|
|
<div class="ttc" id="aadaline__learning_8c_html_a4db1ba00a7f282100ea31a94e32bd7a3"><div class="ttname"><a href="../../dd/d8c/adaline__learning_8c.html#a4db1ba00a7f282100ea31a94e32bd7a3">predict</a></div><div class="ttdeci">int predict(struct adaline *ada, const double *x, double *out)</div><div class="ttdoc">predict the output of the model for given set of features</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:124</div></div>
|
|
<div class="ttc" id="afactorial__large__number_8c_html_ab5c854e0df76165c31899e69eceeeaae"><div class="ttname"><a href="../../d6/d3d/factorial__large__number_8c.html#ab5c854e0df76165c31899e69eceeeaae">delete_number</a></div><div class="ttdeci">void delete_number(large_num *num)</div><div class="ttdoc">delete all memory allocated for large number</div><div class="ttdef"><b>Definition:</b> factorial_large_number.c:37</div></div>
|
|
<div class="ttc" id="alu__decompose_8c_html_aae40b90a8efd645c749128cf8072bbb4"><div class="ttname"><a href="../../dc/d2e/lu__decompose_8c.html#aae40b90a8efd645c749128cf8072bbb4">lu_decomposition</a></div><div class="ttdeci">int lu_decomposition(double **A, double **L, double **U, int mat_size)</div><div class="ttdoc">Perform LU decomposition on matrix.</div><div class="ttdef"><b>Definition:</b> lu_decompose.c:20</div></div>
|
|
<div class="ttc" id="astructarray__3d_html"><div class="ttname"><a href="../../d0/dc8/structarray__3d.html">array_3d</a></div><div class="ttdoc">to store info regarding 3D arrays</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:41</div></div>
|
|
<div class="ttc" id="aadaline__learning_8c_html_acd88962c5f6341e43cbc69b4a7d3485b"><div class="ttname"><a href="../../dd/d8c/adaline__learning_8c.html#acd88962c5f6341e43cbc69b4a7d3485b">new_adaline</a></div><div class="ttdeci">struct adaline new_adaline(const int num_features, const double eta)</div><div class="ttdoc">Default constructor.</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:52</div></div>
|
|
<div class="ttc" id="aqr__decompose_8h_html_a6b6a0e75e75ff7919057dd275bb69145"><div class="ttname"><a href="../../d4/d68/qr__decompose_8h.html#a6b6a0e75e75ff7919057dd275bb69145">vector_sub</a></div><div class="ttdeci">double * vector_sub(double *a, double *b, double *out, int L)</div><div class="ttdoc">Compute vector subtraction.</div><div class="ttdef"><b>Definition:</b> qr_decompose.h:101</div></div>
|
|
<div class="ttc" id="adurand__kerner__roots_8c_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../da/d38/durand__kerner__roots_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.c:95</div></div>
|
|
<div class="ttc" id="aadaline__learning_8c_html_a3f37b9f073f7e57fd0b39d70718af1b1"><div class="ttname"><a href="../../dd/d8c/adaline__learning_8c.html#a3f37b9f073f7e57fd0b39d70718af1b1">test3</a></div><div class="ttdeci">void test3(double eta)</div><div class="ttdoc">test function to predict points in a 3D coordinate system lying within the sphere of radius 1 and cen...</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:317</div></div>
|
|
<div class="ttc" id="ac__atoi__str__to__integer_8c_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../d7/dd8/c__atoi__str__to__integer_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdoc">the main function take one argument of type char* example : .</div><div class="ttdef"><b>Definition:</b> c_atoi_str_to_integer.c:72</div></div>
|
|
<div class="ttc" id="alu__decompose_8c_html_a0789beb8d3396582d77b7aedf5e5554a"><div class="ttname"><a href="../../dc/d2e/lu__decompose_8c.html#a0789beb8d3396582d77b7aedf5e5554a">display</a></div><div class="ttdeci">void display(double **A, int N)</div><div class="ttdoc">Function to display square matrix.</div><div class="ttdef"><b>Definition:</b> lu_decompose.c:66</div></div>
|
|
<div class="ttc" id="aode__midpoint__euler_8c_html_a9ceb646336224ee890a269d0b4600d09"><div class="ttname"><a href="../../d1/dc2/ode__midpoint__euler_8c.html#a9ceb646336224ee890a269d0b4600d09">order</a></div><div class="ttdeci">#define order</div><div class="ttdoc">number of dependent variables in problem</div><div class="ttdef"><b>Definition:</b> ode_midpoint_euler.c:43</div></div>
|
|
<div class="ttc" id="aode__forward__euler_8c_html_a8caee977b26888d34040b122e0e28e3a"><div class="ttname"><a href="../../d4/d07/ode__forward__euler_8c.html#a8caee977b26888d34040b122e0e28e3a">exact_solution</a></div><div class="ttdeci">void exact_solution(const double *x, double *y)</div><div class="ttdoc">Exact solution of the problem.</div><div class="ttdef"><b>Definition:</b> ode_forward_euler.c:68</div></div>
|
|
<div class="ttc" id="akohonen__som__trace_8c_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../d0/d46/kohonen__som__trace_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">Test that creates a random set of points distributed near the circumference of a circle and trains an...</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.c:250</div></div>
|
|
<div class="ttc" id="akohonen__som__trace_8c_html_ac6afabdc09a49a433ee19d8a9486056d"><div class="ttname"><a href="../../d0/d46/kohonen__som__trace_8c.html#ac6afabdc09a49a433ee19d8a9486056d">min</a></div><div class="ttdeci">#define min(a, b)</div><div class="ttdoc">shorthand for minimum value</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.c:30</div></div>
|
|
<div class="ttc" id="aode__forward__euler_8c_html_a0ddf1224851353fc92bfbff6f499fa97"><div class="ttname"><a href="../../d4/d07/ode__forward__euler_8c.html#a0ddf1224851353fc92bfbff6f499fa97">main</a></div><div class="ttdeci">int main(int argc, char *argv[])</div><div class="ttdoc">Main Function.</div><div class="ttdef"><b>Definition:</b> ode_forward_euler.c:137</div></div>
|
|
<div class="ttc" id="aadaline__learning_8c_html_afa953e811eaae199d121a7ddb619d604"><div class="ttname"><a href="../../dd/d8c/adaline__learning_8c.html#afa953e811eaae199d121a7ddb619d604">fit_sample</a></div><div class="ttdeci">double fit_sample(struct adaline *ada, const double *x, const int y)</div><div class="ttdoc">Update the weights of the model using supervised learning for one feature vector.</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:145</div></div>
|
|
<div class="ttc" id="akohonen__som__topology_8c_html_a6824dc6d973eb3339af7aef5fea78b0c"><div class="ttname"><a href="../../d2/df6/kohonen__som__topology_8c.html#a6824dc6d973eb3339af7aef5fea78b0c">save_2d_data</a></div><div class="ttdeci">int save_2d_data(const char *fname, double **X, int num_points, int num_features)</div><div class="ttdoc">Save a given n-dimensional data martix to file.</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:95</div></div>
|
|
<div class="ttc" id="anewton__raphson__root_8c_html_a72f87d423a488946b319627a454d3925"><div class="ttname"><a href="../../dd/d08/newton__raphson__root_8c.html#a72f87d423a488946b319627a454d3925">func</a></div><div class="ttdeci">double complex func(double complex x)</div><div class="ttdoc">Return value of the function to find the root for.</div><div class="ttdef"><b>Definition:</b> newton_raphson_root.c:22</div></div>
|
|
<div class="ttc" id="aadaline__learning_8c_html_a7b12b6513314c975303b5a698608322f"><div class="ttname"><a href="../../dd/d8c/adaline__learning_8c.html#a7b12b6513314c975303b5a698608322f">activation</a></div><div class="ttdeci">int activation(double x)</div><div class="ttdoc">Heaviside activation function</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:95</div></div>
|
|
<div class="ttc" id="abinary__search_8c_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../df/d3b/binary__search_8c.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition:</b> binary_search.c:75</div></div>
|
|
<div class="ttc" id="aadaline__learning_8c_html_ab4ecb3accf5d9e0263087e7265bbe3a9"><div class="ttname"><a href="../../dd/d8c/adaline__learning_8c.html#ab4ecb3accf5d9e0263087e7265bbe3a9">test1</a></div><div class="ttdeci">void test1(double eta)</div><div class="ttdoc">test function to predict points in a 2D coordinate system above the line as +1 and others as -1.</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:206</div></div>
|
|
<div class="ttc" id="aadaline__learning_8c_html_a05cc9a0acb524fde727a4d7b4a747ee6"><div class="ttname"><a href="../../dd/d8c/adaline__learning_8c.html#a05cc9a0acb524fde727a4d7b4a747ee6">test2</a></div><div class="ttdeci">void test2(double eta)</div><div class="ttdoc">test function to predict points in a 2D coordinate system above the line as +1 and others as -1.</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:254</div></div>
|
|
<div class="ttc" id="adurand__kerner__roots_8c_html_af270a96662132d0385cb6b4637c5a689"><div class="ttname"><a href="../../da/d38/durand__kerner__roots_8c.html#af270a96662132d0385cb6b4637c5a689">ACCURACY</a></div><div class="ttdeci">#define ACCURACY</div><div class="ttdoc">maximum accuracy limit</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.c:41</div></div>
|
|
<div class="ttc" id="aode__midpoint__euler_8c_html_a148003d8b261d040c1c41e73b40af1dd"><div class="ttname"><a href="../../d1/dc2/ode__midpoint__euler_8c.html#a148003d8b261d040c1c41e73b40af1dd">midpoint_euler</a></div><div class="ttdeci">double midpoint_euler(double dx, double x0, double x_max, double *y, char save_to_file)</div><div class="ttdoc">Compute approximation using the midpoint-Euler method in the given limits.</div><div class="ttdef"><b>Definition:</b> ode_midpoint_euler.c:106</div></div>
|
|
<div class="ttc" id="anewton__raphson__root_8c_html_af270a96662132d0385cb6b4637c5a689"><div class="ttname"><a href="../../dd/d08/newton__raphson__root_8c.html#af270a96662132d0385cb6b4637c5a689">ACCURACY</a></div><div class="ttdeci">#define ACCURACY</div><div class="ttdoc">solution accuracy</div><div class="ttdef"><b>Definition:</b> newton_raphson_root.c:16</div></div>
|
|
<div class="ttc" id="akohonen__som__trace_8c_html_a41ae16442e3e5b891a58d2e5932a2cd0"><div class="ttname"><a href="../../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0">test_3d_classes</a></div><div class="ttdeci">void test_3d_classes(double *const *data, int N)</div><div class="ttdoc">Creates a random set of points distributed in four clusters in 3D space with centroids at the points.</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.c:399</div></div>
|
|
<div class="ttc" id="ashell__sort2_8c_html_a4b9708d87be7a409eff20e5e7e8b43c8"><div class="ttname"><a href="../../d6/ded/shell__sort2_8c.html#a4b9708d87be7a409eff20e5e7e8b43c8">swap</a></div><div class="ttdeci">void swap(int *a, int *b)</div><div class="ttdoc">Function to swap values of two integers.</div><div class="ttdef"><b>Definition:</b> shell_sort2.c:19</div></div>
|
|
<div class="ttc" id="akohonen__som__topology_8c_html_affe776513b24d84b39af8ab0930fef7f"><div class="ttname"><a href="../../d2/df6/kohonen__som__topology_8c.html#affe776513b24d84b39af8ab0930fef7f">max</a></div><div class="ttdeci">#define max(a, b)</div><div class="ttdoc">shorthand for maximum value</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:32</div></div>
|
|
<div class="ttc" id="aadaline__learning_8c_html_a355fda53c238a0c0c07f03dcc021caed"><div class="ttname"><a href="../../dd/d8c/adaline__learning_8c.html#a355fda53c238a0c0c07f03dcc021caed">fit</a></div><div class="ttdeci">void fit(struct adaline *ada, double **X, const int *y, const int N)</div><div class="ttdoc">Update the weights of the model using supervised learning for an array of vectors.</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:171</div></div>
|
|
<div class="ttc" id="astructadaline_html"><div class="ttname"><a href="../../d2/daa/structadaline.html">adaline</a></div><div class="ttdoc">structure to hold adaline model parameters</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:38</div></div>
|
|
<div class="ttc" id="aode__semi__implicit__euler_8c_html_a720b7e995d2bbc615f94a2c7dbcf84eb"><div class="ttname"><a href="../../d4/d99/ode__semi__implicit__euler_8c.html#a720b7e995d2bbc615f94a2c7dbcf84eb">semi_implicit_euler_step</a></div><div class="ttdeci">void semi_implicit_euler_step(double dx, double *x, double *y, double *dy)</div><div class="ttdoc">Compute next step approximation using the semi-implicit-Euler method.</div><div class="ttdef"><b>Definition:</b> ode_semi_implicit_euler.c:85</div></div>
|
|
<div class="ttc" id="aadaline__learning_8c_html_af270a96662132d0385cb6b4637c5a689"><div class="ttname"><a href="../../dd/d8c/adaline__learning_8c.html#af270a96662132d0385cb6b4637c5a689">ACCURACY</a></div><div class="ttdeci">#define ACCURACY</div><div class="ttdoc">convergence accuracy</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:44</div></div>
|
|
<div class="ttc" id="akohonen__som__topology_8c_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../d2/df6/kohonen__som__topology_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">Test that creates a random set of points distributed in four clusters in 2D space and trains an SOM t...</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:393</div></div>
|
|
<div class="ttc" id="astructarray__3d_html_aa431cc0a41fd379270dbd2b0e3ac1b45"><div class="ttname"><a href="../../d0/dc8/structarray__3d.html#aa431cc0a41fd379270dbd2b0e3ac1b45">array_3d::dim2</a></div><div class="ttdeci">int dim2</div><div class="ttdoc">lengths of second dimension</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:43</div></div>
|
|
<div class="ttc" id="astruct__cantor__set_html"><div class="ttname"><a href="../../d9/dd7/struct__cantor__set.html">_cantor_set</a></div><div class="ttdoc">structure to define Cantor set</div><div class="ttdef"><b>Definition:</b> cantor_set.c:12</div></div>
|
|
<div class="ttc" id="astruct__large__num_html_afaf353a072cf050ac86ac6e39868bcc9"><div class="ttname"><a href="../../d3/d5a/struct__large__num.html#afaf353a072cf050ac86ac6e39868bcc9">_large_num::digits</a></div><div class="ttdeci">char * digits</div><div class="ttdoc">array to store individual digits</div><div class="ttdef"><b>Definition:</b> factorial_large_number.c:16</div></div>
|
|
<div class="ttc" id="akohonen__som__topology_8c_html_a1983dc0f35e734015772e9f8c0ff19f5"><div class="ttname"><a href="../../d2/df6/kohonen__som__topology_8c.html#a1983dc0f35e734015772e9f8c0ff19f5">kohonen_som</a></div><div class="ttdeci">void kohonen_som(double **X, struct array_3d *W, int num_samples, int num_features, int num_out, double alpha_min)</div><div class="ttdoc">Apply incremental algorithm with updating neighborhood and learning rates on all samples in the given...</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:306</div></div>
|
|
<div class="ttc" id="aode__midpoint__euler_8c_html_a97075291390a68c262ed66e157a57eb4"><div class="ttname"><a href="../../d1/dc2/ode__midpoint__euler_8c.html#a97075291390a68c262ed66e157a57eb4">problem</a></div><div class="ttdeci">void problem(const double *x, double *y, double *dy)</div><div class="ttdoc">Problem statement for a system with first-order differential equations.</div><div class="ttdef"><b>Definition:</b> ode_midpoint_euler.c:54</div></div>
|
|
<div class="ttc" id="acantor__set_8c_html_a75ee530cd7148a63249784ad3dda8fab"><div class="ttname"><a href="../../dc/d80/cantor__set_8c.html#a75ee530cd7148a63249784ad3dda8fab">print</a></div><div class="ttdeci">void print(CantorSet *head)</div><div class="ttdoc">Print sets in the current range to stdout</div><div class="ttdef"><b>Definition:</b> cantor_set.c:55</div></div>
|
|
<div class="ttc" id="aode__forward__euler_8c_html_a9ceb646336224ee890a269d0b4600d09"><div class="ttname"><a href="../../d4/d07/ode__forward__euler_8c.html#a9ceb646336224ee890a269d0b4600d09">order</a></div><div class="ttdeci">#define order</div><div class="ttdoc">number of dependent variables in problem</div><div class="ttdef"><b>Definition:</b> ode_forward_euler.c:44</div></div>
|
|
<div class="ttc" id="astructadaline_html_a53314e737a0a5ff4552a03bcc9dafbc1"><div class="ttname"><a href="../../d2/daa/structadaline.html#a53314e737a0a5ff4552a03bcc9dafbc1">adaline::num_weights</a></div><div class="ttdeci">int num_weights</div><div class="ttdoc">number of weights of the neural network</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:41</div></div>
|
|
<div class="ttc" id="afactorial__large__number_8c_html_af2869d36c22a2b8f93d3166a84e124b3"><div class="ttname"><a href="../../d6/d3d/factorial__large__number_8c.html#af2869d36c22a2b8f93d3166a84e124b3">add_digit</a></div><div class="ttdeci">void add_digit(large_num *num, unsigned int value)</div><div class="ttdoc">add a digit to the large number</div><div class="ttdef"><b>Definition:</b> factorial_large_number.c:48</div></div>
|
|
<div class="ttc" id="akohonen__som__topology_8c_html_a2256c10b16edba377b64a44b6c656908"><div class="ttname"><a href="../../d2/df6/kohonen__som__topology_8c.html#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a></div><div class="ttdeci">double get_clock_diff(clock_t start_t, clock_t end_t)</div><div class="ttdoc">Convert clock cycle difference to time in seconds.</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:650</div></div>
|
|
<div class="ttc" id="akohonen__som__topology_8c_html_adb5ded007be1fd666fab9affe6764018"><div class="ttname"><a href="../../d2/df6/kohonen__som__topology_8c.html#adb5ded007be1fd666fab9affe6764018">test_2d_classes</a></div><div class="ttdeci">void test_2d_classes(double *const *data, int N)</div><div class="ttdoc">Creates a random set of points distributed in four clusters in 3D space with centroids at the points.</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:353</div></div>
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../d4/d68/qr__decompose_8h.html">qr_decompose.h</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|