<!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-unsupported: LMqrsolv.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-unsupported</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('LMqrsolv_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>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark"> </span>Groups</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><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">LMqrsolv.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) 2009 Thomas Capricelli <orzel@freehackers.org></span></div> <div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// Copyright (C) 2012 Desire Nuentsa <desire.nuentsa_wakam@inria.fr></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">// This code initially comes from MINPACK whose original authors are:</span></div> <div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Copyright Jorge More - Argonne National Laboratory</span></div> <div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// Copyright Burt Garbow - Argonne National Laboratory</span></div> <div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// Copyright Ken Hillstrom - Argonne National Laboratory</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">// This Source Code Form is subject to the terms of the Minpack license</span></div> <div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// (a BSD-like license) described in the campaigned CopyrightMINPACK.txt file.</span></div> <div class="line"><a name="l00014"></a><span class="lineno"> 14</span> </div> <div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#ifndef EIGEN_LMQRSOLV_H</span></div> <div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor"></span><span class="preprocessor">#define EIGEN_LMQRSOLV_H</span></div> <div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor"></span></div> <div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="keyword">namespace </span>Eigen { </div> <div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div> <div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="keyword">namespace </span>internal {</div> <div class="line"><a name="l00021"></a><span class="lineno"> 21</span> </div> <div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Scalar,<span class="keywordtype">int</span> Rows, <span class="keywordtype">int</span> Cols, <span class="keyword">typename</span> Index></div> <div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="keywordtype">void</span> lmqrsolv(</div> <div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  Matrix<Scalar,Rows,Cols> &s,</div> <div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  <span class="keyword">const</span> PermutationMatrix<Dynamic,Dynamic,Index> &iPerm,</div> <div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  <span class="keyword">const</span> Matrix<Scalar,Dynamic,1> &diag,</div> <div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  <span class="keyword">const</span> Matrix<Scalar,Dynamic,1> &qtb,</div> <div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  Matrix<Scalar,Dynamic,1> &x,</div> <div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  Matrix<Scalar,Dynamic,1> &sdiag)</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> </div> <div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="comment">/* Local variables */</span></div> <div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  Index i, j, k, l;</div> <div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  Scalar temp;</div> <div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  Index n = s.cols();</div> <div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  Matrix<Scalar,Dynamic,1> wa(n);</div> <div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  JacobiRotation<Scalar> givens;</div> <div class="line"><a name="l00038"></a><span class="lineno"> 38</span> </div> <div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="comment">/* Function Body */</span></div> <div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="comment">// the following will only change the lower triangular part of s, including</span></div> <div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="comment">// the diagonal, though the diagonal is restored afterward</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="comment">/* copy r and (q transpose)*b to preserve input and initialize s. */</span></div> <div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="comment">/* in particular, save the diagonal elements of r in x. */</span></div> <div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  x = s.diagonal();</div> <div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  wa = qtb;</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>  s.topLeftCorner(n,n).template triangularView<StrictlyLower>() = s.topLeftCorner(n,n).transpose();</div> <div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="comment">/* eliminate the diagonal matrix d using a givens rotation. */</span></div> <div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordflow">for</span> (j = 0; j < n; ++j) {</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="comment">/* prepare the row of d to be eliminated, locating the */</span></div> <div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="comment">/* diagonal element using p from the qr factorization. */</span></div> <div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  l = iPerm.indices()(j);</div> <div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordflow">if</span> (diag[l] == 0.)</div> <div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordflow">break</span>;</div> <div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  sdiag.tail(n-j).setZero();</div> <div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  sdiag[j] = diag[l];</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>  <span class="comment">/* the transformations to eliminate the row of d */</span></div> <div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="comment">/* modify only a single element of (q transpose)*b */</span></div> <div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="comment">/* beyond the first n, which is initially zero. */</span></div> <div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  Scalar qtbpj = 0.;</div> <div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordflow">for</span> (k = j; k < n; ++k) {</div> <div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="comment">/* determine a givens rotation which eliminates the */</span></div> <div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="comment">/* appropriate element in the current row of d. */</span></div> <div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  givens.makeGivens(-s(k,k), sdiag[k]);</div> <div class="line"><a name="l00069"></a><span class="lineno"> 69</span> </div> <div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="comment">/* compute the modified diagonal element of r and */</span></div> <div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="comment">/* the modified element of ((q transpose)*b,0). */</span></div> <div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  s(k,k) = givens.c() * s(k,k) + givens.s() * sdiag[k];</div> <div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  temp = givens.c() * wa[k] + givens.s() * qtbpj;</div> <div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  qtbpj = -givens.s() * wa[k] + givens.c() * qtbpj;</div> <div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  wa[k] = temp;</div> <div class="line"><a name="l00076"></a><span class="lineno"> 76</span> </div> <div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="comment">/* accumulate the tranformation in the row of s. */</span></div> <div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">for</span> (i = k+1; i<n; ++i) {</div> <div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  temp = givens.c() * s(i,k) + givens.s() * sdiag[i];</div> <div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  sdiag[i] = -givens.s() * s(i,k) + givens.c() * sdiag[i];</div> <div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  s(i,k) = temp;</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>  }</div> <div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  </div> <div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="comment">/* solve the triangular system for z. if the system is */</span></div> <div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="comment">/* singular, then obtain a least squares solution. */</span></div> <div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  Index nsing;</div> <div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordflow">for</span>(nsing=0; nsing<n && sdiag[nsing]!=0; nsing++) {}</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>  wa.tail(n-nsing).setZero();</div> <div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  s.topLeftCorner(nsing, nsing).transpose().template triangularView<Upper>().solveInPlace(wa.head(nsing));</div> <div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  </div> <div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="comment">// restore</span></div> <div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  sdiag = s.diagonal();</div> <div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  s.diagonal() = x;</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>  <span class="comment">/* permute the components of z back to components of x. */</span></div> <div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  x = iPerm * wa; </div> <div class="line"><a name="l00100"></a><span class="lineno"> 100</span> }</div> <div class="line"><a name="l00101"></a><span class="lineno"> 101</span> </div> <div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Scalar, <span class="keywordtype">int</span> _Options, <span class="keyword">typename</span> Index></div> <div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="keywordtype">void</span> lmqrsolv(</div> <div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  SparseMatrix<Scalar,_Options,Index> &s,</div> <div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keyword">const</span> PermutationMatrix<Dynamic,Dynamic> &iPerm,</div> <div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keyword">const</span> Matrix<Scalar,Dynamic,1> &diag,</div> <div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keyword">const</span> Matrix<Scalar,Dynamic,1> &qtb,</div> <div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  Matrix<Scalar,Dynamic,1> &x,</div> <div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  Matrix<Scalar,Dynamic,1> &sdiag)</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="comment">/* Local variables */</span></div> <div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keyword">typedef</span> SparseMatrix<Scalar,RowMajor,Index> FactorType;</div> <div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  Index i, j, k, l;</div> <div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  Scalar temp;</div> <div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  Index n = s.cols();</div> <div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  Matrix<Scalar,Dynamic,1> wa(n);</div> <div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  JacobiRotation<Scalar> givens;</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="comment">/* Function Body */</span></div> <div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="comment">// the following will only change the lower triangular part of s, including</span></div> <div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="comment">// the diagonal, though the diagonal is restored afterward</span></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>  <span class="comment">/* copy r and (q transpose)*b to preserve input and initialize R. */</span></div> <div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  wa = qtb;</div> <div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  FactorType R(s);</div> <div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="comment">// Eliminate the diagonal matrix d using a givens rotation</span></div> <div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">for</span> (j = 0; j < n; ++j)</div> <div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  {</div> <div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="comment">// Prepare the row of d to be eliminated, locating the </span></div> <div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="comment">// diagonal element using p from the qr factorization</span></div> <div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  l = iPerm.indices()(j);</div> <div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">if</span> (diag(l) == Scalar(0)) </div> <div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordflow">break</span>; </div> <div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  sdiag.tail(n-j).setZero();</div> <div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  sdiag[j] = diag[l];</div> <div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="comment">// the transformations to eliminate the row of d</span></div> <div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="comment">// modify only a single element of (q transpose)*b</span></div> <div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="comment">// beyond the first n, which is initially zero. </span></div> <div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  </div> <div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  Scalar qtbpj = 0; </div> <div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="comment">// Browse the nonzero elements of row j of the upper triangular s</span></div> <div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keywordflow">for</span> (k = j; k < n; ++k)</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>  <span class="keyword">typename</span> FactorType::InnerIterator itk(R,k);</div> <div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">for</span> (; itk; ++itk){</div> <div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">if</span> (itk.index() < k) <span class="keywordflow">continue</span>;</div> <div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordflow">else</span> <span class="keywordflow">break</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="comment">//At this point, we have the diagonal element R(k,k)</span></div> <div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="comment">// Determine a givens rotation which eliminates </span></div> <div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="comment">// the appropriate element in the current row of d</span></div> <div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  givens.makeGivens(-itk.value(), sdiag(k));</div> <div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  </div> <div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="comment">// Compute the modified diagonal element of r and </span></div> <div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="comment">// the modified element of ((q transpose)*b,0).</span></div> <div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  itk.valueRef() = givens.c() * itk.value() + givens.s() * sdiag(k);</div> <div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  temp = givens.c() * wa(k) + givens.s() * qtbpj; </div> <div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  qtbpj = -givens.s() * wa(k) + givens.c() * qtbpj;</div> <div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  wa(k) = temp;</div> <div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  </div> <div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="comment">// Accumulate the transformation in the remaining k row/column of R</span></div> <div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordflow">for</span> (++itk; itk; ++itk)</div> <div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  {</div> <div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  i = itk.index();</div> <div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  temp = givens.c() * itk.value() + givens.s() * sdiag(i);</div> <div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  sdiag(i) = -givens.s() * itk.value() + givens.c() * sdiag(i);</div> <div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  itk.valueRef() = temp;</div> <div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  }</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>  }</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="comment">// Solve the triangular system for z. If the system is </span></div> <div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="comment">// singular, then obtain a least squares solution</span></div> <div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  Index nsing;</div> <div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">for</span>(nsing = 0; nsing<n && sdiag(nsing) !=0; nsing++) {}</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>  wa.tail(n-nsing).setZero();</div> <div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="comment">// x = wa; </span></div> <div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  wa.head(nsing) = R.topLeftCorner(nsing,nsing).template triangularView<Upper>().solve<span class="comment">/*InPlace*/</span>(wa.head(nsing));</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>  sdiag = R.diagonal();</div> <div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="comment">// Permute the components of z back to components of x</span></div> <div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  x = iPerm * wa; </div> <div class="line"><a name="l00184"></a><span class="lineno"> 184</span> }</div> <div class="line"><a name="l00185"></a><span class="lineno"> 185</span> } <span class="comment">// end namespace internal</span></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">// end namespace Eigen</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> <span class="preprocessor">#endif // EIGEN_LMQRSOLV_H</span></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_70b2be79c95c9d5bfaa4c2dafa46bf10.html">unsupported</a></li><li class="navelem"><a class="el" href="dir_f12b092121fb86d54df52b635b2d8129.html">Eigen</a></li><li class="navelem"><a class="el" href="dir_756fd3610c3abb5994ea9c814224d188.html">src</a></li><li class="navelem"><a class="el" href="dir_a17f83cf925c835b431b33d08807ecab.html">LevenbergMarquardt</a></li><li class="navelem"><b>LMqrsolv.h</b></li> <li class="footer">Generated on Mon Oct 28 2013 11:05:27 for Eigen-unsupported 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>