1<!DOCTYPE html> 2<html lang="en"> 3<head> 4<meta charset="UTF-8"> 5<title>sampleFile - OpenGrok cross reference for /sampleFile</title></head><body> 6<script type="text/javascript">/* <![CDATA[ */ 7function get_sym_list(){return [["Subroutine","xsr",[["DGESV",173]]]];} /* ]]> */</script><a class="l" name="1" href="#1">1</a><span class="c">* Copyright (c) 2013 Samuel Halliday</span> 8<a class="l" name="2" href="#2">2</a><span class="c">* Copyright (c) 1992-2011 The University of Tennessee and The University</span> 9<a class="l" name="3" href="#3">3</a><span class="c">* of Tennessee Research Foundation. All rights</span> 10<a class="l" name="4" href="#4">4</a><span class="c">* reserved.</span> 11<a class="l" name="5" href="#5">5</a><span class="c">* Copyright (c) 2000-2011 The University of California Berkeley. All</span> 12<a class="l" name="6" href="#6">6</a><span class="c">* rights reserved.</span> 13<a class="l" name="7" href="#7">7</a><span class="c">* Copyright (c) 2006-2011 The University of Colorado Denver. All rights</span> 14<a class="l" name="8" href="#8">8</a><span class="c">* reserved.</span> 15<a class="l" name="9" href="#9">9</a><span class="c">*</span> 16<a class="hl" name="10" href="#10">10</a><span class="c">* $COPYRIGHT$</span> 17<a class="l" name="11" href="#11">11</a><span class="c">*</span> 18<a class="l" name="12" href="#12">12</a><span class="c">* Additional copyrights may follow</span> 19<a class="l" name="13" href="#13">13</a><span class="c">*</span> 20<a class="l" name="14" href="#14">14</a><span class="c">* $HEADER$</span> 21<a class="l" name="15" href="#15">15</a><span class="c">*</span> 22<a class="l" name="16" href="#16">16</a><span class="c">* Redistribution and use in source and binary forms, with or without</span> 23<a class="l" name="17" href="#17">17</a><span class="c">* modification, are permitted provided that the following conditions are</span> 24<a class="l" name="18" href="#18">18</a><span class="c">* met:</span> 25<a class="l" name="19" href="#19">19</a><span class="c">*</span> 26<a class="hl" name="20" href="#20">20</a><span class="c">* - Redistributions of source code must retain the above copyright</span> 27<a class="l" name="21" href="#21">21</a><span class="c">* notice, this list of conditions and the following disclaimer.</span> 28<a class="l" name="22" href="#22">22</a><span class="c">*</span> 29<a class="l" name="23" href="#23">23</a><span class="c">* - Redistributions in binary form must reproduce the above copyright</span> 30<a class="l" name="24" href="#24">24</a><span class="c">* notice, this list of conditions and the following disclaimer listed</span> 31<a class="l" name="25" href="#25">25</a><span class="c">* in this license in the documentation and/or other materials</span> 32<a class="l" name="26" href="#26">26</a><span class="c">* provided with the distribution.</span> 33<a class="l" name="27" href="#27">27</a><span class="c">*</span> 34<a class="l" name="28" href="#28">28</a><span class="c">* - Neither the name of the copyright holders nor the names of its</span> 35<a class="l" name="29" href="#29">29</a><span class="c">* contributors may be used to endorse or promote products derived from</span> 36<a class="hl" name="30" href="#30">30</a><span class="c">* this software without specific prior written permission.</span> 37<a class="l" name="31" href="#31">31</a><span class="c">*</span> 38<a class="l" name="32" href="#32">32</a><span class="c">* The copyright holders provide no reassurances that the source code</span> 39<a class="l" name="33" href="#33">33</a><span class="c">* provided does not infringe any patent, copyright, or any other</span> 40<a class="l" name="34" href="#34">34</a><span class="c">* intellectual property rights of third parties. The copyright holders</span> 41<a class="l" name="35" href="#35">35</a><span class="c">* disclaim any liability to any recipient for claims brought against</span> 42<a class="l" name="36" href="#36">36</a><span class="c">* recipient by any third party for infringement of that parties</span> 43<a class="l" name="37" href="#37">37</a><span class="c">* intellectual property rights.</span> 44<a class="l" name="38" href="#38">38</a><span class="c">*</span> 45<a class="l" name="39" href="#39">39</a><span class="c">* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS</span> 46<a class="hl" name="40" href="#40">40</a><span class="c">* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT</span> 47<a class="l" name="41" href="#41">41</a><span class="c">* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR</span> 48<a class="l" name="42" href="#42">42</a><span class="c">* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT</span> 49<a class="l" name="43" href="#43">43</a><span class="c">* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,</span> 50<a class="l" name="44" href="#44">44</a><span class="c">* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT</span> 51<a class="l" name="45" href="#45">45</a><span class="c">* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,</span> 52<a class="l" name="46" href="#46">46</a><span class="c">* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY</span> 53<a class="l" name="47" href="#47">47</a><span class="c">* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT</span> 54<a class="l" name="48" href="#48">48</a><span class="c">* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE</span> 55<a class="l" name="49" href="#49">49</a><span class="c">* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span> 56<a class="hl" name="50" href="#50">50</a> 57<a class="l" name="51" href="#51">51</a><span class="c">*> \brief <b> DGESV computes the solution to system of linear equations A * X = B for GE matrices</b></span> 58<a class="l" name="52" href="#52">52</a><span class="c">*</span> 59<a class="l" name="53" href="#53">53</a><span class="c">* =========== DOCUMENTATION ===========</span> 60<a class="l" name="54" href="#54">54</a><span class="c">*</span> 61<a class="l" name="55" href="#55">55</a><span class="c">* Online html documentation available at</span> 62<a class="l" name="56" href="#56">56</a><span class="c">* http://www.netlib.org/lapack/explore-html/</span> 63<a class="l" name="57" href="#57">57</a><span class="c">*</span> 64<a class="l" name="58" href="#58">58</a><span class="c">*> \htmlonly</span> 65<a class="l" name="59" href="#59">59</a><span class="c">*> Download DGESV + dependencies</span> 66<a class="hl" name="60" href="#60">60</a><span class="c">*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dgesv.f"></span> 67<a class="l" name="61" href="#61">61</a><span class="c">*> [TGZ]</a></span> 68<a class="l" name="62" href="#62">62</a><span class="c">*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dgesv.f"></span> 69<a class="l" name="63" href="#63">63</a><span class="c">*> [ZIP]</a></span> 70<a class="l" name="64" href="#64">64</a><span class="c">*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dgesv.f"></span> 71<a class="l" name="65" href="#65">65</a><span class="c">*> [TXT]</a></span> 72<a class="l" name="66" href="#66">66</a><span class="c">*> \endhtmlonly</span> 73<a class="l" name="67" href="#67">67</a><span class="c">*</span> 74<a class="l" name="68" href="#68">68</a><span class="c">* Definition:</span> 75<a class="l" name="69" href="#69">69</a><span class="c">* ===========</span> 76<a class="hl" name="70" href="#70">70</a><span class="c">*</span> 77<a class="l" name="71" href="#71">71</a><span class="c">* SUBROUTINE DGESV( N, NRHS, A, LDA, IPIV, B, LDB, INFO )</span> 78<a class="l" name="72" href="#72">72</a><span class="c">*</span> 79<a class="l" name="73" href="#73">73</a><span class="c">* .. Scalar Arguments ..</span> 80<a class="l" name="74" href="#74">74</a><span class="c">* INTEGER INFO, LDA, LDB, N, NRHS</span> 81<a class="l" name="75" href="#75">75</a><span class="c">* ..</span> 82<a class="l" name="76" href="#76">76</a><span class="c">* .. Array Arguments ..</span> 83<a class="l" name="77" href="#77">77</a><span class="c">* INTEGER IPIV( * )</span> 84<a class="l" name="78" href="#78">78</a><span class="c">* DOUBLE PRECISION A( LDA, * ), B( LDB, * )</span> 85<a class="l" name="79" href="#79">79</a><span class="c">* ..</span> 86<a class="hl" name="80" href="#80">80</a><span class="c">*</span> 87<a class="l" name="81" href="#81">81</a><span class="c">*</span> 88<a class="l" name="82" href="#82">82</a><span class="c">*> \par Purpose:</span> 89<a class="l" name="83" href="#83">83</a><span class="c">* =============</span> 90<a class="l" name="84" href="#84">84</a><span class="c">*></span> 91<a class="l" name="85" href="#85">85</a><span class="c">*> \verbatim</span> 92<a class="l" name="86" href="#86">86</a><span class="c">*></span> 93<a class="l" name="87" href="#87">87</a><span class="c">*> DGESV computes the solution to a real system of linear equations</span> 94<a class="l" name="88" href="#88">88</a><span class="c">*> A * X = B,</span> 95<a class="l" name="89" href="#89">89</a><span class="c">*> where A is an N-by-N matrix and X and B are N-by-NRHS matrices.</span> 96<a class="hl" name="90" href="#90">90</a><span class="c">*></span> 97<a class="l" name="91" href="#91">91</a><span class="c">*> The LU decomposition with partial pivoting and row interchanges is</span> 98<a class="l" name="92" href="#92">92</a><span class="c">*> used to factor A as</span> 99<a class="l" name="93" href="#93">93</a><span class="c">*> A = P * L * U,</span> 100<a class="l" name="94" href="#94">94</a><span class="c">*> where P is a permutation matrix, L is unit lower triangular, and U is</span> 101<a class="l" name="95" href="#95">95</a><span class="c">*> upper triangular. The factored form of A is then used to solve the</span> 102<a class="l" name="96" href="#96">96</a><span class="c">*> system of equations A * X = B.</span> 103<a class="l" name="97" href="#97">97</a><span class="c">*> \endverbatim</span> 104<a class="l" name="98" href="#98">98</a><span class="c">*</span> 105<a class="l" name="99" href="#99">99</a><span class="c">* Arguments:</span> 106<a class="hl" name="100" href="#100">100</a><span class="c">* ==========</span> 107<a class="l" name="101" href="#101">101</a><span class="c">*</span> 108<a class="l" name="102" href="#102">102</a><span class="c">*> \param[in] N</span> 109<a class="l" name="103" href="#103">103</a><span class="c">*> \verbatim</span> 110<a class="l" name="104" href="#104">104</a><span class="c">*> N is INTEGER</span> 111<a class="l" name="105" href="#105">105</a><span class="c">*> The number of linear equations, i.e., the order of the</span> 112<a class="l" name="106" href="#106">106</a><span class="c">*> matrix A. N >= 0.</span> 113<a class="l" name="107" href="#107">107</a><span class="c">*> \endverbatim</span> 114<a class="l" name="108" href="#108">108</a><span class="c">*></span> 115<a class="l" name="109" href="#109">109</a><span class="c">*> \param[in] NRHS</span> 116<a class="hl" name="110" href="#110">110</a><span class="c">*> \verbatim</span> 117<a class="l" name="111" href="#111">111</a><span class="c">*> NRHS is INTEGER</span> 118<a class="l" name="112" href="#112">112</a><span class="c">*> The number of right hand sides, i.e., the number of columns</span> 119<a class="l" name="113" href="#113">113</a><span class="c">*> of the matrix B. NRHS >= 0.</span> 120<a class="l" name="114" href="#114">114</a><span class="c">*> \endverbatim</span> 121<a class="l" name="115" href="#115">115</a><span class="c">*></span> 122<a class="l" name="116" href="#116">116</a><span class="c">*> \param[in,out] A</span> 123<a class="l" name="117" href="#117">117</a><span class="c">*> \verbatim</span> 124<a class="l" name="118" href="#118">118</a><span class="c">*> A is DOUBLE PRECISION array, dimension (LDA,N)</span> 125<a class="l" name="119" href="#119">119</a><span class="c">*> On entry, the N-by-N coefficient matrix A.</span> 126<a class="hl" name="120" href="#120">120</a><span class="c">*> On exit, the factors L and U from the factorization</span> 127<a class="l" name="121" href="#121">121</a><span class="c">*> A = P*L*U; the unit diagonal elements of L are not stored.</span> 128<a class="l" name="122" href="#122">122</a><span class="c">*> \endverbatim</span> 129<a class="l" name="123" href="#123">123</a><span class="c">*></span> 130<a class="l" name="124" href="#124">124</a><span class="c">*> \param[in] LDA</span> 131<a class="l" name="125" href="#125">125</a><span class="c">*> \verbatim</span> 132<a class="l" name="126" href="#126">126</a><span class="c">*> LDA is INTEGER</span> 133<a class="l" name="127" href="#127">127</a><span class="c">*> The leading dimension of the array A. LDA >= max(1,N).</span> 134<a class="l" name="128" href="#128">128</a><span class="c">*> \endverbatim</span> 135<a class="l" name="129" href="#129">129</a><span class="c">*></span> 136<a class="hl" name="130" href="#130">130</a><span class="c">*> \param[out] IPIV</span> 137<a class="l" name="131" href="#131">131</a><span class="c">*> \verbatim</span> 138<a class="l" name="132" href="#132">132</a><span class="c">*> IPIV is INTEGER array, dimension (N)</span> 139<a class="l" name="133" href="#133">133</a><span class="c">*> The pivot indices that define the permutation matrix P;</span> 140<a class="l" name="134" href="#134">134</a><span class="c">*> row i of the matrix was interchanged with row IPIV(i).</span> 141<a class="l" name="135" href="#135">135</a><span class="c">*> \endverbatim</span> 142<a class="l" name="136" href="#136">136</a><span class="c">*></span> 143<a class="l" name="137" href="#137">137</a><span class="c">*> \param[in,out] B</span> 144<a class="l" name="138" href="#138">138</a><span class="c">*> \verbatim</span> 145<a class="l" name="139" href="#139">139</a><span class="c">*> B is DOUBLE PRECISION array, dimension (LDB,NRHS)</span> 146<a class="hl" name="140" href="#140">140</a><span class="c">*> On entry, the N-by-NRHS matrix of right hand side matrix B.</span> 147<a class="l" name="141" href="#141">141</a><span class="c">*> On exit, if INFO = 0, the N-by-NRHS solution matrix X.</span> 148<a class="l" name="142" href="#142">142</a><span class="c">*> \endverbatim</span> 149<a class="l" name="143" href="#143">143</a><span class="c">*></span> 150<a class="l" name="144" href="#144">144</a><span class="c">*> \param[in] LDB</span> 151<a class="l" name="145" href="#145">145</a><span class="c">*> \verbatim</span> 152<a class="l" name="146" href="#146">146</a><span class="c">*> LDB is INTEGER</span> 153<a class="l" name="147" href="#147">147</a><span class="c">*> The leading dimension of the array B. LDB >= max(1,N).</span> 154<a class="l" name="148" href="#148">148</a><span class="c">*> \endverbatim</span> 155<a class="l" name="149" href="#149">149</a><span class="c">*></span> 156<a class="hl" name="150" href="#150">150</a><span class="c">*> \param[out] INFO</span> 157<a class="l" name="151" href="#151">151</a><span class="c">*> \verbatim</span> 158<a class="l" name="152" href="#152">152</a><span class="c">*> INFO is INTEGER</span> 159<a class="l" name="153" href="#153">153</a><span class="c">*> = 0: successful exit</span> 160<a class="l" name="154" href="#154">154</a><span class="c">*> < 0: if INFO = -i, the i-th argument had an illegal value</span> 161<a class="l" name="155" href="#155">155</a><span class="c">*> > 0: if INFO = i, U(i,i) is exactly zero. The factorization</span> 162<a class="l" name="156" href="#156">156</a><span class="c">*> has been completed, but the factor U is exactly</span> 163<a class="l" name="157" href="#157">157</a><span class="c">*> singular, so the solution could not be computed.</span> 164<a class="l" name="158" href="#158">158</a><span class="c">*> \endverbatim</span> 165<a class="l" name="159" href="#159">159</a><span class="c">*</span> 166<a class="hl" name="160" href="#160">160</a><span class="c">* Authors:</span> 167<a class="l" name="161" href="#161">161</a><span class="c">* ========</span> 168<a class="l" name="162" href="#162">162</a><span class="c">*</span> 169<a class="l" name="163" href="#163">163</a><span class="c">*> \author Univ. of Tennessee</span> 170<a class="l" name="164" href="#164">164</a><span class="c">*> \author Univ. of California Berkeley</span> 171<a class="l" name="165" href="#165">165</a><span class="c">*> \author Univ. of Colorado Denver</span> 172<a class="l" name="166" href="#166">166</a><span class="c">*> \author NAG Ltd.</span> 173<a class="l" name="167" href="#167">167</a><span class="c">*</span> 174<a class="l" name="168" href="#168">168</a><span class="c">*> \date November 2011</span> 175<a class="l" name="169" href="#169">169</a><span class="c">*</span> 176<a class="hl" name="170" href="#170">170</a><span class="c">*> \ingroup doubleGEsolve</span> 177<a class="l" name="171" href="#171">171</a><span class="c">*</span> 178<a class="l" name="172" href="#172">172</a><span class="c">* =====================================================================</span> 179<a class="l" name="173" href="#173">173</a> <b>SUBROUTINE</b> <a class="xsr" name="DGESV"/><a href="/source/s?refs=DGESV" class="xsr intelliWindow-symbol" data-definition-place="def">DGESV</a>( <a class="xa" name="N"/><a href="/source/s?refs=N" class="xa intelliWindow-symbol" data-definition-place="def">N</a>, <a class="xa" name="NRHS"/><a href="/source/s?refs=NRHS" class="xa intelliWindow-symbol" data-definition-place="def">NRHS</a>, <a class="xa" name="A"/><a href="/source/s?refs=A" class="xa intelliWindow-symbol" data-definition-place="def">A</a>, <a class="xa" name="LDA"/><a href="/source/s?refs=LDA" class="xa intelliWindow-symbol" data-definition-place="def">LDA</a>, <a class="xa" name="IPIV"/><a href="/source/s?refs=IPIV" class="xa intelliWindow-symbol" data-definition-place="def">IPIV</a>, <a class="xa" name="B"/><a href="/source/s?refs=B" class="xa intelliWindow-symbol" data-definition-place="def">B</a>, <a class="xa" name="LDB"/><a href="/source/s?refs=LDB" class="xa intelliWindow-symbol" data-definition-place="def">LDB</a>, <a class="xa" name="INFO"/><a href="/source/s?refs=INFO" class="xa intelliWindow-symbol" data-definition-place="def">INFO</a> ) 180<a class="l" name="174" href="#174">174</a><span class="c">*</span> 181<a class="l" name="175" href="#175">175</a><span class="c">* -- LAPACK driver routine (version 3.4.0) --</span> 182<a class="l" name="176" href="#176">176</a><span class="c">* -- LAPACK is a software package provided by Univ. of Tennessee, --</span> 183<a class="l" name="177" href="#177">177</a><span class="c">* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--</span> 184<a class="l" name="178" href="#178">178</a><span class="c">* November 2011</span> 185<a class="l" name="179" href="#179">179</a><span class="c">*</span> 186<a class="hl" name="180" href="#180">180</a><span class="c">* .. Scalar Arguments ..</span> 187<a class="l" name="181" href="#181">181</a> <b>INTEGER</b> <a class="xl" name="INFO"/><a href="/source/s?refs=INFO" class="xl intelliWindow-symbol" data-definition-place="def">INFO</a>, <a class="xl" name="LDA"/><a href="/source/s?refs=LDA" class="xl intelliWindow-symbol" data-definition-place="def">LDA</a>, <a class="xl" name="LDB"/><a href="/source/s?refs=LDB" class="xl intelliWindow-symbol" data-definition-place="def">LDB</a>, <a class="xl" name="N"/><a href="/source/s?refs=N" class="xl intelliWindow-symbol" data-definition-place="def">N</a>, <a class="xl" name="NRHS"/><a href="/source/s?refs=NRHS" class="xl intelliWindow-symbol" data-definition-place="def">NRHS</a> 188<a class="l" name="182" href="#182">182</a><span class="c">* ..</span> 189<a class="l" name="183" href="#183">183</a><span class="c">* .. Array Arguments ..</span> 190<a class="l" name="184" href="#184">184</a> <b>INTEGER</b> <a class="xl" name="IPIV"/><a href="/source/s?refs=IPIV" class="xl intelliWindow-symbol" data-definition-place="def">IPIV</a>( * ) 191<a class="l" name="185" href="#185">185</a> <b>DOUBLE</b> <b>PRECISION</b> <a class="xl" name="A"/><a href="/source/s?refs=A" class="xl intelliWindow-symbol" data-definition-place="def">A</a>( <a href="/source/s?defs=LDA" class="intelliWindow-symbol" data-definition-place="undefined-in-file">LDA</a>, * ), <a class="xl" name="B"/><a href="/source/s?refs=B" class="xl intelliWindow-symbol" data-definition-place="def">B</a>( <a href="/source/s?defs=LDB" class="intelliWindow-symbol" data-definition-place="undefined-in-file">LDB</a>, * ) 192<a class="l" name="186" href="#186">186</a><span class="c">* ..</span> 193<a class="l" name="187" href="#187">187</a><span class="c">*</span> 194<a class="l" name="188" href="#188">188</a><span class="c">* =====================================================================</span> 195<a class="l" name="189" href="#189">189</a><span class="c">*</span> 196<a class="hl" name="190" href="#190">190</a><span class="c">* .. External Subroutines ..</span> 197<a class="l" name="191" href="#191">191</a> <b>EXTERNAL</b> <a href="/source/s?defs=DGETRF" class="intelliWindow-symbol" data-definition-place="undefined-in-file">DGETRF</a>, <a href="/source/s?defs=DGETRS" class="intelliWindow-symbol" data-definition-place="undefined-in-file">DGETRS</a>, <a href="/source/s?defs=XERBLA" class="intelliWindow-symbol" data-definition-place="undefined-in-file">XERBLA</a> 198<a class="l" name="192" href="#192">192</a><span class="c">* ..</span> 199<a class="l" name="193" href="#193">193</a><span class="c">* .. Intrinsic Functions ..</span> 200<a class="l" name="194" href="#194">194</a> <a href="/source/s?defs=INTRINSIC" class="intelliWindow-symbol" data-definition-place="undefined-in-file">INTRINSIC</a> <b>MAX</b> 201<a class="l" name="195" href="#195">195</a><span class="c">* ..</span> 202<a class="l" name="196" href="#196">196</a><span class="c">* .. Executable Statements ..</span> 203<a class="l" name="197" href="#197">197</a><span class="c">*</span> 204<a class="l" name="198" href="#198">198</a><span class="c">* Test the input parameters.</span> 205<a class="l" name="199" href="#199">199</a><span class="c">*</span> 206<a class="hl" name="200" href="#200">200</a> <a href="/source/s?defs=INFO" class="intelliWindow-symbol" data-definition-place="undefined-in-file">INFO</a> = <span class="n">0</span> + <span class="n">0xFFFF</span> - <span class="n">0XFF</span> - <span class="n">0xFF00</span> 207<a class="l" name="201" href="#201">201</a> <b>IF</b>( <a href="/source/s?defs=N" class="intelliWindow-symbol" data-definition-place="undefined-in-file">N</a>.<b>LT</b>.<span class="n">0</span> ) <b>THEN</b> 208<a class="l" name="202" href="#202">202</a> <a href="/source/s?defs=INFO" class="intelliWindow-symbol" data-definition-place="undefined-in-file">INFO</a> = -<span class="n">1</span> 209<a class="l" name="203" href="#203">203</a> <b>ELSE</b> <b>IF</b>( <a href="/source/s?defs=NRHS" class="intelliWindow-symbol" data-definition-place="undefined-in-file">NRHS</a>.<b>LT</b>.<span class="n">0</span> ) <b>THEN</b> 210<a class="l" name="204" href="#204">204</a> <a href="/source/s?defs=INFO" class="intelliWindow-symbol" data-definition-place="undefined-in-file">INFO</a> = -<span class="n">2</span> 211<a class="l" name="205" href="#205">205</a> <b>ELSE</b> <b>IF</b>( <a href="/source/s?defs=LDA" class="intelliWindow-symbol" data-definition-place="undefined-in-file">LDA</a>.<b>LT</b>.<b>MAX</b>( <span class="n">1</span>, <a href="/source/s?defs=N" class="intelliWindow-symbol" data-definition-place="undefined-in-file">N</a> ) ) <b>THEN</b> 212<a class="l" name="206" href="#206">206</a> <a href="/source/s?defs=INFO" class="intelliWindow-symbol" data-definition-place="undefined-in-file">INFO</a> = -<span class="n">4</span> 213<a class="l" name="207" href="#207">207</a> <b>ELSE</b> <b>IF</b>( <a href="/source/s?defs=LDB" class="intelliWindow-symbol" data-definition-place="undefined-in-file">LDB</a>.<b>LT</b>.<b>MAX</b>( <span class="n">1</span>, <a href="/source/s?defs=N" class="intelliWindow-symbol" data-definition-place="undefined-in-file">N</a> ) ) <b>THEN</b> 214<a class="l" name="208" href="#208">208</a> <a href="/source/s?defs=INFO" class="intelliWindow-symbol" data-definition-place="undefined-in-file">INFO</a> = -<span class="n">7</span> 215<a class="l" name="209" href="#209">209</a> <b>END</b> <b>IF</b> 216<a class="hl" name="210" href="#210">210</a> <b>IF</b>( <a href="/source/s?defs=INFO" class="intelliWindow-symbol" data-definition-place="undefined-in-file">INFO</a>.<b>NE</b>.<span class="n">0</span> ) <b>THEN</b> 217<a class="l" name="211" href="#211">211</a> <b>CALL</b> <a href="/source/s?defs=XERBLA" class="intelliWindow-symbol" data-definition-place="undefined-in-file">XERBLA</a>( <span class="s">'DGESV '</span>, -<a href="/source/s?defs=INFO" class="intelliWindow-symbol" data-definition-place="undefined-in-file">INFO</a> ) 218<a class="l" name="212" href="#212">212</a> <b>RETURN</b> 219<a class="l" name="213" href="#213">213</a> <b>END</b> <b>IF</b> 220<a class="l" name="214" href="#214">214</a><span class="c">*</span> 221<a class="l" name="215" href="#215">215</a><span class="c">* Compute the LU factorization of A.</span> 222<a class="l" name="216" href="#216">216</a><span class="c">*</span> 223<a class="l" name="217" href="#217">217</a> <b>CALL</b> <a href="/source/s?defs=DGETRF" class="intelliWindow-symbol" data-definition-place="undefined-in-file">DGETRF</a>( <a href="/source/s?defs=N" class="intelliWindow-symbol" data-definition-place="undefined-in-file">N</a>, <a href="/source/s?defs=N" class="intelliWindow-symbol" data-definition-place="undefined-in-file">N</a>, <a href="/source/s?defs=A" class="intelliWindow-symbol" data-definition-place="undefined-in-file">A</a>, <a href="/source/s?defs=LDA" class="intelliWindow-symbol" data-definition-place="undefined-in-file">LDA</a>, <a href="/source/s?defs=IPIV" class="intelliWindow-symbol" data-definition-place="undefined-in-file">IPIV</a>, <a href="/source/s?defs=INFO" class="intelliWindow-symbol" data-definition-place="undefined-in-file">INFO</a> ) 224<a class="l" name="218" href="#218">218</a> <b>IF</b>( <a href="/source/s?defs=INFO" class="intelliWindow-symbol" data-definition-place="undefined-in-file">INFO</a>.<b>EQ</b>.<span class="n">0</span> ) <b>THEN</b> 225<a class="l" name="219" href="#219">219</a><span class="c">*</span> 226<a class="hl" name="220" href="#220">220</a><span class="c">* Solve the system A*X = B, overwriting B with X.</span> 227<a class="l" name="221" href="#221">221</a><span class="c">*</span> 228<a class="l" name="222" href="#222">222</a> <b>CALL</b> <a href="/source/s?defs=DGETRS" class="intelliWindow-symbol" data-definition-place="undefined-in-file">DGETRS</a>( <span class="s">'No transpose'</span>, <a href="/source/s?defs=N" class="intelliWindow-symbol" data-definition-place="undefined-in-file">N</a>, <a href="/source/s?defs=NRHS" class="intelliWindow-symbol" data-definition-place="undefined-in-file">NRHS</a>, <a href="/source/s?defs=A" class="intelliWindow-symbol" data-definition-place="undefined-in-file">A</a>, <a href="/source/s?defs=LDA" class="intelliWindow-symbol" data-definition-place="undefined-in-file">LDA</a>, <a href="/source/s?defs=IPIV" class="intelliWindow-symbol" data-definition-place="undefined-in-file">IPIV</a>, <a href="/source/s?defs=B" class="intelliWindow-symbol" data-definition-place="undefined-in-file">B</a>, <a href="/source/s?defs=LDB" class="intelliWindow-symbol" data-definition-place="undefined-in-file">LDB</a>, 229<a class="l" name="223" href="#223">223</a> $ <a href="/source/s?defs=INFO" class="intelliWindow-symbol" data-definition-place="undefined-in-file">INFO</a> ) 230<a class="l" name="224" href="#224">224</a> <b>END</b> <b>IF</b> 231<a class="l" name="225" href="#225">225</a> <b>RETURN</b> 232<a class="l" name="226" href="#226">226</a><span class="c">*</span> 233<a class="l" name="227" href="#227">227</a><span class="c">* End of DGESV</span> 234<a class="l" name="228" href="#228">228</a><span class="c">*</span> 235<a class="l" name="229" href="#229">229</a> <b>END</b> 236<a class="hl" name="230" href="#230">230</a> <b>CALL</b> <span class="s">'<a href="http://example.com">http://example.com</a>'</span> 237<a class="l" name="231" href="#231">231</a></body> 238</html> 239