<?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>F07BEF (DGBTRS) : 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/f07bef.pdf">F07BEF (DGBTRS) (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/>F07BEF (DGBTRS)</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">F07BEF (DGBTRS) solves a real band system of linear equations with multiple right-hand sides,

<div class="formula"><table class="formula"><tr><td class="formula"><m:math display="block">
 <m:mi>A</m:mi><m:mi>X</m:mi><m:mo>=</m:mo><m:mi>B</m:mi>
 <m:mtext>&#8195; or &#8195;</m:mtext>
 <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:mtext>,</m:mtext>
</m:math></td><td class="formula2"/></tr></table></div>

where <m:math><m:mi>A</m:mi></m:math>&#160;has been factorized by <a class="rout" href="../F07/f07bdf.xml">F07BDF (DGBTRF)</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;F07BEF&#160;(</td><td class="tdfspec2"><a class="arg" href="#TRANS">TRANS</a>, <a class="arg" href="#N">N</a>, <a class="arg" href="#KL">KL</a>, <a class="arg" href="#KU">KU</a>, <a class="arg" href="#NRHS">NRHS</a>, <a class="arg" href="#AB">AB</a>, <a class="arg" href="#LDAB">LDAB</a>, <a class="arg" href="#IPIV">IPIV</a>, <a class="arg" href="#B">B</a>, <a class="arg" href="#LDB">LDB</a>, <a class="arg" href="#INFO">INFO</a>)</td></tr><tr><td class="tdfspec1">INTEGER</td><td class="tdfspec2">N, KL, KU, NRHS, LDAB, IPIV(*), LDB, INFO</td></tr><tr><td class="tdfspec1"><b><i>double&#160;precision</i></b></td><td class="tdfspec2">AB(LDAB,*), B(LDB,*)</td></tr><tr><td class="tdfspec1">CHARACTER*1</td><td class="tdfspec2">TRANS</td></tr></table><div class="paramtext">The routine may be called by its 
    LAPACK
    name <span class="bitalic">dgbtrs</span>.</div><h2 class="standard"><a class="sec" name="description" id="description"/>3&#160;&#160;Description</h2>
<div class="paramtext">F07BEF (DGBTRS) is used to solve a real band system of linear equations <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 routine must be preceded by a call to <a class="rout" href="../F07/f07bdf.xml">F07BDF (DGBTRF)</a> which computes 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>&#160;as <m:math><m:mi>A</m:mi><m:mo>=</m:mo><m:mi>P</m:mi><m:mi>L</m:mi><m:mi>U</m:mi></m:math>.  The solution is computed by forward and backward substitution.</div><div class="paramtext">If <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#TRANS"><m:mi mathcolor="#EE0000" mathvariant="bold">TRANS</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'N'</m:mtext></m:math>, the solution is computed by solving <m:math><m:mi>P</m:mi><m:mi>L</m:mi><m:mi>Y</m:mi><m:mo>=</m:mo><m:mi>B</m:mi></m:math>&#160;and then <m:math><m:mi>U</m:mi><m:mi>X</m:mi><m:mo>=</m:mo><m:mi>Y</m:mi></m:math>.</div><div class="paramtext">If <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#TRANS"><m:mi mathcolor="#EE0000" mathvariant="bold">TRANS</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'T'</m:mtext></m:math>&#160;or <m:math><m:mtext>'C'</m:mtext></m:math>, the solution is computed by solving <m:math><m:msup><m:mi>U</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup><m:mi>Y</m:mi><m:mo>=</m:mo><m:mi>B</m:mi></m:math>&#160;and then <m:math><m:msup><m:mi>L</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup><m:msup><m:mi>P</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup><m:mi>X</m:mi><m:mo>=</m:mo><m:mi>Y</m:mi></m:math>.</div><h2 class="standard"><a class="sec" name="references" id="references"/>4&#160;&#160;References</h2><div class="paramtext"><a name="ref105" id="ref105"/>Golub G H and Van Loan C F (1996)  <i>Matrix Computations</i> (3rd Edition) Johns Hopkins University Press, Baltimore </div><h2 class="standard"><a class="sec" name="parameters" id="parameters"/>5&#160;&#160;Parameters</h2>
<dl><dt class="paramhead"><a name="TRANS" id="TRANS"/>1: &#160;&#160;&#8194; TRANS &#8211; CHARACTER*1<span class="pclass">Input</span></dt><dd>
<div class="paramtext"><i>On entry</i>: indicates the form of the equations.

<dl>
<dt class="paramval"><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#TRANS"><m:mi mathcolor="#EE0000" mathvariant="bold">TRANS</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'N'</m:mtext></m:math></dt>
<dd><m:math><m:mi>A</m:mi><m:mi>X</m:mi><m:mo>=</m:mo><m:mi>B</m:mi></m:math>&#160;is solved for <m:math><m:mi>X</m:mi></m:math>.</dd>
<dt class="paramval"><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#TRANS"><m:mi mathcolor="#EE0000" mathvariant="bold">TRANS</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'T'</m:mtext></m:math>&#160;or <m:math><m:mtext>'C'</m:mtext></m:math></dt>
<dd><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>&#160;is solved for <m:math><m:mi>X</m:mi></m:math>.</dd></dl>
</div><div class="paramtext"><i>Constraint</i>:
  <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#TRANS"><m:mi mathcolor="#EE0000" mathvariant="bold">TRANS</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'N'</m:mtext></m:math>, <m:math><m:mtext>'T'</m:mtext></m:math>&#160;or <m:math><m:mtext>'C'</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="KL" id="KL"/>3: &#160;&#160;&#8194; KL &#8211; INTEGER<span class="pclass">Input</span></dt><dd><div class="paramtext"><i>On entry</i>: <m:math><m:msub><m:mi>k</m:mi><m:mi>l</m:mi></m:msub></m:math>, the number of subdiagonals within the band 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="#KL"><m:mi mathcolor="#EE0000" mathvariant="bold">KL</m:mi></m:maction><m:mo>&#8805;</m:mo><m:mn>0</m:mn></m:math>.
</div></dd><dt class="paramhead"><a name="KU" id="KU"/>4: &#160;&#160;&#8194; KU &#8211; INTEGER<span class="pclass">Input</span></dt><dd><div class="paramtext"><i>On entry</i>: <m:math><m:msub><m:mi>k</m:mi><m:mi>u</m:mi></m:msub></m:math>, the number of superdiagonals within the band 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="#KU"><m:mi mathcolor="#EE0000" mathvariant="bold">KU</m:mi></m:maction><m:mo>&#8805;</m:mo><m:mn>0</m:mn></m:math>.
</div></dd><dt class="paramhead"><a name="NRHS" id="NRHS"/>5: &#160;&#160;&#8194; NRHS &#8211; INTEGER<span class="pclass">Input</span></dt><dd>
<div class="paramtext"><i>On entry</i>: <m:math><m:mi>r</m:mi></m:math>, the number of right-hand sides.</div><div class="paramtext"><i>Constraint</i>:
  <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#NRHS"><m:mi mathcolor="#EE0000" mathvariant="bold">NRHS</m:mi></m:maction><m:mo>&#8805;</m:mo><m:mn>0</m:mn></m:math>.
</div></dd><dt class="paramhead"><a name="AB" id="AB"/>6: &#160;&#160;&#8194; AB(<a class="arg" href="#LDAB">LDAB</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="#AB">AB</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/f07bdf.xml">F07BDF (DGBTRF)</a>.</div></dd><dt class="paramhead"><a name="LDAB" id="LDAB"/>7: &#160;&#160;&#8194; LDAB &#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="#AB">AB</a> as declared in the (sub)program from which F07BEF (DGBTRS) is called.</div><div class="paramtext"><i>Constraint</i>:
  <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#LDAB"><m:mi mathcolor="#EE0000" mathvariant="bold">LDAB</m:mi></m:maction><m:mo>&#8805;</m:mo><m:mn>2</m:mn><m:mo>&#215;</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#KL"><m:mi mathcolor="#EE0000" mathvariant="bold">KL</m:mi></m:maction><m:mo>+</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#KU"><m:mi mathcolor="#EE0000" mathvariant="bold">KU</m:mi></m:maction><m:mo>+</m:mo><m:mn>1</m:mn></m:math>.
</div></dd><dt class="paramhead"><a name="IPIV" id="IPIV"/>8: &#160;&#160;&#8194; IPIV(<m:math><m:mo>*</m:mo></m:math>) &#8211; INTEGER array<span class="pclass">Input</span></dt><dd>
<div class="paramtext"><b>Note:</b> the dimension of the array <a class="arg" href="#IPIV">IPIV</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 pivot indices, as returned by 
<a class="rout" href="../F07/f07bdf.xml">F07BDF (DGBTRF)</a>.</div></dd><dt class="paramhead"><a name="B" id="B"/>9: &#160;&#160;&#8194; B(<a class="arg" href="#LDB">LDB</a>,<m:math><m:mo>*</m:mo></m:math>) &#8211; <span class="bitalic">double precision</span> array<span class="pclass">Input/Output</span></dt><dd><div class="paramtext"><b>Note:</b> the second dimension of the array <a class="arg" href="#B">B</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="#NRHS"><m:mi mathcolor="#EE0000" mathvariant="bold">NRHS</m:mi></m:maction></m:mfenced></m:mrow></m:math>.</div>
<div class="paramtext"><i>On entry</i>: the <m:math><m:mi>n</m:mi></m:math>&#160;by <m:math><m:mi>r</m:mi></m:math>&#160;right-hand side matrix <m:math><m:mi>B</m:mi></m:math>.</div><div class="paramtext"><i>On exit</i>: the <m:math><m:mi>n</m:mi></m:math>&#160;by <m:math><m:mi>r</m:mi></m:math>&#160;solution matrix <m:math><m:mi>X</m:mi></m:math>.</div></dd><dt class="paramhead"><a name="LDB" id="LDB"/>10: &#8194; LDB &#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="#B">B</a> as declared in the (sub)program from which F07BEF (DGBTRS) is called.</div><div class="paramtext"><i>Constraint</i>:
  <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#LDB"><m:mi mathcolor="#EE0000" mathvariant="bold">LDB</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="INFO" id="INFO"/>11: &#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">For each right-hand side vector <m:math><m:mi>b</m:mi></m:math>, the computed solution <m:math><m:mi>x</m:mi></m:math>&#160;is the exact solution of a perturbed system of equations <m:math><m:mfenced separators=""><m:mi>A</m:mi><m:mo>+</m:mo><m:mi>E</m:mi></m:mfenced><m:mi>x</m:mi><m:mo>=</m:mo><m:mi>b</m:mi></m:math>, where

<div class="formula"><table class="formula"><tr><td class="formula"><m:math display="block">
<m:mfenced open="|" close="|" separators=""><m:mi>E</m:mi></m:mfenced><m:mo>&#8804;</m:mo><m:mi>c</m:mi><m:mfenced separators=""><m:mi>k</m:mi></m:mfenced><m:mi>&#949;</m:mi><m:mi>P</m:mi><m:mfenced open="|" close="|" separators=""><m:mi>L</m:mi></m:mfenced><m:mfenced open="|" close="|" separators=""><m:mi>U</m:mi></m:mfenced>
 <m:mtext>,</m:mtext>
</m:math></td><td class="formula2"/></tr></table></div><m:math><m:mi>c</m:mi><m:mfenced separators=""><m:mi>k</m:mi></m:mfenced></m:math>&#160;is a modest linear function of <m:math><m:mi>k</m:mi><m:mo>=</m:mo><m:msub><m:mi>k</m:mi><m:mi>l</m:mi></m:msub><m:mo>+</m:mo><m:msub><m:mi>k</m:mi><m:mi>u</m:mi></m:msub><m:mo>+</m:mo><m:mn>1</m:mn></m:math>, and <m:math><m:mi>&#949;</m:mi></m:math>&#160;is the <span class="bitalic">machine precision</span>.  This assumes <m:math><m:mi>k</m:mi><m:mo>&#8810;</m:mo><m:mi>n</m:mi></m:math>.</div><div class="paramtext">If <m:math><m:mover><m:mi>x</m:mi><m:mo>^</m:mo></m:mover></m:math>&#160;is the true solution, then the computed solution <m:math><m:mi>x</m:mi></m:math>&#160;satisfies a forward error bound of the form

<div class="formula"><table class="formula"><tr><td class="formula"><m:math display="block">
<m:mfrac><m:msub><m:mfenced open="&#8214;" close="&#8214;" separators=""><m:mi>x</m:mi><m:mo>-</m:mo><m:mover><m:mi>x</m:mi><m:mo>^</m:mo></m:mover></m:mfenced><m:mi>&#8734;</m:mi></m:msub>
  <m:msub><m:mfenced open="&#8214;" close="&#8214;" separators=""><m:mi>x</m:mi></m:mfenced><m:mi>&#8734;</m:mi></m:msub>
 </m:mfrac><m:mo>&#8804;</m:mo><m:mi>c</m:mi><m:mfenced separators=""><m:mi>k</m:mi></m:mfenced><m:mrow><m:mi>cond</m:mi><m:mfenced separators=""><m:mi>A</m:mi><m:mo>,</m:mo><m:mi>x</m:mi></m:mfenced></m:mrow><m:mi>&#949;</m:mi>
</m:math></td><td class="formula2"/></tr></table></div>

where <m:math><m:mrow><m:mi>cond</m:mi><m:mfenced separators=""><m:mi>A</m:mi><m:mo>,</m:mo><m:mi>x</m:mi></m:mfenced></m:mrow><m:mo>=</m:mo><m:msub><m:mfenced open="&#8214;" close="&#8214;" separators=""><m:mfenced open="|" close="|" 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:mfenced open="|" close="|" separators=""><m:mi>A</m:mi></m:mfenced><m:mfenced open="|" close="|" separators=""><m:mi>x</m:mi></m:mfenced></m:mfenced><m:mi>&#8734;</m:mi></m:msub><m:mo>/</m:mo><m:msub><m:mfenced open="&#8214;" close="&#8214;" separators=""><m:mi>x</m:mi></m:mfenced><m:mi>&#8734;</m:mi></m:msub><m:mo>&#8804;</m:mo><m:mrow><m:mi>cond</m:mi><m:mfenced separators=""><m:mi>A</m:mi></m:mfenced></m:mrow><m:mo>=</m:mo><m:msub><m:mfenced open="&#8214;" close="&#8214;" separators=""><m:mfenced open="|" close="|" 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:mfenced open="|" close="|" separators=""><m:mi>A</m:mi></m:mfenced></m:mfenced><m:mi>&#8734;</m:mi></m:msub><m:mo>&#8804;</m:mo><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>.</div><div class="paramtext">Note that <m:math><m:mrow><m:mi>cond</m:mi><m:mfenced separators=""><m:mi>A</m:mi><m:mo>,</m:mo><m:mi>x</m:mi></m:mfenced></m:mrow></m:math>&#160;can be much smaller than <m:math><m:mrow><m:mi>cond</m:mi><m:mfenced separators=""><m:mi>A</m:mi></m:mfenced></m:mrow></m:math>, and <m:math><m:mrow><m:mi>cond</m:mi><m:mfenced separators=""><m:msup><m:mi>A</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup></m:mfenced></m:mrow></m:math>&#160;can be much larger (or smaller) than <m:math><m:mrow><m:mi>cond</m:mi><m:mfenced separators=""><m:mi>A</m:mi></m:mfenced></m:mrow></m:math>.</div><div class="paramtext">Forward and backward error bounds can be computed by calling <a class="rout" href="../F07/f07bhf.xml">F07BHF (DGBRFS)</a>, and an estimate for <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;can be obtained by calling <a class="rout" href="../F07/f07bgf.xml">F07BGF (DGBCON)</a> with <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="../F07/f07bgf.xml#NORM"><m:mi mathcolor="#EE0000" mathvariant="bold">NORM</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'I'</m:mtext></m:math>.</div><h2 class="standard"><a class="sec" name="fcomments" id="fcomments"/>8&#160;&#160;Further Comments</h2>
<div class="paramtext">The total number of floating-point operations is approximately <m:math><m:mn>2</m:mn><m:mi>n</m:mi><m:mfenced separators=""><m:mn>2</m:mn><m:msub><m:mi>k</m:mi><m:mi>l</m:mi></m:msub><m:mo>+</m:mo><m:msub><m:mi>k</m:mi><m:mi>u</m:mi></m:msub></m:mfenced><m:mi>r</m:mi></m:math>, assuming <m:math><m:mi>n</m:mi><m:mo>&#8811;</m:mo><m:msub><m:mi>k</m:mi><m:mi>l</m:mi></m:msub></m:math>&#160;and <m:math><m:mi>n</m:mi><m:mo>&#8811;</m:mo><m:msub><m:mi>k</m:mi><m:mi>u</m:mi></m:msub></m:math>.</div><div class="paramtext">This routine may be followed by a call to <a class="rout" href="../F07/f07bhf.xml">F07BHF (DGBRFS)</a> to refine the solution and return an error estimate.</div><div class="paramtext">The complex analogue of this routine is <a class="rout" href="../F07/f07bsf.xml">F07BSF (ZGBTRS)</a>.</div><h2 class="standard"><a class="sec" name="example" id="example"/>9&#160;&#160;Example</h2>
<div class="paramtext">This example solves the system of equations <m:math><m:mi>A</m:mi><m:mi>X</m:mi><m:mo>=</m:mo><m:mi>B</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:mrow><m:mo>-</m:mo><m:mn>0.23</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mn>2.54</m:mn></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>3.66</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mn>0.00</m:mn></m:mtd>
  </m:mtr><m:mtr columnalign="right">
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>6.98</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mn>2.46</m:mn></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>2.73</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>2.13</m:mn></m:mrow></m:mtd>
  </m:mtr><m:mtr columnalign="right">
   <m:mtd><m:mn>0.00</m:mn></m:mtd>
   <m:mtd><m:mn>2.56</m:mn></m:mtd>
   <m:mtd><m:mn>2.46</m:mn></m:mtd>
   <m:mtd><m:mn>4.07</m:mn></m:mtd>
  </m:mtr><m:mtr columnalign="right">
   <m:mtd><m:mn>0.00</m:mn></m:mtd>
   <m:mtd><m:mn>0.00</m:mn></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>4.78</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>3.82</m:mn></m:mrow></m:mtd>
  </m:mtr>
 </m:mtable></m:mfenced>
<m:mtext>&#8195; and &#8195;</m:mtext>
 <m:mi>B</m:mi><m:mo>=</m:mo>
 <m:mfenced><m:mtable>
  <m:mtr columnalign="right">
   <m:mtd><m:mn>4.42</m:mn></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>36.01</m:mn></m:mrow></m:mtd>
  </m:mtr><m:mtr columnalign="right">
   <m:mtd><m:mn>27.13</m:mn></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>31.67</m:mn></m:mrow></m:mtd>
  </m:mtr><m:mtr columnalign="right">
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>6.14</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>1.16</m:mn></m:mrow></m:mtd>
  </m:mtr><m:mtr columnalign="right">
   <m:mtd><m:mn>10.50</m:mn></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>25.82</m:mn></m:mrow></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 is treated as a band matrix, which must first be factorized by <a class="rout" href="../F07/f07bdf.xml">F07BDF (DGBTRF)</a>.</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/f07befe.f">Program Text (f07befe.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/f07befe.d">Program&#160;Data (f07befe.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/f07befe.r">Program Results (f07befe.r)</a></p>
<hr/><div><a class="rout" href="../../pdf/F07/f07bef.pdf">F07BEF (DGBTRS) (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>
