<?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>F08QTF (ZTREXC) : 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/f08qtf.pdf">F08QTF (ZTREXC) (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/>F08QTF (ZTREXC)</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">F08QTF (ZTREXC) reorders the Schur factorization of a complex general matrix.</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;F08QTF&#160;(</td>
<td class="tdfspec2" valign="top" align="left"><a class="arg" href="#COMPQ">COMPQ</a>, <a class="arg" href="#N">N</a>, <a class="arg" href="#T">T</a>, <a class="arg" href="#LDT">LDT</a>, <a class="arg" href="#Q">Q</a>, <a class="arg" href="#LDQ">LDQ</a>, <a class="arg" href="#IFST">IFST</a>, <a class="arg" href="#ILST">ILST</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">N, LDT, LDQ, IFST, ILST, INFO</td>
</tr>
<tr>
<td class="tdfspec1" valign="top" align="left">COMPLEX&#160;(KIND=nag_wp)&#160;</td>
<td class="tdfspec2" valign="top" align="left">T(LDT,*), Q(LDQ,*)</td>
</tr><tr>
<td class="tdfspec1" valign="top" align="left">CHARACTER(1)&#160;</td>
<td class="tdfspec2" valign="top" align="left">COMPQ</td></tr>
</tbody>
</table></div>
</td></tr></table>
<div class="paramtext">The routine may be called by its 
    LAPACK
    name <span class="bitalic">ztrexc</span>.</div><h2 class="standard"><a class="sec" name="description" id="description"/>3&#160;&#160;Description</h2>
<div class="paramtext">F08QTF (ZTREXC) reorders the Schur factorization of a complex general matrix <m:math><m:mi>A</m:mi><m:mo>=</m:mo><m:mi>Q</m:mi><m:mi>T</m:mi><m:msup><m:mi>Q</m:mi><m:mi mathvariant="normal">H</m:mi></m:msup></m:math>, so that the diagonal element of <m:math><m:mi>T</m:mi></m:math>&#160;with row index <a class="arg" href="#IFST">IFST</a> is moved to row <a class="arg" href="#ILST">ILST</a>.</div><div class="paramtext">The reordered Schur form <m:math><m:mover><m:mi>T</m:mi><m:mo>~</m:mo></m:mover></m:math>&#160;is computed by a unitary similarity transformation: <m:math><m:mover><m:mi>T</m:mi><m:mo>~</m:mo></m:mover><m:mo>=</m:mo><m:msup><m:mi>Z</m:mi><m:mi mathvariant="normal">H</m:mi></m:msup><m:mi>T</m:mi><m:mi>Z</m:mi></m:math>.  Optionally the updated matrix <m:math><m:mover><m:mi>Q</m:mi><m:mo>~</m:mo></m:mover></m:math>&#160;of Schur vectors is computed as <m:math><m:mover><m:mi>Q</m:mi><m:mo>~</m:mo></m:mover><m:mo>=</m:mo><m:mi>Q</m:mi><m:mi>Z</m:mi></m:math>, giving <m:math><m:mi>A</m:mi><m:mo>=</m:mo><m:mover><m:mi>Q</m:mi><m:mo>~</m:mo></m:mover><m:mover><m:mi>T</m:mi><m:mo>~</m:mo></m:mover><m:msup><m:mover><m:mi>Q</m:mi><m:mo>~</m:mo></m:mover><m:mi mathvariant="normal">H</m:mi></m:msup></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="COMPQ" id="COMPQ"/>1: &#160;&#160;&#8194; COMPQ &#8211; CHARACTER(1)<span class="pclass">Input</span></dt><dd>
<div class="paramtext"><i>On entry</i>: indicates whether the matrix <m:math><m:mi>Q</m:mi></m:math>&#160;of Schur vectors is to be updated.

<dl>
<dt class="paramval"><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#COMPQ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPQ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'V'</m:mtext></m:math></dt>
<dd>The matrix <m:math><m:mi>Q</m:mi></m:math>&#160;of Schur vectors is updated.</dd>
<dt class="paramval"><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#COMPQ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPQ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'N'</m:mtext></m:math></dt>
<dd>No Schur vectors are updated.</dd></dl>
</div><div class="paramtext"><i>Constraint</i>:
  <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#COMPQ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPQ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'V'</m:mtext></m:math>&#160;or <m:math><m:mtext>'N'</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>T</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="T" id="T"/>3: &#160;&#160;&#8194; T(<a class="arg" href="#LDT">LDT</a>,<m:math><m:mo>*</m:mo></m:math>) &#8211; COMPLEX&#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="#T">T</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>n</m:mi></m:math>&#160;by <m:math><m:mi>n</m:mi></m:math>&#160;upper triangular matrix <m:math><m:mi>T</m:mi></m:math>, as returned by <a class="rout" href="../F08/f08psf.xml">F08PSF (ZHSEQR)</a>.</div>
<div class="paramtext"><i>On exit</i>: <a class="arg" href="#T">T</a> is overwritten by the updated matrix <m:math><m:mover><m:mi>T</m:mi><m:mo>~</m:mo></m:mover></m:math>.</div>
</dd><dt class="paramhead"><a name="LDT" id="LDT"/>4: &#160;&#160;&#8194; LDT &#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="#T">T</a> as declared in the (sub)program from which F08QTF (ZTREXC) is called.</div><div class="paramtext"><i>Constraint</i>:
  <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#LDT"><m:mi mathcolor="#EE0000" mathvariant="bold">LDT</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="Q" id="Q"/>5: &#160;&#160;&#8194; Q(<a class="arg" href="#LDQ">LDQ</a>,<m:math><m:mo>*</m:mo></m:math>) &#8211; COMPLEX&#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="#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="#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="#COMPQ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPQ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'V'</m:mtext></m:math>&#160;and at least <m:math><m:mn>1</m:mn></m:math>&#160;if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#COMPQ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPQ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'N'</m:mtext></m:math>.</div>
<div class="paramtext"><i>On entry</i>: if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#COMPQ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPQ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'V'</m:mtext></m:math>, <a class="arg" href="#Q">Q</a> must contain the <m:math><m:mi>n</m:mi></m:math>&#160;by <m:math><m:mi>n</m:mi></m:math>&#160;unitary
matrix <m:math><m:mi>Q</m:mi></m:math>&#160;of Schur vectors.</div>
<div class="paramtext"><i>On exit</i>: if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#COMPQ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPQ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'V'</m:mtext></m:math>, <a class="arg" href="#Q">Q</a> contains the updated matrix of Schur vectors.
<div class="paramtext">If <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#COMPQ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPQ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'N'</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"/>6: &#160;&#160;&#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 F08QTF (ZTREXC) 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="#COMPQ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPQ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'V'</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="#N"><m:mi mathcolor="#EE0000" mathvariant="bold">N</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="#COMPQ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPQ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'N'</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:mn>1</m:mn></m:math>.</li>
</ul></div>
</dd><dt class="paramhead"><a name="IFST" id="IFST"/>7: &#160;&#160;&#8194; IFST &#8211; INTEGER<span class="pclass">Input</span></dt><dt class="multi-paramhead"><a name="ILST" id="ILST"/>8: &#160;&#160;&#8194; ILST &#8211; INTEGER<span class="pclass">Input</span></dt><dd>
<div class="paramtext"><i>On entry</i>: <a class="arg" href="#IFST">IFST</a> and <a class="arg" href="#ILST">ILST</a> must specify the reordering of the diagonal elements of <m:math><m:mi>T</m:mi></m:math>. The element with row index <a class="arg" href="#IFST">IFST</a> is moved to row <a class="arg" href="#ILST">ILST</a> by a sequence of exchanges between adjacent elements.</div><div class="paramtext"><i>Constraint</i>:
  <m:math><m:mn>1</m:mn><m:mo>&#8804;</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#IFST"><m:mi mathcolor="#EE0000" mathvariant="bold">IFST</m:mi></m:maction><m:mo>&#8804;</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>&#160;and <m:math><m:mn>1</m:mn><m:mo>&#8804;</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#ILST"><m:mi mathcolor="#EE0000" mathvariant="bold">ILST</m:mi></m:maction><m:mo>&#8804;</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>.
</div>
</dd><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><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 matrix <m:math><m:mover><m:mi>T</m:mi><m:mo>~</m:mo></m:mover></m:math>&#160;is exactly similar to a matrix <m:math><m:mfenced separators=""><m:mi>T</m:mi><m:mo>+</m:mo><m:mi>E</m:mi></m:mfenced></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>=</m:mo>
 <m:mrow><m:mi mathvariant="italic">O</m:mi><m:mfenced separators=""><m:mi>&#949;</m:mi></m:mfenced></m:mrow>
 <m:msub><m:mfenced open="&#8214;" close="&#8214;" separators=""><m:mi>T</m:mi></m:mfenced><m:mn>2</m:mn></m:msub>
 <m:mtext>,</m:mtext>
</m:math></td><td class="formula2"/></tr></table></div>

and <m:math><m:mi>&#949;</m:mi></m:math>&#160;is the <span class="bitalic">machine precision</span>.</div><div class="paramtext">The values of the eigenvalues are never changed by the reordering.</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 <m:math><m:mn>20</m:mn><m:mi>n</m:mi><m:mi>r</m:mi></m:math>&#160;if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#COMPQ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPQ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'N'</m:mtext></m:math>, and <m:math><m:mn>40</m:mn><m:mi>n</m:mi><m:mi>r</m:mi></m:math>&#160;if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#COMPQ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPQ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'V'</m:mtext></m:math>, where <m:math><m:mi>r</m:mi><m:mo>=</m:mo><m:mfenced open="|" close="|" separators=""><m:maction actiontype="link" dsi:type="simple" dsi:href="#IFST"><m:mi mathcolor="#EE0000" mathvariant="bold">IFST</m:mi></m:maction><m:mo>-</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#ILST"><m:mi mathcolor="#EE0000" mathvariant="bold">ILST</m:mi></m:maction></m:mfenced></m:math>.</div><div class="paramtext">The real analogue of this routine is <a class="rout" href="../F08/f08qff.xml">F08QFF (DTREXC)</a>.</div><h2 class="standard"><a class="sec" name="example" id="example"/>9&#160;&#160;Example</h2>
<div class="paramtext">This example reorders the Schur factorization of the matrix <m:math><m:mi>T</m:mi></m:math>&#160;so that element <m:math><m:msub><m:mi>t</m:mi><m:mn>11</m:mn></m:msub></m:math>&#160;is moved to <m:math><m:msub><m:mi>t</m:mi><m:mn>44</m:mn></m:msub></m:math>, where

<div class="formula"><table class="formula"><tr><td class="formula"><m:math display="block">
 <m:mi>T</m:mi>
 <m:mo>=</m:mo>
 <m:mfenced><m:mtable columnalign="right">
<m:mtr>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>6.00</m:mn></m:mrow><m:mo>-</m:mo><m:mn>7.00</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mn>0.36</m:mn><m:mo>-</m:mo><m:mn>0.36</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>0.19</m:mn></m:mrow><m:mo>+</m:mo><m:mn>0.48</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mn>0.88</m:mn><m:mo>-</m:mo><m:mn>0.25</m:mn><m:mi>i</m:mi></m:mtd>
</m:mtr><m:mtr>
   <m:mtd><m:mn>0.00</m:mn><m:mo>+</m:mo><m:mn>0.00</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>5.00</m:mn></m:mrow><m:mo>+</m:mo><m:mn>2.00</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>0.03</m:mn></m:mrow><m:mo>-</m:mo><m:mn>0.72</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>0.23</m:mn></m:mrow><m:mo>+</m:mo><m:mn>0.13</m:mn><m:mi>i</m:mi></m:mtd>
</m:mtr><m:mtr>
   <m:mtd><m:mn>0.00</m:mn><m:mo>+</m:mo><m:mn>0.00</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mn>0.00</m:mn><m:mo>+</m:mo><m:mn>0.00</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mn>8.00</m:mn><m:mo>-</m:mo><m:mn>1.00</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mn>0.94</m:mn><m:mo>+</m:mo><m:mn>0.53</m:mn><m:mi>i</m:mi></m:mtd>
</m:mtr><m:mtr>
   <m:mtd><m:mn>0.00</m:mn><m:mo>+</m:mo><m:mn>0.00</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mn>0.00</m:mn><m:mo>+</m:mo><m:mn>0.00</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mn>0.00</m:mn><m:mo>+</m:mo><m:mn>0.00</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mn>3.00</m:mn><m:mo>-</m:mo><m:mn>4.00</m:mn><m:mi>i</m:mi></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/f08qtfe.f90">Program Text (f08qtfe.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/f08qtfe.d">Program&#160;Data (f08qtfe.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/f08qtfe.r">Program Results (f08qtfe.r)</a></p>
<hr/><div><a class="rout" href="../../pdf/F08/f08qtf.pdf">F08QTF (ZTREXC) (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>