mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-07-09 05:27:00 +08:00
Documentation for c26eea874d
This commit is contained in:
@@ -4,7 +4,7 @@
|
||||
<head>
|
||||
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
||||
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
|
||||
<meta name="generator" content="Doxygen 1.12.0"/>
|
||||
<meta name="generator" content="Doxygen 1.13.2"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>TheAlgorithms/C++: numerical_methods/qr_eigen_values.cpp File Reference</title>
|
||||
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
||||
@@ -60,7 +60,7 @@ window.MathJax = {
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.12.0 -->
|
||||
<!-- Generated by Doxygen 1.13.2 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
||||
@@ -170,6 +170,9 @@ Functions</h2></td></tr>
|
||||
<tr class="separator:a0283886819c7c140a023582b7269e2d0"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a3c04138a5bfe5d72780bb7e82a18e627" id="r_a3c04138a5bfe5d72780bb7e82a18e627"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="#a3c04138a5bfe5d72780bb7e82a18e627">main</a> (int argc, char **argv)</td></tr>
|
||||
<tr class="separator:a3c04138a5bfe5d72780bb7e82a18e627"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:adfbdf47277c8cfee229b05b72f1f7834" id="r_adfbdf47277c8cfee229b05b72f1f7834"><td class="memTemplParams" colspan="2">template<typename T> </td></tr>
|
||||
<tr class="memitem:adfbdf47277c8cfee229b05b72f1f7834"><td class="memTemplItemLeft" align="right" valign="top">std::ostream & </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#adfbdf47277c8cfee229b05b72f1f7834">operator<<</a> (std::ostream &out, std::valarray< std::valarray< T > > const &v)</td></tr>
|
||||
<tr class="separator:adfbdf47277c8cfee229b05b72f1f7834"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>Compute real eigen values and eigen vectors of a symmetric matrix using <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> method. </p>
|
||||
@@ -220,14 +223,14 @@ Functions</h2></td></tr>
|
||||
<p class="definition">Definition at line <a class="el" href="../../de/d75/qr__eigen__values_8cpp_source.html#l00028">28</a> of file <a class="el" href="../../de/d75/qr__eigen__values_8cpp_source.html">qr_eigen_values.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 28</span> {</div>
|
||||
<div class="line"><span class="lineno"> 29</span> <span class="keywordtype">int</span> i, j, tmp, lim2 = <a class="code hl_define" href="#aee57a411f07599034f5ceb8cc7d65b40">LIMS</a> >> 1;</div>
|
||||
<div class="line"><span class="lineno"> 30</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = A->size();</div>
|
||||
<div class="line"><span class="lineno"> 30</span> <span class="keywordtype">int</span> N = A->size();</div>
|
||||
<div class="line"><span class="lineno"> 31</span> </div>
|
||||
<div class="line"><span class="lineno"> 32</span><span class="preprocessor">#ifdef _OPENMP</span></div>
|
||||
<div class="line"><span class="lineno"> 33</span><span class="preprocessor">#pragma omp for</span></div>
|
||||
<div class="line"><span class="lineno"> 34</span><span class="preprocessor">#endif</span></div>
|
||||
<div class="line"><span class="lineno"> 35</span> <span class="keywordflow">for</span> (i = 0; i < <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 35</span> <span class="keywordflow">for</span> (i = 0; i < N; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 36</span> A[0][i][i] = (std::rand() % <a class="code hl_define" href="#aee57a411f07599034f5ceb8cc7d65b40">LIMS</a>) - lim2;</div>
|
||||
<div class="line"><span class="lineno"> 37</span> <span class="keywordflow">for</span> (j = i + 1; j < <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; j++) {</div>
|
||||
<div class="line"><span class="lineno"> 37</span> <span class="keywordflow">for</span> (j = i + 1; j < N; j++) {</div>
|
||||
<div class="line"><span class="lineno"> 38</span> tmp = (std::rand() % <a class="code hl_define" href="#aee57a411f07599034f5ceb8cc7d65b40">LIMS</a>) - lim2;</div>
|
||||
<div class="line"><span class="lineno"> 39</span> A[0][i][j] = tmp; <span class="comment">// summetrically distribute random values</span></div>
|
||||
<div class="line"><span class="lineno"> 40</span> A[0][j][i] = tmp;</div>
|
||||
@@ -235,7 +238,6 @@ Functions</h2></td></tr>
|
||||
<div class="line"><span class="lineno"> 42</span> }</div>
|
||||
<div class="line"><span class="lineno"> 43</span>}</div>
|
||||
<div class="ttc" id="aqr__eigen__values_8cpp_html_aee57a411f07599034f5ceb8cc7d65b40"><div class="ttname"><a href="#aee57a411f07599034f5ceb8cc7d65b40">LIMS</a></div><div class="ttdeci">#define LIMS</div><div class="ttdef"><b>Definition</b> <a href="../../de/d75/qr__eigen__values_8cpp_source.html#l00020">qr_eigen_values.cpp:20</a></div></div>
|
||||
<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -371,6 +373,46 @@ Functions</h2></td></tr>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="adfbdf47277c8cfee229b05b72f1f7834" name="adfbdf47277c8cfee229b05b72f1f7834"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#adfbdf47277c8cfee229b05b72f1f7834">◆ </a></span>operator<<()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<typename T> </div>
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">std::ostream & qr_algorithm::operator<< </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">std::ostream &</td> <td class="paramname"><span class="paramname"><em>out</em></span>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">std::valarray< std::valarray< T > > const &</td> <td class="paramname"><span class="paramname"><em>v</em></span> )</td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>operator to print a matrix </p>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d4/d68/qr__decompose_8h_source.html#l00033">33</a> of file <a class="el" href="../../d4/d68/qr__decompose_8h_source.html">qr_decompose.h</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 34</span> {</div>
|
||||
<div class="line"><span class="lineno"> 35</span> <span class="keyword">const</span> <span class="keywordtype">int</span> width = 12;</div>
|
||||
<div class="line"><span class="lineno"> 36</span> <span class="keyword">const</span> <span class="keywordtype">char</span> separator = <span class="charliteral">' '</span>;</div>
|
||||
<div class="line"><span class="lineno"> 37</span> </div>
|
||||
<div class="line"><span class="lineno"> 38</span> out.precision(4);</div>
|
||||
<div class="line"><span class="lineno"> 39</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row < v.size(); row++) {</div>
|
||||
<div class="line"><span class="lineno"> 40</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col = 0; col < v[row].size(); col++)</div>
|
||||
<div class="line"><span class="lineno"> 41</span> out << std::right << std::setw(width) << std::setfill(separator)</div>
|
||||
<div class="line"><span class="lineno"> 42</span> << v[row][col];</div>
|
||||
<div class="line"><span class="lineno"> 43</span> out << std::endl;</div>
|
||||
<div class="line"><span class="lineno"> 44</span> }</div>
|
||||
<div class="line"><span class="lineno"> 45</span> </div>
|
||||
<div class="line"><span class="lineno"> 46</span> <span class="keywordflow">return</span> out;</div>
|
||||
<div class="line"><span class="lineno"> 47</span>}</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="a1440a7779ac56f47a3f355ce4a8c7da0" name="a1440a7779ac56f47a3f355ce4a8c7da0"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a1440a7779ac56f47a3f355ce4a8c7da0">◆ </a></span>test1()</h2>
|
||||
|
||||
@@ -483,7 +525,7 @@ Functions</h2></td></tr>
|
||||
<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="../../de/d75/qr__eigen__values_8cpp.html">qr_eigen_values.cpp</a></li>
|
||||
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
|
||||
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.13.2 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
|
||||
Reference in New Issue
Block a user