<?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>F08JUF (ZPTEQR) : 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/f08juf.pdf">F08JUF (ZPTEQR) (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/>F08JUF (ZPTEQR)</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="paramtext"><div class="header"><b>Warning.</b> The specification of the parameter <a class="arg" href="#WORK">WORK</a> changed at Mark 20: the length of <a class="arg" href="#WORK">WORK</a> needs to be increased.</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">F08JUF (ZPTEQR) computes all the eigenvalues and, optionally, all the eigenvectors of a complex Hermitian positive definite matrix which has been reduced to tridiagonal 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;F08JUF&#160;(</td>
<td class="tdfspec2" valign="top" align="left"><a class="arg" href="#COMPZ">COMPZ</a>, <a class="arg" href="#N">N</a>, <a class="arg" href="#D">D</a>, <a class="arg" href="#E">E</a>, <a class="arg" href="#Z">Z</a>, <a class="arg" href="#LDZ">LDZ</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">N, LDZ, 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">D(*), E(*), WORK(4*N)</td>
</tr>
<tr>
<td class="tdfspec1" valign="top" align="left">COMPLEX&#160;(KIND=nag_wp)&#160;</td>
<td class="tdfspec2" valign="top" align="left">Z(LDZ,*)</td>
</tr><tr>
<td class="tdfspec1" valign="top" align="left">CHARACTER(1)&#160;</td>
<td class="tdfspec2" valign="top" align="left">COMPZ</td></tr>
</tbody>
</table></div>
</td></tr></table>
<div class="paramtext">The routine may be called by its 
    LAPACK
    name <span class="bitalic">zpteqr</span>.</div><h2 class="standard"><a class="sec" name="description" id="description"/>3&#160;&#160;Description</h2>
<div class="paramtext">F08JUF (ZPTEQR) computes all the eigenvalues and, optionally, all the eigenvectors of a real symmetric positive definite tridiagonal matrix <m:math><m:mi>T</m:mi></m:math>.  
In other words, it can compute the spectral factorization of <m:math><m:mi>T</m:mi></m:math>&#160;as

<div class="formula"><table class="formula"><tr><td class="formula"><m:math display="block">
<m:mi>T</m:mi><m:mo>=</m:mo><m:mi>Z</m:mi><m:mi>&#923;</m:mi><m:msup><m:mi>Z</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup><m:mtext>,</m:mtext>
</m:math></td><td class="formula2"/></tr></table></div>

where <m:math><m:mi>&#923;</m:mi></m:math>&#160;is a diagonal matrix whose diagonal elements are the eigenvalues <m:math><m:msub><m:mi>&#955;</m:mi><m:mi>i</m:mi></m:msub></m:math>, and <m:math><m:mi>Z</m:mi></m:math>&#160;is the orthogonal matrix whose columns are the eigenvectors <m:math><m:msub><m:mi>z</m:mi><m:mi>i</m:mi></m:msub></m:math>.  Thus

<div class="formula"><table class="formula"><tr><td class="formula"><m:math display="block">
<m:mi>T</m:mi><m:msub><m:mi>z</m:mi><m:mi>i</m:mi></m:msub><m:mo>=</m:mo><m:msub><m:mi>&#955;</m:mi><m:mi>i</m:mi></m:msub><m:msub><m:mi>z</m:mi><m:mi>i</m:mi></m:msub><m:mtext>, &#8195;</m:mtext><m:mi>i</m:mi><m:mo>=</m:mo><m:mn>1</m:mn><m:mo>,</m:mo><m:mn>2</m:mn><m:mo>,</m:mo><m:mo>&#8230;</m:mo><m:mo>,</m:mo><m:mi>n</m:mi><m:mtext>.</m:mtext>
</m:math></td><td class="formula2"/></tr></table></div></div><div class="paramtext">The routine stores the real orthogonal matrix <m:math><m:mi>Z</m:mi></m:math>&#160;in a complex array, so that it may be used to compute all the eigenvalues and eigenvectors of a complex Hermitian positive definite matrix <m:math><m:mi>A</m:mi></m:math>&#160;which has been reduced to tridiagonal form <m:math><m:mi>T</m:mi></m:math>:

<div class="formula"><table class="formula"><tr><td class="formula"><m:math display="block">
 <m:mtable columnalign="left">
 <m:mtr>
  <m:mtd><m:mi>A</m:mi></m:mtd>
  <m:mtd><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:mtext>, where &#8203;</m:mtext><m:mi>Q</m:mi><m:mtext>&#8203; is unitary</m:mtext></m:mtd>
 </m:mtr><m:mtr>
  <m:mtd/>
  <m:mtd><m:mo>=</m:mo><m:mfenced separators=""><m:mi>Q</m:mi><m:mi>Z</m:mi></m:mfenced><m:mi>&#923;</m:mi><m:msup><m:mfenced separators=""><m:mi>Q</m:mi><m:mi>Z</m:mi></m:mfenced><m:mi mathvariant="normal">H</m:mi></m:msup><m:mtext>.</m:mtext></m:mtd>
 </m:mtr>
</m:mtable>
</m:math></td><td class="formula2"/></tr></table></div></div><div class="paramtext">In this case, the matrix <m:math><m:mi>Q</m:mi></m:math>&#160;must be formed explicitly and passed to F08JUF (ZPTEQR), which must be called with <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#COMPZ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPZ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'V'</m:mtext></m:math>.  The routines which must be called to perform the reduction to tridiagonal form and form <m:math><m:mi>Q</m:mi></m:math>&#160;are:
<div class="tablediv"><table class="frame-none" align="center">
  
  
  <tbody>
   <tr>
    <td class="libdoc" valign="top">full matrix</td>
    <td class="libdoc" valign="top"><a class="rout" href="../F08/f08fsf.xml">F08FSF (ZHETRD)</a> and <a class="rout" href="../F08/f08ftf.xml">F08FTF (ZUNGTR)</a></td>
   </tr><tr>
    <td class="libdoc" valign="top">full matrix, packed storage</td>
    <td class="libdoc" valign="top"><a class="rout" href="../F08/f08gsf.xml">F08GSF (ZHPTRD)</a> and <a class="rout" href="../F08/f08gtf.xml">F08GTF (ZUPGTR)</a></td>
   </tr><tr>
    <td class="libdoc" valign="top">band matrix</td>
    <td class="libdoc" valign="top"><a class="rout" href="../F08/f08hsf.xml">F08HSF (ZHBTRD)</a> with <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="../F08/f08hsf.xml#VECT"><m:mi mathcolor="#EE0000" mathvariant="bold">VECT</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'V'</m:mtext></m:math>.</td>
   </tr>
  </tbody>
 </table></div>
</div><div class="paramtext">F08JUF (ZPTEQR) first factorizes <m:math><m:mi>T</m:mi></m:math>&#160;as <m:math><m:mi>L</m:mi><m:mi>D</m:mi><m:msup><m:mi>L</m:mi><m:mi mathvariant="normal">H</m:mi></m:msup></m:math>&#160;where <m:math><m:mi>L</m:mi></m:math>&#160;is unit lower bidiagonal and <m:math><m:mi>D</m:mi></m:math>&#160;is diagonal.  It forms the bidiagonal matrix <m:math><m:mi>B</m:mi><m:mo>=</m:mo><m:mi>L</m:mi><m:msup><m:mi>D</m:mi><m:mfrac><m:mn>1</m:mn><m:mn>2</m:mn></m:mfrac></m:msup></m:math>, and then calls <a class="rout" href="../F08/f08msf.xml">F08MSF (ZBDSQR)</a> to compute the singular values of <m:math><m:mi>B</m:mi></m:math>&#160;which are the same as the eigenvalues of <m:math><m:mi>T</m:mi></m:math>.  The method used by the routine allows high relative accuracy to be achieved in the small eigenvalues of <m:math><m:mi>T</m:mi></m:math>.  The eigenvectors are normalized so that <m:math><m:msub><m:mfenced open="&#8214;" close="&#8214;" separators=""><m:msub><m:mi>z</m:mi><m:mi>i</m:mi></m:msub></m:mfenced><m:mn>2</m:mn></m:msub><m:mo>=</m:mo><m:mn>1</m:mn></m:math>, but are determined only to within a complex factor of absolute value <m:math><m:mn>1</m:mn></m:math>.</div><h2 class="standard"><a class="sec" name="references" id="references"/>4&#160;&#160;References</h2><div class="paramtext"><a name="ref451" id="ref451"/>Barlow J and Demmel J W (1990)  Computing accurate eigensystems of scaled diagonally dominant matrices <i>SIAM J. Numer. Anal.</i> <b>27</b> 762&#8211;791 </div><h2 class="standard"><a class="sec" name="parameters" id="parameters"/>5&#160;&#160;Parameters</h2>
<dl><dt class="paramhead"><a name="COMPZ" id="COMPZ"/>1: &#160;&#160;&#8194; COMPZ &#8211; CHARACTER(1)<span class="pclass">Input</span></dt><dd>
<div class="paramtext"><i>On entry</i>: indicates whether the
eigenvectors
are to be computed.

<dl>
<dt class="paramval"><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#COMPZ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPZ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'N'</m:mtext></m:math></dt>
<dd>Only the eigenvalues
are computed (and the array <a class="arg" href="#Z">Z</a> is not referenced).</dd>
<dt class="paramval"><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#COMPZ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPZ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'I'</m:mtext></m:math></dt>
<dd>The
eigenvalues and eigenvectors of <m:math><m:mi>T</m:mi></m:math>&#160;are computed (and the array <a class="arg" href="#Z">Z</a> is initialized by the routine).</dd>
<dt class="paramval"><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#COMPZ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPZ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'V'</m:mtext></m:math></dt>
<dd>The
eigenvalues and eigenvectors
of <m:math><m:mi>A</m:mi></m:math>&#160;are computed (and the array <a class="arg" href="#Z">Z</a> must contain the matrix <m:math><m:mi>Q</m:mi></m:math>&#160;on entry).</dd></dl>
</div><div class="paramtext"><i>Constraint</i>:
  <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#COMPZ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPZ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'N'</m:mtext></m:math>, <m:math><m:mtext>'V'</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>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="D" id="D"/>3: &#160;&#160;&#8194; D(<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 dimension of the array <a class="arg" href="#D">D</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 diagonal elements of the tridiagonal matrix <m:math><m:mi>T</m:mi></m:math>.</div>
<div class="paramtext"><i>On exit</i>: the <m:math><m:mi>n</m:mi></m:math>&#160;eigenvalues in descending order, unless <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>&gt;</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#errors"><m:mn mathcolor="#003399" mathvariant="bold">0</m:mn></m:maction></m:math>, in which case <a class="arg" href="#D">D</a> is overwritten.</div>
</dd><dt class="paramhead"><a name="E" id="E"/>4: &#160;&#160;&#8194; E(<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 dimension of the array <a class="arg" href="#E">E</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:mrow><m:maction actiontype="link" dsi:type="simple" dsi:href="#N"><m:mi mathcolor="#EE0000" mathvariant="bold">N</m:mi></m:maction><m:mo>-</m:mo><m:mn>1</m:mn></m:mrow></m:mfenced></m:mrow></m:math>.</div>
<div class="paramtext"><i>On entry</i>: the off-diagonal elements of the tridiagonal matrix <m:math><m:mi>T</m:mi></m:math>.</div>
<div class="paramtext"><i>On exit</i>: <a class="arg" href="#E">E</a> is overwritten.</div>
</dd><dt class="paramhead"><a name="Z" id="Z"/>5: &#160;&#160;&#8194; Z(<a class="arg" href="#LDZ">LDZ</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="#Z">Z</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="#COMPZ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPZ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'V'</m:mtext></m:math>&#160;or <m:math><m:mtext>'I'</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="#COMPZ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPZ</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="#COMPZ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPZ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'V'</m:mtext></m:math>, <a class="arg" href="#Z">Z</a> must contain the
unitary
matrix <m:math><m:mi>Q</m:mi></m:math>&#160;from the reduction to tridiagonal form.
<div class="paramtext">If <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#COMPZ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPZ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'I'</m:mtext></m:math>, <a class="arg" href="#Z">Z</a> need not be set.</div>
</div>
<div class="paramtext"><i>On exit</i>: if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#COMPZ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPZ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'I'</m:mtext></m:math>&#160;or <m:math><m:mtext>'V'</m:mtext></m:math>, the <m:math><m:mi>n</m:mi></m:math>&#160;required orthonormal eigenvectors stored as columns of <m:math><m:mi>Z</m:mi></m:math>; the <m:math><m:mi>i</m:mi></m:math>th column corresponds to the <m:math><m:mi>i</m:mi></m:math>th eigenvalue, where <m:math><m:mi>i</m:mi><m:mo>=</m:mo><m:mn>1</m:mn><m:mo>,</m:mo><m:mn>2</m:mn><m:mo>,</m:mo><m:mo>&#8230;</m:mo><m:mo>,</m:mo><m:mi>n</m:mi></m:math>, unless <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>&gt;</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#errors"><m:mn mathcolor="#003399" mathvariant="bold">0</m:mn></m:maction></m:math>.
<div class="paramtext">If <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#COMPZ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPZ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'N'</m:mtext></m:math>, <a class="arg" href="#Z">Z</a> is not referenced.</div></div>
</dd><dt class="paramhead"><a name="LDZ" id="LDZ"/>6: &#160;&#160;&#8194; LDZ &#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="#Z">Z</a> as declared in the (sub)program from which F08JUF (ZPTEQR) 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="#COMPZ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPZ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'V'</m:mtext></m:math>&#160;or <m:math><m:mtext>'I'</m:mtext></m:math>, <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#LDZ"><m:mi mathcolor="#EE0000" mathvariant="bold">LDZ</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="#COMPZ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPZ</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="#LDZ"><m:mi mathcolor="#EE0000" mathvariant="bold">LDZ</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"/>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; REAL&#160;(KIND=nag_wp)&#160;array<span class="pclass">Workspace</span></dt><dt class="paramhead"><a name="INFO" id="INFO"/>8: &#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>, 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><dl class="ifail">
<dt class="errorhead"><a name="INgt0" id="INgt0"/><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>&gt;</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:mi>i</m:mi></m:math>, the leading minor of order <m:math><m:mi>i</m:mi></m:math>&#160;is not positive definite and the Cholesky factorization of <m:math><m:mi>T</m:mi></m:math>&#160;could not be completed. Hence <m:math><m:mi>T</m:mi></m:math>&#160;itself is not positive definite.</div>
<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:maction actiontype="link" dsi:type="simple" dsi:href="#N"><m:mi mathcolor="#EE0000" mathvariant="bold">N</m:mi></m:maction><m:mo>+</m:mo><m:mi>i</m:mi></m:math>, the algorithm to compute the singular values of the Cholesky factor <m:math><m:mi>B</m:mi></m:math>&#160;failed to converge; <m:math><m:mi>i</m:mi></m:math>&#160;off-diagonal elements did not converge to zero.</div></dd>
</dl><h2 class="standard"><a class="sec" name="accuracy" id="accuracy"/>7&#160;&#160;Accuracy</h2>
<div class="paramtext">The eigenvalues and eigenvectors of <m:math><m:mi>T</m:mi></m:math>&#160;are computed to high relative accuracy which means that if they vary widely in magnitude, then any small eigenvalues (and corresponding eigenvectors) will be computed more accurately than, for example, with the standard <m:math><m:mi>Q</m:mi><m:mi>R</m:mi></m:math>&#160;method.  However, the reduction to tridiagonal form (prior to calling the routine) may exclude the possibility of obtaining high relative accuracy in the small eigenvalues of the original matrix if its eigenvalues vary widely in magnitude.</div><div class="paramtext">To be more precise, let <m:math><m:mi>H</m:mi></m:math>&#160;be the tridiagonal matrix defined by <m:math><m:mi>H</m:mi><m:mo>=</m:mo><m:mi>D</m:mi><m:mi>T</m:mi><m:mi>D</m:mi></m:math>, where <m:math><m:mi>D</m:mi></m:math>&#160;is diagonal with <m:math>
 <m:msub><m:mi>d</m:mi><m:mrow><m:mi>i</m:mi><m:mi>i</m:mi></m:mrow></m:msub>
 <m:mo>=</m:mo>
 <m:msubsup>
  <m:mi>t</m:mi>
  <m:mrow><m:mi>i</m:mi><m:mi>i</m:mi></m:mrow>
  <m:mrow><m:mo>-</m:mo><m:mfrac other="small"><m:mn>1</m:mn><m:mn>2</m:mn></m:mfrac></m:mrow>
 </m:msubsup>
</m:math>, and <m:math>
 <m:msub><m:mi>h</m:mi><m:mrow><m:mi>i</m:mi><m:mi>i</m:mi></m:mrow></m:msub>
 <m:mo>=</m:mo>
 <m:mn>1</m:mn>
</m:math>&#160;for all <m:math><m:mi>i</m:mi></m:math>.  If <m:math><m:msub><m:mi>&#955;</m:mi><m:mi>i</m:mi></m:msub></m:math>&#160;is an exact eigenvalue of <m:math><m:mi>T</m:mi></m:math>&#160;and <m:math><m:msub><m:mover><m:mi>&#955;</m:mi><m:mo>~</m:mo></m:mover><m:mi>i</m:mi></m:msub></m:math>&#160;is the corresponding computed value, then

<div class="formula"><table class="formula"><tr><td class="formula"><m:math display="block">
 <m:mfenced open="|" close="|" separators="">
  <m:msub><m:mover><m:mi>&#955;</m:mi><m:mo>~</m:mo></m:mover><m:mi>i</m:mi></m:msub>
  <m:mo>-</m:mo>
  <m:msub><m:mi>&#955;</m:mi><m:mi>i</m:mi></m:msub>
 </m:mfenced>
 <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:mi>&#954;</m:mi><m:mn>2</m:mn></m:msub>
 <m:mfenced separators=""><m:mi>H</m:mi></m:mfenced>
 <m:msub><m:mi>&#955;</m:mi><m:mi>i</m:mi></m:msub>
</m:math></td><td class="formula2"/></tr></table></div>

where <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>, <m:math><m:mi>&#949;</m:mi></m:math>&#160;is the <span class="bitalic">machine precision</span>, and <m:math><m:msub><m:mi>&#954;</m:mi><m:mn>2</m:mn></m:msub><m:mfenced separators=""><m:mi>H</m:mi></m:mfenced></m:math>&#160;is the condition number of <m:math><m:mi>H</m:mi></m:math>&#160;with respect to inversion defined by: <m:math><m:msub><m:mi>&#954;</m:mi><m:mn>2</m:mn></m:msub><m:mfenced separators=""><m:mi>H</m:mi></m:mfenced><m:mo>=</m:mo><m:mfenced open="&#8214;" close="&#8214;" separators=""><m:mi>H</m:mi></m:mfenced><m:mo>&#183;</m:mo><m:mfenced open="&#8214;" close="&#8214;" separators=""><m:msup><m:mi>H</m:mi><m:mrow><m:mo>-</m:mo><m:mn>1</m:mn></m:mrow></m:msup></m:mfenced></m:math>.</div><div class="paramtext">If <m:math><m:msub><m:mi>z</m:mi><m:mi>i</m:mi></m:msub></m:math>&#160;is the corresponding exact eigenvector of <m:math><m:mi>T</m:mi></m:math>, and <m:math><m:msub><m:mover><m:mi>z</m:mi><m:mo>~</m:mo></m:mover><m:mi>i</m:mi></m:msub></m:math>&#160;is the corresponding computed eigenvector, then the angle <m:math><m:mi>&#952;</m:mi><m:mfenced separators=""><m:msub><m:mover><m:mi>z</m:mi><m:mo>~</m:mo></m:mover><m:mi>i</m:mi></m:msub><m:mo>,</m:mo><m:msub><m:mi>z</m:mi><m:mi>i</m:mi></m:msub></m:mfenced></m:math>&#160;between them is bounded as follows:

<div class="formula"><table class="formula"><tr><td class="formula"><m:math display="block">
 <m:mi>&#952;</m:mi>
 <m:mfenced separators=""><m:msub><m:mover><m:mi>z</m:mi><m:mo>~</m:mo></m:mover><m:mi>i</m:mi></m:msub><m:mo>,</m:mo><m:msub><m:mi>z</m:mi><m:mi>i</m:mi></m:msub></m:mfenced>
 <m:mo>&#8804;</m:mo>
 <m:mfrac>
  <m:mrow>
   <m:mi>c</m:mi>
   <m:mfenced separators=""><m:mi>n</m:mi></m:mfenced>
   <m:mi>&#949;</m:mi>
   <m:msub><m:mi>&#954;</m:mi><m:mn>2</m:mn></m:msub>
   <m:mfenced separators=""><m:mi>H</m:mi></m:mfenced>
  </m:mrow>
  <m:msub><m:mi mathvariant="italic">relgap</m:mi><m:mi>i</m:mi></m:msub>
 </m:mfrac>
</m:math></td><td class="formula2"/></tr></table></div>

where <m:math><m:msub><m:mi mathvariant="italic">relgap</m:mi><m:mi>i</m:mi></m:msub></m:math>&#160;is the relative gap between <m:math><m:msub><m:mi>&#955;</m:mi><m:mi>i</m:mi></m:msub></m:math>&#160;and the other eigenvalues, defined by

<div class="formula"><table class="formula"><tr><td class="formula"><m:math display="block">
 <m:msub><m:mi mathvariant="italic">relgap</m:mi><m:mi>i</m:mi></m:msub>
 <m:mo>=</m:mo>
 <m:munder>
  <m:mi mathvariant="normal">min</m:mi>
  <m:mrow><m:mi>i</m:mi><m:mo>&#8800;</m:mo><m:mi>j</m:mi></m:mrow>
 </m:munder><m:mspace width="0.25em"/>
 <m:mfrac>
  <m:mfenced open="|" close="|" separators="">
    <m:msub><m:mi>&#955;</m:mi><m:mi>i</m:mi></m:msub>
    <m:mo>-</m:mo>
    <m:msub><m:mi>&#955;</m:mi><m:mi>j</m:mi></m:msub>
   </m:mfenced>
  <m:mfenced separators="">
   <m:msub><m:mi>&#955;</m:mi><m:mi>i</m:mi></m:msub>
   <m:mo>+</m:mo>
   <m:msub><m:mi>&#955;</m:mi><m:mi>j</m:mi></m:msub>
  </m:mfenced>
 </m:mfrac>
 <m:mtext>.</m:mtext>
</m:math></td><td class="formula2"/></tr></table></div></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 typically about <m:math><m:mn>30</m:mn><m:msup><m:mi>n</m:mi><m:mn>2</m:mn></m:msup></m:math>&#160;if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#COMPZ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPZ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'N'</m:mtext></m:math>&#160;and about <m:math><m:mn>12</m:mn><m:msup><m:mi>n</m:mi><m:mn>3</m:mn></m:msup></m:math>&#160;if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#COMPZ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPZ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'V'</m:mtext></m:math>&#160;or <m:math><m:mtext>'I'</m:mtext></m:math>, but depends on how rapidly the algorithm converges.  When <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#COMPZ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPZ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'N'</m:mtext></m:math>, the operations are all performed in scalar mode; the additional operations to compute the eigenvectors when <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#COMPZ"><m:mi mathcolor="#EE0000" mathvariant="bold">COMPZ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'V'</m:mtext></m:math>&#160;or <m:math><m:mtext>'I'</m:mtext></m:math>&#160;can be vectorized and on some machines may be performed much faster.</div><div class="paramtext">The real analogue of this routine is <a class="rout" href="../F08/f08jgf.xml">F08JGF (DPTEQR)</a>.</div><h2 class="standard"><a class="sec" name="example" id="example"/>9&#160;&#160;Example</h2>
<div class="paramtext">This example computes all the eigenvalues and eigenvectors of the complex Hermitian positive definite 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 columnalign="right">
<m:mtr>
   <m:mtd><m:mn>6.02</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>0.45</m:mn></m:mrow><m:mo>+</m:mo><m:mn>0.25</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>1.30</m:mn></m:mrow><m:mo>+</m:mo><m:mn>1.74</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mn>1.45</m:mn><m:mo>-</m:mo><m:mn>0.66</m:mn><m:mi>i</m:mi></m:mtd>
</m:mtr><m:mtr>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>0.45</m:mn></m:mrow><m:mo>-</m:mo><m:mn>0.25</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mn>2.91</m:mn><m:mo>+</m:mo><m:mn>0.00</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mn>0.05</m:mn><m:mo>+</m:mo><m:mn>1.56</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>1.04</m:mn></m:mrow><m:mo>+</m:mo><m:mn>1.27</m:mn><m:mi>i</m:mi></m:mtd>
</m:mtr><m:mtr>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>1.30</m:mn></m:mrow><m:mo>-</m:mo><m:mn>1.74</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mn>0.05</m:mn><m:mo>-</m:mo><m:mn>1.56</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mn>3.29</m:mn><m:mo>+</m:mo><m:mn>0.00</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mn>0.14</m:mn><m:mo>+</m:mo><m:mn>1.70</m:mn><m:mi>i</m:mi></m:mtd>
</m:mtr><m:mtr>
   <m:mtd><m:mn>1.45</m:mn><m:mo>+</m:mo><m:mn>0.66</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>1.04</m:mn></m:mrow><m:mo>-</m:mo><m:mn>1.27</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mn>0.14</m:mn><m:mo>-</m:mo><m:mn>1.70</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mn>4.18</m:mn><m:mo>+</m:mo><m:mn>0.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/f08jufe.f90">Program Text (f08jufe.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/f08jufe.d">Program&#160;Data (f08jufe.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/f08jufe.r">Program Results (f08jufe.r)</a></p>
<hr/><div><a class="rout" href="../../pdf/F08/f08juf.pdf">F08JUF (ZPTEQR) (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>