<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://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.5"/> <title>Eigen: SparseLU_heap_relax_snode.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="navtree.js"></script> <script type="text/javascript"> $(document).ready(initResizable); $(window).load(resizeHeight); </script> <link href="search/search.css" rel="stylesheet" type="text/css"/> <script type="text/javascript" src="search/search.js"></script> <script type="text/javascript"> $(document).ready(function() { searchBox.OnSelectItem(0); }); </script> <link href="doxygen.css" rel="stylesheet" type="text/css" /> <link href="eigendoxy.css" rel="stylesheet" type="text/css"> <!-- --> <script type="text/javascript" src="eigen_navtree_hacks.js"></script> <!-- <script type="text/javascript"> --> <!-- </script> --> </head> <body> <div id="top"><!-- do not remove this div, it is closed by doxygen! --> <!-- <a name="top"></a> --> <div id="titlearea"> <table cellspacing="0" cellpadding="0"> <tbody> <tr style="height: 56px;"> <td id="projectlogo"><img alt="Logo" src="Eigen_Silly_Professor_64x64.png"/></td> <td style="padding-left: 0.5em;"> <div id="projectname"><a href="http://eigen.tuxfamily.org">Eigen</a>  <span id="projectnumber">3.2.0</span> </div> </td> <td> <div id="MSearchBox" class="MSearchBoxInactive"> <span class="left"> <img id="MSearchSelect" src="search/mag_sel.png" onmouseover="return searchBox.OnSearchSelectShow()" onmouseout="return searchBox.OnSearchSelectHide()" alt=""/> <input type="text" id="MSearchField" value="Search" accesskey="S" onfocus="searchBox.OnSearchFieldFocus(true)" onblur="searchBox.OnSearchFieldFocus(false)" onkeyup="searchBox.OnSearchFieldChange(event)"/> </span><span class="right"> <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> </span> </div> </td> </tr> </tbody> </table> </div> <!-- end header part --> <!-- Generated by Doxygen 1.8.5 --> <script type="text/javascript"> var searchBox = new SearchBox("searchBox", "search",false,'Search'); </script> </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"> $(document).ready(function(){initNavTree('SparseLU__heap__relax__snode_8h_source.html','');}); </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)"> <a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark"> </span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark"> </span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark"> </span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark"> </span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark"> </span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark"> </span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark"> </span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark"> </span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark"> </span>Friends</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(9)"><span class="SelectionMark"> </span>Groups</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(10)"><span class="SelectionMark"> </span>Pages</a></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">SparseLU_heap_relax_snode.h</div> </div> </div><!--header--> <div class="contents"> <div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// This file is part of Eigen, a lightweight C++ template library</span></div> <div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// for linear algebra.</span></div> <div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">//</span></div> <div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// Copyright (C) 2012 Désiré Nuentsa-Wakam <desire.nuentsa_wakam@inria.fr></span></div> <div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div> <div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// This Source Code Form is subject to the terms of the Mozilla</span></div> <div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// Public License v. 2.0. If a copy of the MPL was not distributed</span></div> <div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.</span></div> <div class="line"><a name="l00009"></a><span class="lineno"> 9</span> </div> <div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">/* This file is a modified version of heap_relax_snode.c file in SuperLU</span></div> <div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment"> * -- SuperLU routine (version 3.0) --</span></div> <div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment"> * Univ. of California Berkeley, Xerox Palo Alto Research Center,</span></div> <div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment"> * and Lawrence Berkeley National Lab.</span></div> <div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment"> * October 15, 2003</span></div> <div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment"> *</span></div> <div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment"> * Copyright (c) 1994 by Xerox Corporation. All rights reserved.</span></div> <div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment"> *</span></div> <div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment"> * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY</span></div> <div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment"> * EXPRESSED OR IMPLIED. ANY USE IS AT YOUR OWN RISK.</span></div> <div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment"> *</span></div> <div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment"> * Permission is hereby granted to use or copy this program for any</span></div> <div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment"> * purpose, provided the above notices are retained on all copies.</span></div> <div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment"> * Permission to modify the code and to distribute modified code is</span></div> <div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment"> * granted, provided the above notices are retained, and a notice that</span></div> <div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment"> * the code was modified is included with the above copyright notice.</span></div> <div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> */</span></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="preprocessor">#ifndef SPARSELU_HEAP_RELAX_SNODE_H</span></div> <div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor"></span><span class="preprocessor">#define SPARSELU_HEAP_RELAX_SNODE_H</span></div> <div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor"></span></div> <div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="keyword">namespace </span>Eigen {</div> <div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="keyword">namespace </span>internal {</div> <div class="line"><a name="l00033"></a><span class="lineno"> 33</span> </div> <div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Scalar, <span class="keyword">typename</span> Index></div> <div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="keywordtype">void</span> SparseLUImpl<Scalar,Index>::heap_relax_snode (<span class="keyword">const</span> Index n, IndexVector& et, <span class="keyword">const</span> Index relax_columns, IndexVector& descendants, IndexVector& relax_end)</div> <div class="line"><a name="l00047"></a><span class="lineno"> 47</span> {</div> <div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  </div> <div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="comment">// The etree may not be postordered, but its heap ordered </span></div> <div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  IndexVector post;</div> <div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <a class="code" href="namespaceEigen_1_1internal.html#a6afa7df34de3dce07b21194168118456">internal::treePostorder</a>(n, et, post); <span class="comment">// Post order etree</span></div> <div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  IndexVector inv_post(n+1); </div> <div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  Index i;</div> <div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keywordflow">for</span> (i = 0; i < n+1; ++i) inv_post(post(i)) = i; <span class="comment">// inv_post = post.inverse()???</span></div> <div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  </div> <div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="comment">// Renumber etree in postorder </span></div> <div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  IndexVector iwork(n);</div> <div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  IndexVector et_save(n+1);</div> <div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordflow">for</span> (i = 0; i < n; ++i)</div> <div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  {</div> <div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  iwork(post(i)) = post(et(i));</div> <div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  }</div> <div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  et_save = et; <span class="comment">// Save the original etree</span></div> <div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  et = iwork; </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="comment">// compute the number of descendants of each node in the etree</span></div> <div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  relax_end.setConstant(emptyIdxLU);</div> <div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  Index j, parent; </div> <div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  descendants.setZero();</div> <div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordflow">for</span> (j = 0; j < n; j++) </div> <div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  {</div> <div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  parent = et(j);</div> <div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">if</span> (parent != n) <span class="comment">// not the dummy root</span></div> <div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  descendants(parent) += descendants(j) + 1;</div> <div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  }</div> <div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">// Identify the relaxed supernodes by postorder traversal of the etree</span></div> <div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  Index snode_start; <span class="comment">// beginning of a snode </span></div> <div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  Index k;</div> <div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  Index nsuper_et_post = 0; <span class="comment">// Number of relaxed snodes in postordered etree </span></div> <div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  Index nsuper_et = 0; <span class="comment">// Number of relaxed snodes in the original etree </span></div> <div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  Index l; </div> <div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordflow">for</span> (j = 0; j < n; )</div> <div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  {</div> <div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  parent = et(j);</div> <div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  snode_start = j; </div> <div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordflow">while</span> ( parent != n && descendants(parent) < relax_columns ) </div> <div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  {</div> <div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  j = parent; </div> <div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  parent = et(j);</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="comment">// Found a supernode in postordered etree, j is the last column </span></div> <div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  ++nsuper_et_post;</div> <div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  k = n;</div> <div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordflow">for</span> (i = snode_start; i <= j; ++i)</div> <div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  k = (std::min)(k, inv_post(i));</div> <div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  l = inv_post(j);</div> <div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">if</span> ( (l - k) == (j - snode_start) ) <span class="comment">// Same number of columns in the snode</span></div> <div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  {</div> <div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="comment">// This is also a supernode in the original etree</span></div> <div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  relax_end(k) = l; <span class="comment">// Record last column </span></div> <div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  ++nsuper_et; </div> <div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  }</div> <div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">else</span> </div> <div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  {</div> <div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">for</span> (i = snode_start; i <= j; ++i) </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>  l = inv_post(i);</div> <div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordflow">if</span> (descendants(i) == 0) </div> <div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  {</div> <div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  relax_end(l) = l;</div> <div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  ++nsuper_et;</div> <div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  }</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>  }</div> <div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  j++;</div> <div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="comment">// Search for a new leaf</span></div> <div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keywordflow">while</span> (descendants(j) != 0 && j < n) j++;</div> <div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  } <span class="comment">// End postorder traversal of the etree</span></div> <div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  </div> <div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="comment">// Recover the original etree</span></div> <div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  et = et_save; </div> <div class="line"><a name="l00122"></a><span class="lineno"> 122</span> }</div> <div class="line"><a name="l00123"></a><span class="lineno"> 123</span> </div> <div class="line"><a name="l00124"></a><span class="lineno"> 124</span> } <span class="comment">// end namespace internal</span></div> <div class="line"><a name="l00125"></a><span class="lineno"> 125</span> </div> <div class="line"><a name="l00126"></a><span class="lineno"> 126</span> } <span class="comment">// end namespace Eigen</span></div> <div class="line"><a name="l00127"></a><span class="lineno"> 127</span> <span class="preprocessor">#endif // SPARSELU_HEAP_RELAX_SNODE_H</span></div> <div class="ttc" id="namespaceEigen_1_1internal_html_a6afa7df34de3dce07b21194168118456"><div class="ttname"><a href="namespaceEigen_1_1internal.html#a6afa7df34de3dce07b21194168118456">Eigen::internal::treePostorder</a></div><div class="ttdeci">void treePostorder(Index n, IndexVector &parent, IndexVector &post)</div><div class="ttdoc">Post order a tree. </div><div class="ttdef"><b>Definition:</b> SparseColEtree.h:176</div></div> </div><!-- fragment --></div><!-- contents --> </div><!-- doc-content --> <!-- start footer part --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <ul> <li class="navelem"><a class="el" href="dir_e49d68e3078f12dfcf157021597ad168.html">Eigen</a></li><li class="navelem"><a class="el" href="dir_64b228556dc7f9fe757d43bb57fbfc24.html">src</a></li><li class="navelem"><a class="el" href="dir_43b7fa11304fca39592f14c296504e53.html">SparseLU</a></li><li class="navelem"><b>SparseLU_heap_relax_snode.h</b></li> <li class="footer">Generated on Mon Oct 28 2013 11:04:25 for Eigen by <a href="http://www.doxygen.org/index.html"> <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.5 </li> </ul> </div> <!-- Piwik --> <!-- <script type="text/javascript"> var pkBaseURL = (("https:" == document.location.protocol) ? "https://stats.sylphide-consulting.com/piwik/" : "http://stats.sylphide-consulting.com/piwik/"); document.write(unescape("%3Cscript src='" + pkBaseURL + "piwik.js' type='text/javascript'%3E%3C/script%3E")); </script><script type="text/javascript"> try { var piwikTracker = Piwik.getTracker(pkBaseURL + "piwik.php", 20); piwikTracker.trackPageView(); piwikTracker.enableLinkTracking(); } catch( err ) {} </script><noscript><p><img src="http://stats.sylphide-consulting.com/piwik/piwik.php?idsite=20" style="border:0" alt="" /></p></noscript> --> <!-- End Piwik Tracking Code --> </body> </html>