<?xml-stylesheet type="text/xsl" href="../styles/pmathml.xsl"?>
<!-- saved from url=(0014)about:internet -->
<html xmlns="http://www.w3.org/1999/xhtml" xmlns:dsi="http://www.w3.org/1999/xlink" xmlns:m="http://www.w3.org/1998/Math/MathML" xml:space="preserve"><head><meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"/><title>F07AGF (DGECON) : NAG Library, Mark 22</title><link rel="stylesheet" href="../styles/libdoc.css" type="text/css"/><script type="text/javascript">
   function showLevel(_levelId){
    var thisLevel = document.getElementById(_levelId);
    var thisplus = document.getElementById( _levelId.concat('plus'));
    var thisminus = document.getElementById( _levelId.concat('minus'));
    if(thisLevel.style.display != "block"){
     thisLevel.style.display = "block";
     thisplus.style.display = "none";
     thisminus.style.display = "inline";
     }
    else{
     thisLevel.style.display = "none";
     thisminus.style.display = "none";
     thisplus.style.display = "inline";
     }
    }
  </script></head><body><hr/><div><a class="rout" href="../../pdf/F07/f07agf.pdf">F07AGF (DGECON) (PDF version)</a></div><div><a class="chap" href="f07conts.xml">F07 Chapter Contents</a></div><div><a class="chapint" href="f07intro.xml">F07 Chapter Introduction</a></div>
<div><a class="htmltoc" href="../FRONTMATTER/manconts.xml">NAG Library Manual</a></div><hr/><h1 class="libdoc">NAG Library Routine Document<br/><br/>F07AGF (DGECON)</h1><div class="paramtext"><div class="header"><b>Note:</b>&#160; before using this routine, please read the Users' Note for your implementation to check the interpretation of <span class="bitalic">bold italicised</span> terms and other implementation-dependent details.</div></div> 
<div class="htmltoc">
<h2 class="htmltoc"><span class="htmltochead" onclick="showLevel('htmltoc');"><span class="htmltocplus" id="htmltocplus">+</span><span class="htmltocminus" id="htmltocminus">&#8722;</span></span>&#160;Contents</h2>
<div class="htmltocitem" id="htmltoc">
<div class="htmltoc">
<span class="htmltocplus">&#160;&#160;&#160;</span>
<a class="htmltoc" href="#purpose">1&#160;&#160;<b>Purpose</b></a>
</div><div class="htmltoc">
<span class="htmltocplus">&#160;&#160;&#160;</span>
<a class="htmltoc" href="#specification">2&#160;&#160;<b>Specification</b></a>
</div><div class="htmltoc">
<span class="htmltocplus">&#160;&#160;&#160;</span>
<a class="htmltoc" href="#description">3&#160;&#160;<b>Description</b></a>
</div><div class="htmltoc">
<span class="htmltocplus">&#160;&#160;&#160;</span>
<a class="htmltoc" href="#references">4&#160;&#160;<b>References</b></a>
</div><div class="htmltoc">
<span class="htmltocplus">&#160;&#160;&#160;</span>
<a class="htmltoc" href="#parameters">5&#160;&#160;<b>Parameters</b></a>
</div><div class="htmltoc">
<span class="htmltocplus">&#160;&#160;&#160;</span>
<a class="htmltoc" href="#errors">6&#160;&#160;<b>Error Indicators and Warnings</b></a>
</div><div class="htmltoc">
<span class="htmltocplus">&#160;&#160;&#160;</span>
<a class="htmltoc" href="#accuracy">7&#160;&#160;<b>Accuracy</b></a>
</div><div class="htmltoc">
<span class="htmltocplus">&#160;&#160;&#160;</span>
<a class="htmltoc" href="#fcomments">8&#160;&#160;<b>Further Comments</b></a>
</div><div class="htmltoc">
<span class="htmltoc" onclick="showLevel('tocexample');"><span class="htmltocplus" id="tocexampleplus">+</span><span class="htmltocminus" id="tocexampleminus">&#8722;</span></span>
<a class="htmltoc" href="#example">9&#160;&#160;<b>Example</b></a>
<div class="htmltocitem" id="tocexample">
<div class="htmltoc">
<span class="htmltocplus">&#160;&#160;&#160;</span>
<a class="htmltoc" href="#examtext">9.1&#160;&#160;<b>Program Text</b></a>
</div><div class="htmltoc">
<span class="htmltocplus">&#160;&#160;&#160;</span>
<a class="htmltoc" href="#examdata">9.2&#160;&#160;<b>Program Data</b></a>
</div><div class="htmltoc">
<span class="htmltocplus">&#160;&#160;&#160;</span>
<a class="htmltoc" href="#examresults">9.3&#160;&#160;<b>Program Results</b></a>
</div>
</div>
</div>
</div>
</div><h2 class="standard"><a class="sec" name="purpose" id="purpose"/>1&#160;&#160;Purpose</h2>
<div class="paramtext">F07AGF (DGECON) estimates the condition number of a real matrix <m:math><m:mi>A</m:mi></m:math>, where <m:math><m:mi>A</m:mi></m:math>&#160;has been factorized by <a class="rout" href="../F07/f07adf.xml">F07ADF (DGETRF)</a>.</div><h2 class="standard"><a class="sec" name="specification" id="specification"/>2&#160;&#160;Specification</h2>
<table class="fspec"><tr><td class="tdfspec1">SUBROUTINE&#160;F07AGF&#160;(</td><td class="tdfspec2"><a class="arg" href="#NORM">NORM</a>, <a class="arg" href="#N">N</a>, <a class="arg" href="#A">A</a>, <a class="arg" href="#LDA">LDA</a>, <a class="arg" href="#ANORM">ANORM</a>, <a class="arg" href="#RCOND">RCOND</a>, <a class="arg" href="#WORK">WORK</a>, <a class="arg" href="#IWORK">IWORK</a>, <a class="arg" href="#INFO">INFO</a>)</td></tr><tr><td class="tdfspec1">INTEGER</td><td class="tdfspec2">N, LDA, IWORK(N), INFO</td></tr><tr><td class="tdfspec1"><b><i>double&#160;precision</i></b></td><td class="tdfspec2">A(LDA,*), ANORM, RCOND, WORK(4*N)</td></tr><tr><td class="tdfspec1">CHARACTER*1</td><td class="tdfspec2">NORM</td></tr></table><div class="paramtext">The routine may be called by its 
    LAPACK
    name <span class="bitalic">dgecon</span>.</div><h2 class="standard"><a class="sec" name="description" id="description"/>3&#160;&#160;Description</h2>
<div class="paramtext">F07AGF (DGECON) estimates the condition number of a real matrix <m:math><m:mi>A</m:mi></m:math>, in either the <m:math><m:mn>1</m:mn></m:math>-norm or the <m:math><m:mi>&#8734;</m:mi></m:math>-norm:

<div class="formula"><table class="formula"><tr><td class="formula"><m:math display="block">
 <m:msub><m:mi>&#954;</m:mi><m:mn>1</m:mn></m:msub>
 <m:mfenced separators=""><m:mi>A</m:mi></m:mfenced>
 <m:mo>=</m:mo>
 <m:msub><m:mfenced open="&#8214;" close="&#8214;" separators=""><m:mi>A</m:mi></m:mfenced><m:mn>1</m:mn></m:msub>
 <m:msub><m:mfenced open="&#8214;" close="&#8214;" separators=""><m:msup><m:mi>A</m:mi><m:mrow><m:mo>-</m:mo><m:mn>1</m:mn></m:mrow></m:msup></m:mfenced><m:mn>1</m:mn></m:msub>
 <m:mtext>&#8195; or &#8195;</m:mtext>
 <m:msub><m:mi>&#954;</m:mi><m:mi>&#8734;</m:mi></m:msub>
 <m:mfenced separators=""><m:mi>A</m:mi></m:mfenced>
 <m:mo>=</m:mo>
 <m:msub><m:mfenced open="&#8214;" close="&#8214;" separators=""><m:mi>A</m:mi></m:mfenced><m:mi>&#8734;</m:mi></m:msub>
 <m:msub><m:mfenced open="&#8214;" close="&#8214;" separators=""><m:msup><m:mi>A</m:mi><m:mrow><m:mo>-</m:mo><m:mn>1</m:mn></m:mrow></m:msup></m:mfenced><m:mi>&#8734;</m:mi></m:msub>
 <m:mtext>.</m:mtext>
</m:math></td><td class="formula2"/></tr></table></div></div><div class="paramtext">Note that <m:math><m:msub><m:mi>&#954;</m:mi><m:mi>&#8734;</m:mi></m:msub><m:mfenced separators=""><m:mi>A</m:mi></m:mfenced><m:mo>=</m:mo><m:msub><m:mi>&#954;</m:mi><m:mn>1</m:mn></m:msub><m:mfenced separators=""><m:msup><m:mi>A</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup></m:mfenced></m:math>.</div><div class="paramtext">Because the condition number is infinite if <m:math><m:mi>A</m:mi></m:math>&#160;is singular, the routine actually returns an estimate of the <b>reciprocal</b> of the condition number.</div><div class="paramtext">The routine should be preceded by a call to <a class="rout" href="../F06/f06raf.xml">F06RAF</a> to compute <m:math><m:msub><m:mfenced open="&#8214;" close="&#8214;" separators=""><m:mi>A</m:mi></m:mfenced><m:mn>1</m:mn></m:msub></m:math>&#160;or <m:math><m:msub><m:mfenced open="&#8214;" close="&#8214;" separators=""><m:mi>A</m:mi></m:mfenced><m:mi>&#8734;</m:mi></m:msub></m:math>, and a call to <a class="rout" href="../F07/f07adf.xml">F07ADF (DGETRF)</a> to compute the <m:math><m:mi>L</m:mi><m:mi>U</m:mi></m:math>&#160;factorization of <m:math><m:mi>A</m:mi></m:math>.  The routine then uses Higham's implementation of Hager's method (see <a class="ref" href="#ref357">Higham (1988)</a>) to estimate <m:math><m:msub><m:mfenced open="&#8214;" close="&#8214;" separators=""><m:msup><m:mi>A</m:mi><m:mrow><m:mo>-</m:mo><m:mn>1</m:mn></m:mrow></m:msup></m:mfenced><m:mn>1</m:mn></m:msub></m:math>&#160;or <m:math><m:msub><m:mfenced open="&#8214;" close="&#8214;" separators=""><m:msup><m:mi>A</m:mi><m:mrow><m:mo>-</m:mo><m:mn>1</m:mn></m:mrow></m:msup></m:mfenced><m:mi>&#8734;</m:mi></m:msub></m:math>.</div><h2 class="standard"><a class="sec" name="references" id="references"/>4&#160;&#160;References</h2><div class="paramtext"><a name="ref357" id="ref357"/>Higham N J (1988)  FORTRAN codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation <i>ACM Trans. Math. Software</i> <b>14</b> 381&#8211;396 </div><h2 class="standard"><a class="sec" name="parameters" id="parameters"/>5&#160;&#160;Parameters</h2>
<dl><dt class="paramhead"><a name="NORM" id="NORM"/>1: &#160;&#160;&#8194; NORM &#8211; CHARACTER*1<span class="pclass">Input</span></dt><dd>
<div class="paramtext"><i>On entry</i>: indicates whether <m:math><m:msub><m:mi>&#954;</m:mi><m:mn>1</m:mn></m:msub><m:mfenced separators=""><m:mi>A</m:mi></m:mfenced></m:math>&#160;or <m:math><m:msub><m:mi>&#954;</m:mi><m:mi>&#8734;</m:mi></m:msub><m:mfenced separators=""><m:mi>A</m:mi></m:mfenced></m:math>&#160;is estimated.

<dl>
<dt class="paramval"><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#NORM"><m:mi mathcolor="#EE0000" mathvariant="bold">NORM</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'1'</m:mtext></m:math>&#160;or <m:math><m:mtext>'O'</m:mtext></m:math></dt>
<dd><m:math><m:msub><m:mi>&#954;</m:mi><m:mn>1</m:mn></m:msub><m:mfenced separators=""><m:mi>A</m:mi></m:mfenced></m:math>&#160;is estimated.</dd>
<dt class="paramval"><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#NORM"><m:mi mathcolor="#EE0000" mathvariant="bold">NORM</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'I'</m:mtext></m:math></dt>
<dd><m:math><m:msub><m:mi>&#954;</m:mi><m:mi>&#8734;</m:mi></m:msub><m:mfenced separators=""><m:mi>A</m:mi></m:mfenced></m:math>&#160;is estimated.</dd></dl>
</div><div class="paramtext"><i>Constraint</i>:
  <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#NORM"><m:mi mathcolor="#EE0000" mathvariant="bold">NORM</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'1'</m:mtext></m:math>, <m:math><m:mtext>'O'</m:mtext></m:math>&#160;or <m:math><m:mtext>'I'</m:mtext></m:math>.
</div></dd><dt class="paramhead"><a name="N" id="N"/>2: &#160;&#160;&#8194; N &#8211; INTEGER<span class="pclass">Input</span></dt><dd>
<div class="paramtext"><i>On entry</i>: 

<m:math><m:mi>n</m:mi></m:math>, the order of the matrix <m:math><m:mi>A</m:mi></m:math>.</div><div class="paramtext"><i>Constraint</i>:
  <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#N"><m:mi mathcolor="#EE0000" mathvariant="bold">N</m:mi></m:maction><m:mo>&#8805;</m:mo><m:mn>0</m:mn></m:math>.
</div></dd><dt class="paramhead"><a name="A" id="A"/>3: &#160;&#160;&#8194; A(<a class="arg" href="#LDA">LDA</a>,<m:math><m:mo>*</m:mo></m:math>) &#8211; <span class="bitalic">double precision</span> array<span class="pclass">Input</span></dt><dd><div class="paramtext"><b>Note:</b> the second dimension of the array <a class="arg" href="#A">A</a>
must be at least
<m:math><m:mrow><m:mi>max</m:mi><m:mspace width="0.125em"/><m:mfenced separators=""><m:mn>1</m:mn><m:mo>,</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#N"><m:mi mathcolor="#EE0000" mathvariant="bold">N</m:mi></m:maction></m:mfenced></m:mrow></m:math>.</div>
<div class="paramtext"><i>On entry</i>: the <m:math><m:mi>L</m:mi><m:mi>U</m:mi></m:math>&#160;factorization of <m:math><m:mi>A</m:mi></m:math>, as returned by 
<a class="rout" href="../F07/f07adf.xml">F07ADF (DGETRF)</a>.</div></dd><dt class="paramhead"><a name="LDA" id="LDA"/>4: &#160;&#160;&#8194; LDA &#8211; INTEGER<span class="pclass">Input</span></dt><dd>
<div class="paramtext"><i>On entry</i>: the first dimension of the array <a class="arg" href="#A">A</a> as declared in the (sub)program from which F07AGF (DGECON) is called.</div><div class="paramtext"><i>Constraint</i>:
  <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#LDA"><m:mi mathcolor="#EE0000" mathvariant="bold">LDA</m:mi></m:maction><m:mo>&#8805;</m:mo><m:mrow><m:mi>max</m:mi><m:mspace width="0.125em"/><m:mfenced separators=""><m:mn>1</m:mn><m:mo>,</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#N"><m:mi mathcolor="#EE0000" mathvariant="bold">N</m:mi></m:maction></m:mfenced></m:mrow></m:math>.
</div></dd><dt class="paramhead"><a name="ANORM" id="ANORM"/>5: &#160;&#160;&#8194; ANORM &#8211; <span class="bitalic">double precision</span><span class="pclass">Input</span></dt><dd><div class="paramtext"><i>On entry</i>: if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#NORM"><m:mi mathcolor="#EE0000" mathvariant="bold">NORM</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'1'</m:mtext></m:math>&#160;or <m:math><m:mtext>'O'</m:mtext></m:math>, the <m:math><m:mn>1</m:mn></m:math>-norm of the <b>original</b> matrix <m:math><m:mi>A</m:mi></m:math>.
<div class="paramtext">If <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#NORM"><m:mi mathcolor="#EE0000" mathvariant="bold">NORM</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'I'</m:mtext></m:math>, the <m:math><m:mi>&#8734;</m:mi></m:math>-norm of the <b>original</b> matrix <m:math><m:mi>A</m:mi></m:math>.</div>
<div class="paramtext"><a class="arg" href="#ANORM">ANORM</a> may be computed by calling <a class="rout" href="../F06/f06raf.xml">F06RAF</a>with the same value for the parameter <a class="arg" href="#NORM">NORM</a>.</div> 
<div class="paramtext"><a class="arg" href="#ANORM">ANORM</a> must be computed either <b>before</b> calling 
<a class="rout" href="../F07/f07adf.xml">F07ADF (DGETRF)</a>
or else from a <b>copy</b> of the original matrix <m:math><m:mi>A</m:mi></m:math>&#160;(see <a class="sec" href="#example">Section 9</a>).</div>
</div><div class="paramtext"><i>Constraint</i>:
  <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#ANORM"><m:mi mathcolor="#EE0000" mathvariant="bold">ANORM</m:mi></m:maction><m:mo>&#8805;</m:mo><m:mn>0.0</m:mn></m:math>.
</div></dd><dt class="paramhead"><a name="RCOND" id="RCOND"/>6: &#160;&#160;&#8194; RCOND &#8211; <span class="bitalic">double precision</span><span class="pclass">Output</span></dt><dd>
<div class="paramtext"><i>On exit</i>: an estimate of the reciprocal of the condition number of <m:math><m:mi>A</m:mi></m:math>. <a class="arg" href="#RCOND">RCOND</a> is set to zero if exact singularity is detected or the estimate underflows. If <a class="arg" href="#RCOND">RCOND</a> is less than <span class="bitalic">machine precision</span>, <m:math><m:mi>A</m:mi></m:math>&#160;is singular to working precision.</div></dd><dt class="paramhead"><a name="WORK" id="WORK"/>7: &#160;&#160;&#8194; WORK(<m:math><m:mn>4</m:mn><m:mo>&#215;</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#N"><m:mi mathcolor="#EE0000" mathvariant="bold">N</m:mi></m:maction></m:math>) &#8211; <span class="bitalic">double precision</span> array<span class="pclass">Workspace</span></dt><dt class="paramhead"><a name="IWORK" id="IWORK"/>8: &#160;&#160;&#8194; IWORK(<a class="arg" href="#N">N</a>) &#8211; INTEGER array<span class="pclass">Workspace</span></dt><dt class="paramhead"><a name="INFO" id="INFO"/>9: &#160;&#160;&#8194; INFO &#8211; INTEGER<span class="pclass">Output</span></dt><dd><div class="paramtext"><i>On exit</i>: <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#INFO"><m:mi mathcolor="#EE0000" mathvariant="bold">INFO</m:mi></m:maction><m:mo>=</m:mo><m:mn>0</m:mn></m:math>&#160;unless the routine detects an error (see <a class="sec" href="#errors">Section 6</a>).</div>
</dd></dl><h2 class="standard"><a class="sec" name="errors" id="errors"/>6&#160;&#160;Error Indicators and Warnings</h2>
<div class="paramtext">Errors or warnings detected by the routine:</div>
<dl class="ifail">
<dt class="errorhead"><a name="INlt0" id="INlt0"/><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#INFO"><m:mi mathcolor="#EE0000" mathvariant="bold">INFO</m:mi></m:maction><m:mo>&lt;</m:mo><m:mn>0</m:mn></m:math></dt>
<dd><div class="paramtext">If <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#INFO"><m:mi mathcolor="#EE0000" mathvariant="bold">INFO</m:mi></m:maction><m:mo>=</m:mo><m:mo>-</m:mo><m:mi>i</m:mi></m:math>, the <m:math><m:mi>i</m:mi></m:math>th parameter had an illegal value. An explanatory message is output, and execution of the program is terminated.</div>
</dd>
</dl><h2 class="standard"><a class="sec" name="accuracy" id="accuracy"/>7&#160;&#160;Accuracy</h2>
<div class="paramtext">The computed estimate <a class="arg" href="#RCOND">RCOND</a> is never less than the true value <m:math><m:mi>&#961;</m:mi></m:math>, and in practice is nearly always less than <m:math><m:mn>10</m:mn><m:mi>&#961;</m:mi></m:math>, although examples can be constructed where <a class="arg" href="#RCOND">RCOND</a> is much larger.</div><h2 class="standard"><a class="sec" name="fcomments" id="fcomments"/>8&#160;&#160;Further Comments</h2>
<div class="paramtext">A call to F07AGF (DGECON) involves solving a number of systems of linear equations of the form <m:math><m:mi>A</m:mi><m:mi>x</m:mi><m:mo>=</m:mo><m:mi>b</m:mi></m:math>&#160;or <m:math><m:msup><m:mi>A</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup><m:mi>x</m:mi><m:mo>=</m:mo><m:mi>b</m:mi></m:math>; the number is usually <m:math><m:mn>4</m:mn></m:math>&#160;or <m:math><m:mn>5</m:mn></m:math>&#160;and never more than <m:math><m:mn>11</m:mn></m:math>.  Each solution involves approximately <m:math><m:mn>2</m:mn><m:mo>&#8290;</m:mo><m:msup><m:mi>n</m:mi><m:mn>2</m:mn></m:msup></m:math>&#160;floating-point operations but takes considerably longer than a call to <a class="rout" href="../F07/f07aef.xml">F07AEF (DGETRS)</a> with one right-hand side, because extra care is taken to avoid overflow when <m:math><m:mi>A</m:mi></m:math>&#160;is approximately singular.</div><div class="paramtext">The complex analogue of this routine is <a class="rout" href="../F07/f07auf.xml">F07AUF (ZGECON)</a>.</div><h2 class="standard"><a class="sec" name="example" id="example"/>9&#160;&#160;Example</h2>
<div class="paramtext">This example estimates the condition number in the <m:math><m:mn>1</m:mn></m:math>-norm of the matrix <m:math><m:mi>A</m:mi></m:math>, where

<div class="formula"><table class="formula"><tr><td class="formula"><m:math display="block">
<m:mi>A</m:mi><m:mo>=</m:mo>
 <m:mfenced><m:mtable>
  <m:mtr columnalign="right">
   <m:mtd><m:mn>1.80</m:mn></m:mtd>
   <m:mtd><m:mn>2.88</m:mn></m:mtd>
   <m:mtd><m:mn>2.05</m:mn></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>0.89</m:mn></m:mrow></m:mtd>
  </m:mtr><m:mtr columnalign="right">
   <m:mtd><m:mn>5.25</m:mn></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>2.95</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>0.95</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>3.80</m:mn></m:mrow></m:mtd>
  </m:mtr><m:mtr columnalign="right">
   <m:mtd><m:mn>1.58</m:mn></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>2.69</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>2.90</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>1.04</m:mn></m:mrow></m:mtd>
  </m:mtr><m:mtr columnalign="right">
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>1.11</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>0.66</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>0.59</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mn>0.80</m:mn></m:mtd>
  </m:mtr>
 </m:mtable></m:mfenced>
<m:mtext>.</m:mtext>
</m:math></td><td class="formula2"/></tr></table></div>

Here <m:math><m:mi>A</m:mi></m:math>&#160;is nonsymmetric and must first be factorized by <a class="rout" href="../F07/f07adf.xml">F07ADF (DGETRF)</a>.  The true condition number in the <m:math><m:mn>1</m:mn></m:math>-norm is <m:math><m:mn>152.16</m:mn></m:math>.</div><h3 class="standard"><a class="sec" name="examtext" id="examtext"/>9.1&#160;&#160;Program Text</h3>
<p><a class="verbatimref" href="../../examples/source/f07agfe.f">Program Text (f07agfe.f)</a></p><h3 class="standard"><a class="sec" name="examdata" id="examdata"/>9.2&#160;&#160;Program Data</h3>
<p><a class="verbatimref" href="../../examples/data/f07agfe.d">Program&#160;Data (f07agfe.d)</a></p><h3 class="standard"><a class="sec" name="examresults" id="examresults"/>9.3&#160;&#160;Program Results</h3>
<p><a class="verbatimref" href="../../examples/baseresults/f07agfe.r">Program Results (f07agfe.r)</a></p>
<hr/><div><a class="rout" href="../../pdf/F07/f07agf.pdf">F07AGF (DGECON) (PDF version)</a></div><div><a class="chap" href="f07conts.xml">F07 Chapter Contents</a></div><div><a class="chapint" href="f07intro.xml">F07 Chapter Introduction</a></div>
<div><a class="htmltoc" href="../FRONTMATTER/manconts.xml">NAG Library Manual</a></div>
<div><hr/><a class="genint" href="../FRONTMATTER/copyright.xml">&#169; The Numerical Algorithms Group Ltd, Oxford, UK. 2009</a></div></body></html>
