<?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>F08LEF (DGBBRD) : NAG Library, Mark 23</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/F08/f08lef.pdf">F08LEF (DGBBRD) (PDF version)</a></div><div><a class="chap" href="f08conts.xml">F08 Chapter Contents</a></div><div><a class="chapint" href="f08intro.xml">F08 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/>F08LEF (DGBBRD)</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">F08LEF (DGBBRD) reduces a real <m:math><m:mi>m</m:mi></m:math>&#160;by <m:math><m:mi>n</m:mi></m:math>&#160;band matrix to upper bidiagonal form.</div><h2 class="standard"><a class="sec" name="specification" id="specification"/>2&#160;&#160;Specification</h2><table class="fspec"><tr><td class="tdfspec1">
<div class="left-tablediv"><table class="fspec1"><tbody>
<tr>
<td class="tdfspec1" valign="top" align="left">SUBROUTINE&#160;F08LEF&#160;(</td>
<td class="tdfspec2" valign="top" align="left"><a class="arg" href="#VECT">VECT</a>, <a class="arg" href="#M">M</a>, <a class="arg" href="#N">N</a>, <a class="arg" href="#NCC">NCC</a>, <a class="arg" href="#KL">KL</a>, <a class="arg" href="#KU">KU</a>, <a class="arg" href="#AB">AB</a>, <a class="arg" href="#LDAB">LDAB</a>, <a class="arg" href="#D">D</a>, <a class="arg" href="#E">E</a>, <a class="arg" href="#Q">Q</a>, <a class="arg" href="#LDQ">LDQ</a>, <a class="arg" href="#PT">PT</a>, <a class="arg" href="#LDPT">LDPT</a>, <a class="arg" href="#C">C</a>, <a class="arg" href="#LDC">LDC</a>, <a class="arg" href="#WORK">WORK</a>, <a class="arg" href="#INFO">INFO</a>)</td>
</tr>
</tbody>
</table></div>
<div class="left-tablediv"><table class="fspec3"><tbody>
<tr>
<td class="tdfspec1" valign="top" align="left">INTEGER&#160;</td>
<td class="tdfspec2" valign="top" align="left">M, N, NCC, KL, KU, LDAB, LDQ, LDPT, LDC, INFO</td>
</tr>
<tr>
<td class="tdfspec1" valign="top" align="left">REAL&#160;(KIND=nag_wp)&#160;</td>
<td class="tdfspec2" valign="top" align="left">AB(LDAB,*), D(min(M,N)), E(min(M,N)-1), Q(LDQ,*), PT(LDPT,*), C(LDC,*), WORK(2*max(M,N))</td>
</tr><tr>
<td class="tdfspec1" valign="top" align="left">CHARACTER(1)&#160;</td>
<td class="tdfspec2" valign="top" align="left">VECT</td></tr>
</tbody>
</table></div>
</td></tr></table>
<div class="paramtext">The routine may be called by its 
    LAPACK
    name <span class="bitalic">dgbbrd</span>.</div><h2 class="standard"><a class="sec" name="description" id="description"/>3&#160;&#160;Description</h2>
<div class="paramtext">F08LEF (DGBBRD) reduces a real <m:math><m:mi>m</m:mi></m:math>&#160;by <m:math><m:mi>n</m:mi></m:math>&#160;band matrix to upper bidiagonal form <m:math><m:mi>B</m:mi></m:math>&#160;by an orthogonal transformation: <m:math><m:mi>A</m:mi><m:mo>=</m:mo><m:mi>Q</m:mi><m:mi>B</m:mi><m:msup><m:mi>P</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup></m:math>.  The orthogonal matrices <m:math><m:mi>Q</m:mi></m:math>&#160;and <m:math><m:msup><m:mi>P</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup></m:math>, of order <m:math><m:mi>m</m:mi></m:math>&#160;and <m:math><m:mi>n</m:mi></m:math>&#160;respectively, are determined as a product of Givens rotation matrices, and may be formed explicitly by the routine if required.  A matrix <m:math><m:mi>C</m:mi></m:math>&#160;may also be updated to give <m:math><m:mover><m:mi>C</m:mi><m:mo>~</m:mo></m:mover><m:mo>=</m:mo><m:msup><m:mi>Q</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup><m:mi>C</m:mi></m:math>.</div><div class="paramtext">The routine uses a vectorizable form of the reduction.</div><h2 class="standard"><a class="sec" name="references" id="references"/>4&#160;&#160;References</h2>
<div class="paramtext">None.</div><h2 class="standard"><a class="sec" name="parameters" id="parameters"/>5&#160;&#160;Parameters</h2>
<dl><dt class="paramhead"><a name="VECT" id="VECT"/>1: &#160;&#160;&#8194; VECT &#8211; CHARACTER(1)<span class="pclass">Input</span></dt><dd>
<div class="paramtext"><i>On entry</i>: indicates whether the matrices <m:math><m:mi>Q</m:mi></m:math>&#160;and/or
<m:math><m:msup><m:mi>P</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup></m:math>&#160;are generated.

<dl>
<dt class="paramval"><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#VECT"><m:mi mathcolor="#EE0000" mathvariant="bold">VECT</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'N'</m:mtext></m:math></dt>
<dd>Neither <m:math><m:mi>Q</m:mi></m:math>&#160;nor
<m:math><m:msup><m:mi>P</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup></m:math>&#160;is generated.</dd>
<dt class="paramval"><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#VECT"><m:mi mathcolor="#EE0000" mathvariant="bold">VECT</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'Q'</m:mtext></m:math></dt>
<dd><m:math><m:mi>Q</m:mi></m:math>&#160;is generated.</dd>
<dt class="paramval"><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#VECT"><m:mi mathcolor="#EE0000" mathvariant="bold">VECT</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'P'</m:mtext></m:math></dt>
<dd><m:math><m:msup><m:mi>P</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup></m:math>&#160;is generated.</dd>
<dt class="paramval"><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#VECT"><m:mi mathcolor="#EE0000" mathvariant="bold">VECT</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'B'</m:mtext></m:math></dt>
<dd>Both <m:math><m:mi>Q</m:mi></m:math>&#160;and
<m:math><m:msup><m:mi>P</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup></m:math>&#160;are generated.</dd></dl>
</div><div class="paramtext"><i>Constraint</i>:
  <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#VECT"><m:mi mathcolor="#EE0000" mathvariant="bold">VECT</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'N'</m:mtext></m:math>, <m:math><m:mtext>'Q'</m:mtext></m:math>, <m:math><m:mtext>'P'</m:mtext></m:math>&#160;or <m:math><m:mtext>'B'</m:mtext></m:math>.
</div>
</dd><dt class="paramhead"><a name="M" id="M"/>2: &#160;&#160;&#8194; M &#8211; INTEGER<span class="pclass">Input</span></dt><dd>
<div class="paramtext"><i>On entry</i>: 
<m:math><m:mi>m</m:mi></m:math>, the number of rows 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="#M"><m:mi mathcolor="#EE0000" mathvariant="bold">M</m:mi></m:maction><m:mo>&#8805;</m:mo><m:mn>0</m:mn></m:math>.
</div>
</dd><dt class="paramhead"><a name="N" id="N"/>3: &#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 number of columns 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="NCC" id="NCC"/>4: &#160;&#160;&#8194; NCC &#8211; INTEGER<span class="pclass">Input</span></dt><dd>
<div class="paramtext"><i>On entry</i>: <m:math><m:msub><m:mi>n</m:mi><m:mi>C</m:mi></m:msub></m:math>, the number of columns of the matrix <m:math><m:mi>C</m:mi></m:math>.</div><div class="paramtext"><i>Constraint</i>:
  <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#NCC"><m:mi mathcolor="#EE0000" mathvariant="bold">NCC</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"/>5: &#160;&#160;&#8194; KL &#8211; INTEGER<span class="pclass">Input</span></dt><dd><div class="paramtext"><i>On entry</i>: the number of subdiagonals, <m:math><m:msub><m:mi>k</m:mi><m:mi>l</m:mi></m:msub></m:math>, within the band of <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"/>6: &#160;&#160;&#8194; KU &#8211; INTEGER<span class="pclass">Input</span></dt><dd><div class="paramtext"><i>On entry</i>: the number of superdiagonals, <m:math><m:msub><m:mi>k</m:mi><m:mi>u</m:mi></m:msub></m:math>, within the band of <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="AB" id="AB"/>7: &#160;&#160;&#8194; AB(<a class="arg" href="#LDAB">LDAB</a>,<m:math><m:mo>*</m:mo></m:math>) &#8211; REAL&#160;(KIND=nag_wp)&#160;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="#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 original <m:math><m:mi>m</m:mi></m:math>&#160;by <m:math><m:mi>n</m:mi></m:math>&#160;band matrix <m:math><m:mi>A</m:mi></m:math>.

<div class="paramtext">The matrix is stored in rows <m:math><m:mn>1</m:mn></m:math>&#160;to <m:math><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>, more precisely, the element <m:math><m:msub><m:mi>A</m:mi><m:mrow><m:mi>i</m:mi><m:mi>j</m:mi></m:mrow></m:msub></m:math>&#160;must be stored in 
<div class="formula"><table class="formula"><tr><td class="formula"><m:math display="block"><m:mrow><m:maction actiontype="link" dsi:type="simple" dsi:href="#AB"><m:mi mathcolor="#EE0000" mathvariant="bold">AB</m:mi></m:maction><m:mfenced separators="," open="(" close=")"><m:mrow><m:msub><m:mi>k</m:mi><m:mi>u</m:mi></m:msub><m:mo>+</m:mo><m:mn>1</m:mn><m:mo>+</m:mo><m:mi>i</m:mi><m:mo>-</m:mo><m:mi>j</m:mi></m:mrow><m:mi>j</m:mi></m:mfenced></m:mrow><m:mtext>&#8195; for &#8203;</m:mtext><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:mrow><m:mi>j</m:mi><m:mo>-</m:mo><m:msub><m:mi>k</m:mi><m:mi>u</m:mi></m:msub></m:mrow></m:mfenced></m:mrow><m:mo>&#8804;</m:mo><m:mi>i</m:mi><m:mo>&#8804;</m:mo><m:mrow><m:mi>min</m:mi><m:mspace width="0.125em"/><m:mfenced separators=""><m:mi>m</m:mi><m:mo>,</m:mo><m:mrow><m:mi>j</m:mi><m:mo>+</m:mo><m:msub><m:mi>k</m:mi><m:mi>l</m:mi></m:msub></m:mrow></m:mfenced></m:mrow><m:mtext>.</m:mtext></m:math></td><td class="formula2"/></tr></table></div>
</div>
</div>
<div class="paramtext"><i>On exit</i>: <a class="arg" href="#AB">AB</a> is overwritten by values generated during the reduction.</div></dd><dt class="paramhead"><a name="LDAB" id="LDAB"/>8: &#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 F08LEF (DGBBRD) 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: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="D" id="D"/>9: &#160;&#160;&#8194; D(<m:math><m:mrow><m:mi>min</m:mi><m:mspace width="0.125em"/><m:mfenced separators=""><m:maction actiontype="link" dsi:type="simple" dsi:href="#M"><m:mi mathcolor="#EE0000" mathvariant="bold">M</m:mi></m:maction><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>) &#8211; REAL&#160;(KIND=nag_wp)&#160;array<span class="pclass">Output</span></dt><dd><div class="paramtext"><i>On exit</i>: the diagonal elements of the bidiagonal matrix <m:math><m:mi>B</m:mi></m:math>.</div>
</dd><dt class="paramhead"><a name="E" id="E"/>10: &#8194; E(<m:math><m:mrow><m:mi>min</m:mi><m:mspace width="0.125em"/><m:mfenced separators=""><m:maction actiontype="link" dsi:type="simple" dsi:href="#M"><m:mi mathcolor="#EE0000" mathvariant="bold">M</m:mi></m:maction><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:mo>-</m:mo><m:mn>1</m:mn></m:math>) &#8211; REAL&#160;(KIND=nag_wp)&#160;array<span class="pclass">Output</span></dt><dd><div class="paramtext"><i>On exit</i>: the superdiagonal elements of the bidiagonal matrix <m:math><m:mi>B</m:mi></m:math>.</div>
</dd><dt class="paramhead"><a name="Q" id="Q"/>11: &#8194; Q(<a class="arg" href="#LDQ">LDQ</a>,<m:math><m:mo>*</m:mo></m:math>) &#8211; REAL&#160;(KIND=nag_wp)&#160;array<span class="pclass">Output</span></dt><dd>
<div class="paramtext"><b>Note:</b> the second dimension of the array <a class="arg" href="#Q">Q</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="#M"><m:mi mathcolor="#EE0000" mathvariant="bold">M</m:mi></m:maction></m:mfenced></m:mrow></m:math>&#160;if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#VECT"><m:mi mathcolor="#EE0000" mathvariant="bold">VECT</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'Q'</m:mtext></m:math>&#160;or <m:math><m:mtext>'B'</m:mtext></m:math>, and at least <m:math><m:mn>1</m:mn></m:math>&#160;otherwise.</div>
<div class="paramtext"><i>On exit</i>: if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#VECT"><m:mi mathcolor="#EE0000" mathvariant="bold">VECT</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'Q'</m:mtext></m:math>&#160;or <m:math><m:mtext>'B'</m:mtext></m:math>, contains the <m:math><m:mi>m</m:mi></m:math>&#160;by <m:math><m:mi>m</m:mi></m:math>&#160;orthogonal
matrix <m:math><m:mi>Q</m:mi></m:math>.
<div class="paramtext">If <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#VECT"><m:mi mathcolor="#EE0000" mathvariant="bold">VECT</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'N'</m:mtext></m:math>&#160;or <m:math><m:mtext>'P'</m:mtext></m:math>, <a class="arg" href="#Q">Q</a> is not referenced.</div>
</div>
</dd><dt class="paramhead"><a name="LDQ" id="LDQ"/>12: &#8194; LDQ &#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="#Q">Q</a> as declared in the (sub)program from which F08LEF (DGBBRD) is called.</div><div class="paramtext"><i>Constraints</i>:
   <div class="paramtext"/><ul class="listcons">
<li class="listcons">if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#VECT"><m:mi mathcolor="#EE0000" mathvariant="bold">VECT</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'Q'</m:mtext></m:math>&#160;or <m:math><m:mtext>'B'</m:mtext></m:math>, <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#LDQ"><m:mi mathcolor="#EE0000" mathvariant="bold">LDQ</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="#M"><m:mi mathcolor="#EE0000" mathvariant="bold">M</m:mi></m:maction></m:mfenced></m:mrow></m:math>;</li>
<li class="listcons">otherwise <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#LDQ"><m:mi mathcolor="#EE0000" mathvariant="bold">LDQ</m:mi></m:maction><m:mo>&#8805;</m:mo><m:mn>1</m:mn></m:math>.</li>
</ul></div>
</dd><dt class="paramhead"><a name="PT" id="PT"/>13: &#8194; PT(<a class="arg" href="#LDPT">LDPT</a>,<m:math><m:mo>*</m:mo></m:math>) &#8211; REAL&#160;(KIND=nag_wp)&#160;array<span class="pclass">Output</span></dt><dd>
<div class="paramtext"><b>Note:</b> the second dimension of the array <a class="arg" href="#PT">PT</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>&#160;if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#VECT"><m:mi mathcolor="#EE0000" mathvariant="bold">VECT</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'P'</m:mtext></m:math>&#160;or <m:math><m:mtext>'B'</m:mtext></m:math>, and at least <m:math><m:mn>1</m:mn></m:math>&#160;otherwise.</div>
<div class="paramtext"><i>On exit</i>: the <m:math><m:mi>n</m:mi></m:math>&#160;by <m:math><m:mi>n</m:mi></m:math>&#160;orthogonal
matrix
<m:math><m:msup><m:mi>P</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup></m:math>, if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#VECT"><m:mi mathcolor="#EE0000" mathvariant="bold">VECT</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'P'</m:mtext></m:math>&#160;or <m:math><m:mtext>'B'</m:mtext></m:math>. If <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#VECT"><m:mi mathcolor="#EE0000" mathvariant="bold">VECT</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'N'</m:mtext></m:math>&#160;or <m:math><m:mtext>'Q'</m:mtext></m:math>, <a class="arg" href="#PT">PT</a> is not referenced.</div>
</dd><dt class="paramhead"><a name="LDPT" id="LDPT"/>14: &#8194; LDPT &#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="#PT">PT</a> as declared in the (sub)program from which F08LEF (DGBBRD) is called.</div><div class="paramtext"><i>Constraints</i>:
   <div class="paramtext"/><ul class="listcons">
<li class="listcons">if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#VECT"><m:mi mathcolor="#EE0000" mathvariant="bold">VECT</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'P'</m:mtext></m:math>&#160;or <m:math><m:mtext>'B'</m:mtext></m:math>, <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#LDPT"><m:mi mathcolor="#EE0000" mathvariant="bold">LDPT</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>;</li>
<li class="listcons">otherwise <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#LDPT"><m:mi mathcolor="#EE0000" mathvariant="bold">LDPT</m:mi></m:maction><m:mo>&#8805;</m:mo><m:mn>1</m:mn></m:math>.</li>
</ul></div>
</dd><dt class="paramhead"><a name="C" id="C"/>15: &#8194; C(<a class="arg" href="#LDC">LDC</a>,<m:math><m:mo>*</m:mo></m:math>) &#8211; REAL&#160;(KIND=nag_wp)&#160;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="#C">C</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="#NCC"><m:mi mathcolor="#EE0000" mathvariant="bold">NCC</m:mi></m:maction></m:mfenced></m:mrow></m:math>.</div>
<div class="paramtext"><i>On entry</i>: an <m:math><m:mi>m</m:mi></m:math>&#160;by <m:math><m:msub><m:mi>n</m:mi><m:mi>C</m:mi></m:msub></m:math>&#160;matrix <m:math><m:mi>C</m:mi></m:math>.</div>
<div class="paramtext"><i>On exit</i>: <a class="arg" href="#C">C</a> is overwritten by <m:math><m:msup><m:mi>Q</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup><m:mi>C</m:mi></m:math>. If <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#NCC"><m:mi mathcolor="#EE0000" mathvariant="bold">NCC</m:mi></m:maction><m:mo>=</m:mo><m:mn>0</m:mn></m:math>, <a class="arg" href="#C">C</a> is not referenced.
</div>
</dd><dt class="paramhead"><a name="LDC" id="LDC"/>16: &#8194; LDC &#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="#C">C</a> as declared in the (sub)program from which F08LEF (DGBBRD) is called.</div><div class="paramtext"><i>Constraints</i>:
   <div class="paramtext"/><ul class="listcons">
<li class="listcons">if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#NCC"><m:mi mathcolor="#EE0000" mathvariant="bold">NCC</m:mi></m:maction><m:mo>&gt;</m:mo><m:mn>0</m:mn></m:math>, <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#LDC"><m:mi mathcolor="#EE0000" mathvariant="bold">LDC</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="#M"><m:mi mathcolor="#EE0000" mathvariant="bold">M</m:mi></m:maction></m:mfenced></m:mrow></m:math>;</li>
<li class="listcons">if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#NCC"><m:mi mathcolor="#EE0000" mathvariant="bold">NCC</m:mi></m:maction><m:mo>=</m:mo><m:mn>0</m:mn></m:math>, <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#LDC"><m:mi mathcolor="#EE0000" mathvariant="bold">LDC</m:mi></m:maction><m:mo>&#8805;</m:mo><m:mn>1</m:mn></m:math>.</li>
</ul></div>
</dd><dt class="paramhead"><a name="WORK" id="WORK"/>17: &#8194; WORK(<m:math><m:mn>2</m:mn><m:mo>&#215;</m:mo><m:mrow><m:mi>max</m:mi><m:mspace width="0.125em"/><m:mfenced separators=""><m:maction actiontype="link" dsi:type="simple" dsi:href="#M"><m:mi mathcolor="#EE0000" mathvariant="bold">M</m:mi></m:maction><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>) &#8211; REAL&#160;(KIND=nag_wp)&#160;array<span class="pclass">Workspace</span></dt><dt class="paramhead"><a name="INFO" id="INFO"/>18: &#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><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>, argument <m:math><m:mi>i</m:mi></m:math>&#160;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 bidiagonal form <m:math><m:mi>B</m:mi></m:math>&#160;satisfies <m:math><m:mi>Q</m:mi><m:mi>B</m:mi><m:msup><m:mi>P</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup><m:mo>=</m:mo><m:mi>A</m:mi><m:mo>+</m:mo><m:mi>E</m:mi></m:math>, where

<div class="formula"><table class="formula"><tr><td class="formula"><m:math display="block">
 <m:msub><m:mfenced open="&#8214;" close="&#8214;" separators=""><m:mi>E</m:mi></m:mfenced><m:mn>2</m:mn></m:msub>
 <m:mo>&#8804;</m:mo>
 <m:mi>c</m:mi>
 <m:mfenced separators=""><m:mi>n</m:mi></m:mfenced>
 <m:mi>&#949;</m:mi>
 <m:msub><m:mfenced open="&#8214;" close="&#8214;" separators=""><m:mi>A</m:mi></m:mfenced><m:mn>2</m:mn></m:msub>
 <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>n</m:mi></m:mfenced></m:math>&#160;is a modestly increasing function of <m:math><m:mi>n</m:mi></m:math>, and <m:math><m:mi>&#949;</m:mi></m:math>&#160;is the <span class="bitalic">machine precision</span>.</div><div class="paramtext">The elements of <m:math><m:mi>B</m:mi></m:math>&#160;themselves may be sensitive to small perturbations in <m:math><m:mi>A</m:mi></m:math>&#160;or to rounding errors in the computation, but this does not affect the stability of the singular values and vectors.</div><div class="paramtext">The computed matrix <m:math><m:mi>Q</m:mi></m:math>&#160;differs from an exactly orthogonal matrix by a matrix <m:math><m:mi>F</m:mi></m:math>&#160;such that

<div class="formula"><table class="formula"><tr><td class="formula"><m:math display="block">
 <m:msub><m:mfenced open="&#8214;" close="&#8214;" separators=""><m:mi>F</m:mi></m:mfenced><m:mn>2</m:mn></m:msub>
 <m:mo>=</m:mo>
 <m:mrow><m:mi mathvariant="italic">O</m:mi><m:mfenced separators=""><m:mi>&#949;</m:mi></m:mfenced></m:mrow>
 <m:mtext>.</m:mtext>
</m:math></td><td class="formula2"/></tr></table></div>

A similar statement holds for the computed matrix <m:math><m:msup><m:mi>P</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup></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 real floating point operations is approximately the sum of:
<ul class="listind"><li class="listind"><m:math><m:mn>6</m:mn><m:msup><m:mi>n</m:mi><m:mn>2</m:mn></m:msup><m:mi>k</m:mi></m:math>, if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#VECT"><m:mi mathcolor="#EE0000" mathvariant="bold">VECT</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'N'</m:mtext></m:math>&#160;and <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#NCC"><m:mi mathcolor="#EE0000" mathvariant="bold">NCC</m:mi></m:maction><m:mo>=</m:mo><m:mn>0</m:mn></m:math>, and</li><li class="listind"><m:math><m:mn>3</m:mn><m:msup><m:mi>n</m:mi><m:mn>2</m:mn></m:msup><m:msub><m:mi>n</m:mi><m:mi>C</m:mi></m:msub><m:mfenced separators=""><m:mi>k</m:mi><m:mo>-</m:mo><m:mn>1</m:mn></m:mfenced><m:mo>/</m:mo><m:mi>k</m:mi></m:math>, if <m:math><m:mi>C</m:mi></m:math>&#160;is updated, and</li><li class="listind"><m:math><m:mn>3</m:mn><m:msup><m:mi>n</m:mi><m:mn>3</m:mn></m:msup><m:mfenced separators=""><m:mi>k</m:mi><m:mo>-</m:mo><m:mn>1</m:mn></m:mfenced><m:mo>/</m:mo><m:mi>k</m:mi></m:math>, if either <m:math><m:mi>Q</m:mi></m:math>&#160;or <m:math><m:msup><m:mi>P</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup></m:math>&#160;is generated (double this if both),</li></ul>
where <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:math>, assuming <m:math><m:mi>n</m:mi><m:mo>&#8811;</m:mo><m:mi>k</m:mi></m:math>.  For this section we assume that <m:math><m:mi>m</m:mi><m:mo>=</m:mo><m:mi>n</m:mi></m:math>.</div><div class="paramtext">The complex analogue of this routine is <a class="rout" href="../F08/f08lsf.xml">F08LSF (ZGBBRD)</a>.</div><h2 class="standard"><a class="sec" name="example" id="example"/>9&#160;&#160;Example</h2>
<div class="paramtext">This example reduces the matrix <m:math><m:mi>A</m:mi></m:math>&#160;to upper bidiagonal form, 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 columnalign="right">
<m:mtr>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>0.57</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>1.28</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mn>0.00</m:mn></m:mtd>
   <m:mtd><m:mn>0.00</m:mn></m:mtd>
</m:mtr><m:mtr>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>1.93</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mn>1.08</m:mn></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>0.31</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mn>0.00</m:mn></m:mtd>
</m:mtr><m:mtr>
   <m:mtd><m:mn>2.30</m:mn></m:mtd>
   <m:mtd><m:mn>0.24</m:mn></m:mtd>
   <m:mtd><m:mn>0.40</m:mn></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>0.35</m:mn></m:mrow></m:mtd>
</m:mtr><m:mtr>
   <m:mtd><m:mn>0.00</m:mn></m:mtd>
   <m:mtd><m:mn>0.64</m:mn></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>0.66</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mn>0.08</m:mn></m:mtd>
</m:mtr><m:mtr>
   <m:mtd><m:mn>0.00</m:mn></m:mtd>
   <m:mtd><m:mn>0.00</m:mn></m:mtd>
   <m:mtd><m:mn>0.15</m:mn></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>2.13</m:mn></m:mrow></m:mtd>
</m:mtr><m:mtr>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>0.00</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mn>0.00</m:mn></m:mtd>
   <m:mtd><m:mn>0.00</m:mn></m:mtd>
   <m:mtd><m:mn>0.50</m:mn></m:mtd>
</m:mtr>
</m:mtable></m:mfenced>
 <m:mtext>.</m:mtext>
</m:math></td><td class="formula2"/></tr></table></div></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/f08lefe.f90">Program Text (f08lefe.f90)</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/f08lefe.d">Program&#160;Data (f08lefe.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/f08lefe.r">Program Results (f08lefe.r)</a></p>
<hr/><div><a class="rout" href="../../pdf/F08/f08lef.pdf">F08LEF (DGBBRD) (PDF version)</a></div><div><a class="chap" href="f08conts.xml">F08 Chapter Contents</a></div><div><a class="chapint" href="f08intro.xml">F08 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. 2011</a></div></body></html>