<!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: SimplicialCholesky_impl.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('SimplicialCholesky__impl_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">SimplicialCholesky_impl.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) 2008-2012 Gael Guennebaud <gael.guennebaud@inria.fr></span></div> <div class="line"><a name="l00005"></a><span class="lineno"> 5</span> </div> <div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">/*</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> <span class="comment">NOTE: thes functions vave been adapted from the LDL library:</span></div> <div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment"></span></div> <div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">LDL Copyright (c) 2005 by Timothy A. Davis. All Rights Reserved.</span></div> <div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment"></span></div> <div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">LDL License:</span></div> <div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment"></span></div> <div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment"> Your use or distribution of LDL or any modified version of</span></div> <div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment"> LDL implies that you agree to this License.</span></div> <div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment"></span></div> <div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment"> This library is free software; you can redistribute it and/or</span></div> <div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment"> modify it under the terms of the GNU Lesser General Public</span></div> <div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment"> License as published by the Free Software Foundation; either</span></div> <div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment"> version 2.1 of the License, or (at your option) any later version.</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"> 22</span> <span class="comment"> This library is distributed in the hope that it will be useful,</span></div> <div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment"> but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div> <div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment"> MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU</span></div> <div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment"> Lesser General Public License for more details.</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> <span class="comment"> You should have received a copy of the GNU Lesser General Public</span></div> <div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> License along with this library; if not, write to the Free Software</span></div> <div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301</span></div> <div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"> USA</span></div> <div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment"></span></div> <div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment"> Permission is hereby granted to use or copy this program under the</span></div> <div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment"> terms of the GNU LGPL, provided that the Copyright, this License,</span></div> <div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment"> and the Availability of the original version is retained on all copies.</span></div> <div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"> User documentation of any code that uses this code or any modified</span></div> <div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"> version of this code must cite the Copyright, this License, the</span></div> <div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> Availability note, and "Used by permission." Permission to modify</span></div> <div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> the code and to distribute modified code is granted, provided the</span></div> <div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> Copyright, this License, and the Availability note are retained,</span></div> <div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment"> and a notice that the code was modified is included.</span></div> <div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"> */</span></div> <div class="line"><a name="l00042"></a><span class="lineno"> 42</span> </div> <div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="preprocessor">#include "../Core/util/NonMPL2.h"</span></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="preprocessor">#ifndef EIGEN_SIMPLICIAL_CHOLESKY_IMPL_H</span></div> <div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="preprocessor"></span><span class="preprocessor">#define EIGEN_SIMPLICIAL_CHOLESKY_IMPL_H</span></div> <div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="preprocessor"></span></div> <div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="keyword">namespace </span>Eigen {</div> <div class="line"><a name="l00049"></a><span class="lineno"> 49</span> </div> <div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="keyword">template</span><<span class="keyword">typename</span> Derived></div> <div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="keywordtype">void</span> SimplicialCholeskyBase<Derived>::analyzePattern_preordered(<span class="keyword">const</span> CholMatrixType& ap, <span class="keywordtype">bool</span> doLDLT)</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="keyword">const</span> Index size = ap.rows();</div> <div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  m_matrix.resize(size, size);</div> <div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  m_parent.resize(size);</div> <div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  m_nonZerosPerCol.resize(size);</div> <div class="line"><a name="l00057"></a><span class="lineno"> 57</span> </div> <div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  ei_declare_aligned_stack_constructed_variable(Index, tags, size, 0);</div> <div class="line"><a name="l00059"></a><span class="lineno"> 59</span> </div> <div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordflow">for</span>(Index k = 0; k < size; ++k)</div> <div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  {</div> <div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="comment">/* L(k,:) pattern: all nodes reachable in etree from nz in A(0:k-1,k) */</span></div> <div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  m_parent[k] = -1; <span class="comment">/* parent of k is not yet known */</span></div> <div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  tags[k] = k; <span class="comment">/* mark node k as visited */</span></div> <div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  m_nonZerosPerCol[k] = 0; <span class="comment">/* count of nonzeros in column k of L */</span></div> <div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">for</span>(<span class="keyword">typename</span> CholMatrixType::InnerIterator it(ap,k); it; ++it)</div> <div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  {</div> <div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  Index i = it.index();</div> <div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">if</span>(i < k)</div> <div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  {</div> <div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="comment">/* follow path from i to root of etree, stop at flagged node */</span></div> <div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordflow">for</span>(; tags[i] != k; i = m_parent[i])</div> <div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  {</div> <div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="comment">/* find parent of i if not yet determined */</span></div> <div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordflow">if</span> (m_parent[i] == -1)</div> <div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  m_parent[i] = k;</div> <div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  m_nonZerosPerCol[i]++; <span class="comment">/* L (k,i) is nonzero */</span></div> <div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  tags[i] = k; <span class="comment">/* mark i as visited */</span></div> <div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  }</div> <div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  }</div> <div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  }</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> </div> <div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="comment">/* construct Lp index array from m_nonZerosPerCol column counts */</span></div> <div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  Index* Lp = m_matrix.outerIndexPtr();</div> <div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  Lp[0] = 0;</div> <div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">for</span>(Index k = 0; k < size; ++k)</div> <div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  Lp[k+1] = Lp[k] + m_nonZerosPerCol[k] + (doLDLT ? 0 : 1);</div> <div class="line"><a name="l00089"></a><span class="lineno"> 89</span> </div> <div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  m_matrix.resizeNonZeros(Lp[size]);</div> <div class="line"><a name="l00091"></a><span class="lineno"> 91</span> </div> <div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  m_isInitialized = <span class="keyword">true</span>;</div> <div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  m_info = <a class="code" href="group__enums.html#gga51bc1ac16f26ebe51eae1abb77bd037bafdfbdf3247bd36a1f17270d5cec74c9c">Success</a>;</div> <div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  m_analysisIsOk = <span class="keyword">true</span>;</div> <div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  m_factorizationIsOk = <span class="keyword">false</span>;</div> <div class="line"><a name="l00096"></a><span class="lineno"> 96</span> }</div> <div class="line"><a name="l00097"></a><span class="lineno"> 97</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="keyword">template</span><<span class="keyword">typename</span> Derived></div> <div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="keyword">template</span><<span class="keywordtype">bool</span> DoLDLT></div> <div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="keywordtype">void</span> SimplicialCholeskyBase<Derived>::factorize_preordered(<span class="keyword">const</span> CholMatrixType& ap)</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="keyword">using</span> std::sqrt;</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>  eigen_assert(m_analysisIsOk && <span class="stringliteral">"You must first call analyzePattern()"</span>);</div> <div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  eigen_assert(ap.rows()==ap.cols());</div> <div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keyword">const</span> Index size = ap.rows();</div> <div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  eigen_assert(m_parent.size()==size);</div> <div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  eigen_assert(m_nonZerosPerCol.size()==size);</div> <div class="line"><a name="l00110"></a><span class="lineno"> 110</span> </div> <div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keyword">const</span> Index* Lp = m_matrix.outerIndexPtr();</div> <div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  Index* Li = m_matrix.innerIndexPtr();</div> <div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  Scalar* Lx = m_matrix.valuePtr();</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>  ei_declare_aligned_stack_constructed_variable(Scalar, y, size, 0);</div> <div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  ei_declare_aligned_stack_constructed_variable(Index, pattern, size, 0);</div> <div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  ei_declare_aligned_stack_constructed_variable(Index, tags, size, 0);</div> <div class="line"><a name="l00118"></a><span class="lineno"> 118</span> </div> <div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordtype">bool</span> ok = <span class="keyword">true</span>;</div> <div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  m_diag.resize(DoLDLT ? size : 0);</div> <div class="line"><a name="l00121"></a><span class="lineno"> 121</span> </div> <div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordflow">for</span>(Index k = 0; k < size; ++k)</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">// compute nonzero pattern of kth row of L, in topological order</span></div> <div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  y[k] = 0.0; <span class="comment">// Y(0:k) is now all zero</span></div> <div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  Index top = size; <span class="comment">// stack for pattern is empty</span></div> <div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  tags[k] = k; <span class="comment">// mark node k as visited</span></div> <div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  m_nonZerosPerCol[k] = 0; <span class="comment">// count of nonzeros in column k of L</span></div> <div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keywordflow">for</span>(<span class="keyword">typename</span> MatrixType::InnerIterator it(ap,k); it; ++it)</div> <div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  {</div> <div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  Index i = it.index();</div> <div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">if</span>(i <= k)</div> <div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  {</div> <div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  y[i] += numext::conj(it.value()); <span class="comment">/* scatter A(i,k) into Y (sum duplicates) */</span></div> <div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  Index len;</div> <div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordflow">for</span>(len = 0; tags[i] != k; i = m_parent[i])</div> <div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  {</div> <div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  pattern[len++] = i; <span class="comment">/* L(k,i) is nonzero */</span></div> <div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  tags[i] = k; <span class="comment">/* mark i as visited */</span></div> <div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  }</div> <div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">while</span>(len > 0)</div> <div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  pattern[--top] = pattern[--len];</div> <div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  }</div> <div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  }</div> <div class="line"><a name="l00145"></a><span class="lineno"> 145</span> </div> <div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="comment">/* compute numerical values kth row of L (a sparse triangular solve) */</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>  RealScalar d = numext::real(y[k]) * m_shiftScale + m_shiftOffset; <span class="comment">// get D(k,k), apply the shift function, and clear Y(k)</span></div> <div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  y[k] = 0.0;</div> <div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordflow">for</span>(; top < size; ++top)</div> <div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  {</div> <div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  Index i = pattern[top]; <span class="comment">/* pattern[top:n-1] is pattern of L(:,k) */</span></div> <div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  Scalar yi = y[i]; <span class="comment">/* get and clear Y(i) */</span></div> <div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  y[i] = 0.0;</div> <div class="line"><a name="l00155"></a><span class="lineno"> 155</span> </div> <div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="comment">/* the nonzero entry L(k,i) */</span></div> <div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  Scalar l_ki;</div> <div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keywordflow">if</span>(DoLDLT)</div> <div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  l_ki = yi / m_diag[i];</div> <div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordflow">else</span></div> <div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  yi = l_ki = yi / Lx[Lp[i]];</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>  Index p2 = Lp[i] + m_nonZerosPerCol[i];</div> <div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  Index p;</div> <div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keywordflow">for</span>(p = Lp[i] + (DoLDLT ? 0 : 1); p < p2; ++p)</div> <div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  y[Li[p]] -= numext::conj(Lx[p]) * yi;</div> <div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  d -= numext::real(l_ki * numext::conj(yi));</div> <div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  Li[p] = k; <span class="comment">/* store L(k,i) in column form of L */</span></div> <div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  Lx[p] = l_ki;</div> <div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  ++m_nonZerosPerCol[i]; <span class="comment">/* increment count of nonzeros in col i */</span></div> <div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  }</div> <div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keywordflow">if</span>(DoLDLT)</div> <div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  {</div> <div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  m_diag[k] = d;</div> <div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">if</span>(d == RealScalar(0))</div> <div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  {</div> <div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  ok = <span class="keyword">false</span>; <span class="comment">/* failure, D(k,k) is zero */</span></div> <div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordflow">break</span>;</div> <div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  }</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="keywordflow">else</span></div> <div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  {</div> <div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  Index p = Lp[k] + m_nonZerosPerCol[k]++;</div> <div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  Li[p] = k ; <span class="comment">/* store L(k,k) = sqrt (d) in column k */</span></div> <div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">if</span>(d <= RealScalar(0)) {</div> <div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  ok = <span class="keyword">false</span>; <span class="comment">/* failure, matrix is not positive definite */</span></div> <div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">break</span>;</div> <div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  }</div> <div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  Lx[p] = sqrt(d) ;</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>  }</div> <div class="line"><a name="l00192"></a><span class="lineno"> 192</span> </div> <div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  m_info = ok ? <a class="code" href="group__enums.html#gga51bc1ac16f26ebe51eae1abb77bd037bafdfbdf3247bd36a1f17270d5cec74c9c">Success</a> : <a class="code" href="group__enums.html#gga51bc1ac16f26ebe51eae1abb77bd037ba710fff14e8fc77846d4b75d8f4cc2d5c">NumericalIssue</a>;</div> <div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  m_factorizationIsOk = <span class="keyword">true</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> </div> <div class="line"><a name="l00197"></a><span class="lineno"> 197</span> } <span class="comment">// end namespace Eigen</span></div> <div class="line"><a name="l00198"></a><span class="lineno"> 198</span> </div> <div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="preprocessor">#endif // EIGEN_SIMPLICIAL_CHOLESKY_IMPL_H</span></div> <div class="ttc" id="group__enums_html_gga51bc1ac16f26ebe51eae1abb77bd037ba710fff14e8fc77846d4b75d8f4cc2d5c"><div class="ttname"><a href="group__enums.html#gga51bc1ac16f26ebe51eae1abb77bd037ba710fff14e8fc77846d4b75d8f4cc2d5c">Eigen::NumericalIssue</a></div><div class="ttdef"><b>Definition:</b> Constants.h:378</div></div> <div class="ttc" id="group__enums_html_gga51bc1ac16f26ebe51eae1abb77bd037bafdfbdf3247bd36a1f17270d5cec74c9c"><div class="ttname"><a href="group__enums.html#gga51bc1ac16f26ebe51eae1abb77bd037bafdfbdf3247bd36a1f17270d5cec74c9c">Eigen::Success</a></div><div class="ttdef"><b>Definition:</b> Constants.h:376</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_974c3d77aa7b94af2fd56062c5e63c0d.html">SparseCholesky</a></li><li class="navelem"><b>SimplicialCholesky_impl.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>