<?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>F07GRF (ZPPTRF) : 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/F07/f07grf.pdf">F07GRF (ZPPTRF) (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/>F07GRF (ZPPTRF)</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">F07GRF (ZPPTRF) computes the Cholesky factorization of a complex Hermitian positive definite matrix, using packed storage.</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;F07GRF&#160;(</td>
<td class="tdfspec2" valign="top" align="left"><a class="arg" href="#UPLO">UPLO</a>, <a class="arg" href="#N">N</a>, <a class="arg" href="#AP">AP</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, 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">AP(*)</td>
</tr><tr>
<td class="tdfspec1" valign="top" align="left">CHARACTER(1)&#160;</td>
<td class="tdfspec2" valign="top" align="left">UPLO</td></tr>
</tbody>
</table></div>
</td></tr></table>
<div class="paramtext">The routine may be called by its 
    LAPACK
    name <span class="bitalic">zpptrf</span>.</div><h2 class="standard"><a class="sec" name="description" id="description"/>3&#160;&#160;Description</h2>
<div class="paramtext">F07GRF (ZPPTRF) forms the Cholesky factorization of a complex Hermitian positive definite matrix <m:math><m:mi>A</m:mi></m:math>&#160;either as <m:math><m:mi>A</m:mi><m:mo>=</m:mo><m:msup><m:mi>U</m:mi><m:mi mathvariant="normal">H</m:mi></m:msup><m:mi>U</m:mi></m:math>&#160;if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#UPLO"><m:mi mathcolor="#EE0000" mathvariant="bold">UPLO</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'U'</m:mtext></m:math>&#160;or <m:math><m:mi>A</m:mi><m:mo>=</m:mo><m:mi>L</m:mi><m:msup><m:mi>L</m:mi><m:mi mathvariant="normal">H</m:mi></m:msup></m:math>&#160;if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#UPLO"><m:mi mathcolor="#EE0000" mathvariant="bold">UPLO</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'L'</m:mtext></m:math>, where <m:math><m:mi>U</m:mi></m:math>&#160;is an upper triangular matrix and <m:math><m:mi>L</m:mi></m:math>&#160;is lower triangular, using packed storage.</div><h2 class="standard"><a class="sec" name="references" id="references"/>4&#160;&#160;References</h2><div class="paramtext"><a name="ref121" id="ref121"/>Demmel J W (1989)  On floating-point errors in Cholesky <i>LAPACK Working Note No. 14</i> University of Tennessee, Knoxville </div>
<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="UPLO" id="UPLO"/>1: &#160;&#160;&#8194; UPLO &#8211; CHARACTER(1)<span class="pclass">Input</span></dt><dd><div class="paramtext"><i>On entry</i>: specifies whether the upper or lower triangular part of <m:math><m:mi>A</m:mi></m:math>&#160;is stored and how <m:math><m:mi>A</m:mi></m:math>&#160;is to be factorized.

<dl>
<dt class="paramval"><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#UPLO"><m:mi mathcolor="#EE0000" mathvariant="bold">UPLO</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'U'</m:mtext></m:math></dt>
<dd>The upper triangular part of <m:math><m:mi>A</m:mi></m:math>&#160;is stored and <m:math><m:mi>A</m:mi></m:math>&#160;is factorized as
<m:math><m:msup><m:mi>U</m:mi><m:mi mathvariant="normal">H</m:mi></m:msup><m:mi>U</m:mi></m:math>, where <m:math><m:mi>U</m:mi></m:math>&#160;is upper triangular.</dd>
<dt class="paramval"><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#UPLO"><m:mi mathcolor="#EE0000" mathvariant="bold">UPLO</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'L'</m:mtext></m:math></dt>
<dd>The lower triangular part of <m:math><m:mi>A</m:mi></m:math>&#160;is stored and <m:math><m:mi>A</m:mi></m:math>&#160;is factorized as 
<m:math><m:mi>L</m:mi><m:msup><m:mi>L</m:mi><m:mi mathvariant="normal">H</m:mi></m:msup></m:math>, where <m:math><m:mi>L</m:mi></m:math>&#160;is lower triangular.</dd></dl>
</div><div class="paramtext"><i>Constraint</i>:
  <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#UPLO"><m:mi mathcolor="#EE0000" mathvariant="bold">UPLO</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'U'</m:mtext></m:math>&#160;or <m:math><m:mtext>'L'</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="AP" id="AP"/>3: &#160;&#160;&#8194; AP(<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 dimension of the array <a class="arg" href="#AP">AP</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>&#215;</m:mo><m:mfenced separators=""><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:mfenced><m:mo>/</m:mo><m:mn>2</m:mn></m:mrow></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;Hermitian
matrix <m:math><m:mi>A</m:mi></m:math>, packed by columns.

<div class="paramtext">More precisely,<ul class="listind"><li class="listind">if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#UPLO"><m:mi mathcolor="#EE0000" mathvariant="bold">UPLO</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'U'</m:mtext></m:math>, the upper triangle of <m:math><m:mi>A</m:mi></m:math>&#160;must be stored with 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;in <m:math><m:mrow><m:maction actiontype="link" dsi:type="simple" dsi:href="#AP"><m:mi mathcolor="#EE0000" mathvariant="bold">AP</m:mi></m:maction><m:mfenced separators="," open="(" close=")"><m:mrow><m:mi>i</m:mi><m:mo>+</m:mo><m:mi>j</m:mi><m:mfenced separators=""><m:mi>j</m:mi><m:mo>-</m:mo><m:mn>1</m:mn></m:mfenced><m:mo>/</m:mo><m:mn>2</m:mn></m:mrow></m:mfenced></m:mrow></m:math>&#160;for <m:math><m:mi>i</m:mi><m:mo>&#8804;</m:mo><m:mi>j</m:mi></m:math>;</li><li class="listind">if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#UPLO"><m:mi mathcolor="#EE0000" mathvariant="bold">UPLO</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'L'</m:mtext></m:math>, the lower triangle of <m:math><m:mi>A</m:mi></m:math>&#160;must be stored with 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;in <m:math><m:mrow><m:maction actiontype="link" dsi:type="simple" dsi:href="#AP"><m:mi mathcolor="#EE0000" mathvariant="bold">AP</m:mi></m:maction><m:mfenced separators="," open="(" close=")"><m:mrow><m:mi>i</m:mi><m:mo>+</m:mo><m:mfenced separators=""><m:mn>2</m:mn><m:mi>n</m:mi><m:mo>-</m:mo><m:mi>j</m:mi></m:mfenced><m:mfenced separators=""><m:mi>j</m:mi><m:mo>-</m:mo><m:mn>1</m:mn></m:mfenced><m:mo>/</m:mo><m:mn>2</m:mn></m:mrow></m:mfenced></m:mrow></m:math>&#160;for <m:math><m:mi>i</m:mi><m:mo>&#8805;</m:mo><m:mi>j</m:mi></m:math>.</li></ul></div>
</div><div class="paramtext"><i>On exit</i>: 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="#errors"><m:mn mathcolor="#003399" mathvariant="bold">0</m:mn></m:maction></m:math>, the factor <m:math><m:mi>U</m:mi></m:math>&#160;or <m:math><m:mi>L</m:mi></m:math>&#160;from the Cholesky factorization 
<m:math><m:mi>A</m:mi><m:mo>=</m:mo><m:msup><m:mi>U</m:mi><m:mi mathvariant="normal">H</m:mi></m:msup><m:mi>U</m:mi></m:math>&#160;or 
<m:math><m:mi>A</m:mi><m:mo>=</m:mo><m:mi>L</m:mi><m:msup><m:mi>L</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup></m:math>, in the same storage format as <m:math><m:mi>A</m:mi></m:math>.</div></dd><dt class="paramhead"><a name="INFO" id="INFO"/>4: &#160;&#160;&#8194; INFO &#8211; INTEGER<span class="pclass">Output</span></dt><dd><div class="paramtext"><i>On exit</i>: <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#INFO"><m:mi mathcolor="#EE0000" mathvariant="bold">INFO</m:mi></m:maction><m:mo>=</m:mo><m:mn>0</m:mn></m:math>&#160;unless the routine detects an error (see <a class="sec" href="#errors">Section 6</a>).</div>
</dd></dl><h2 class="standard"><a class="sec" name="errors" id="errors"/>6&#160;&#160;Error Indicators and Warnings</h2>
<div class="paramtext">Errors or warnings detected by the routine:</div>
<dl class="ifail">
<dt class="errorhead"><a name="INlt0" id="INlt0"/><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#INFO"><m:mi mathcolor="#EE0000" mathvariant="bold">INFO</m:mi></m:maction><m:mo>&lt;</m:mo><m:mn>0</m:mn></m:math></dt>
<dd><div class="paramtext">If <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#INFO"><m:mi mathcolor="#EE0000" mathvariant="bold">INFO</m:mi></m:maction><m:mo>=</m:mo><m:mo>-</m:mo><m:mi>i</m:mi></m:math>, the <m:math><m:mi>i</m:mi></m:math>th parameter had an illegal value. An explanatory message is output, and execution of the program is terminated.</div>
</dd>
</dl><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 factorization could not be completed.  Hence <m:math><m:mi>A</m:mi></m:math>&#160;itself is not positive definite.  This may indicate an error in forming the matrix <m:math><m:mi>A</m:mi></m:math>.  To factorize a 

matrix which is not positive definite, call 
<a class="rout" href="../F07/f07prf.xml">F07PRF (ZHPTRF)</a> 
instead.</div></dd>
</dl><h2 class="standard"><a class="sec" name="accuracy" id="accuracy"/>7&#160;&#160;Accuracy</h2>
<div class="paramtext">If <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#UPLO"><m:mi mathcolor="#EE0000" mathvariant="bold">UPLO</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'U'</m:mtext></m:math>, the computed factor <m:math><m:mi>U</m:mi></m:math>&#160;is the exact factor of a perturbed matrix <m:math><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: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>n</m:mi></m:mfenced><m:mi>&#949;</m:mi><m:mfenced open="|" close="|" separators=""><m:msup><m:mi>U</m:mi><m:mi mathvariant="normal">H</m:mi></m:msup></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>n</m:mi></m:mfenced></m:math>&#160;is a modest linear 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">If <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#UPLO"><m:mi mathcolor="#EE0000" mathvariant="bold">UPLO</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'L'</m:mtext></m:math>, a similar statement holds for the computed factor <m:math><m:mi>L</m:mi></m:math>.  It follows that <m:math><m:mfenced open="|" close="|" separators=""><m:msub><m:mi>e</m:mi><m:mrow><m:mi>i</m:mi><m:mi>j</m:mi></m:mrow></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:msqrt><m:msub><m:mi>a</m:mi><m:mrow><m:mi>i</m:mi><m:mi>i</m:mi></m:mrow></m:msub><m:msub><m:mi>a</m:mi><m:mrow><m:mi>j</m:mi><m:mi>j</m:mi></m:mrow></m:msub></m:msqrt></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 <m:math><m:mfrac><m:mn>4</m:mn><m:mn>3</m:mn></m:mfrac><m:msup><m:mi>n</m:mi><m:mn>3</m:mn></m:msup></m:math>.</div><div class="paramtext">A call to F07GRF (ZPPTRF) may be followed by calls to the routines:
<ul class="listind"><li class="listind"><a class="rout" href="../F07/f07gsf.xml">F07GSF (ZPPTRS)</a> to solve <m:math><m:mi>A</m:mi><m:mi>X</m:mi><m:mo>=</m:mo><m:mi>B</m:mi></m:math>;</li><li class="listind"><a class="rout" href="../F07/f07guf.xml">F07GUF (ZPPCON)</a> to estimate the condition number of <m:math><m:mi>A</m:mi></m:math>;</li><li class="listind"><a class="rout" href="../F07/f07gwf.xml">F07GWF (ZPPTRI)</a> to compute the inverse of <m:math><m:mi>A</m:mi></m:math>.</li></ul>
</div><div class="paramtext">The real analogue of this routine is <a class="rout" href="../F07/f07gdf.xml">F07GDF (DPPTRF)</a>.</div><h2 class="standard"><a class="sec" name="example" id="example"/>9&#160;&#160;Example</h2>
<div class="paramtext">This example computes the Cholesky factorization of the matrix <m:math><m:mi>A</m:mi></m:math>, where

<div class="formula"><table class="formula"><tr><td class="formula"><m:math display="block">
<m:mi>A</m:mi><m:mo>=</m:mo>
 <m:mfenced><m:mtable columnalign="right">
<m:mtr>
   <m:mtd><m:mn>3.23</m:mn><m:mo>+</m:mo><m:mn>0.00</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mn>1.51</m:mn><m:mo>-</m:mo><m:mn>1.92</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mn>1.90</m:mn><m:mo>+</m:mo><m:mn>0.84</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mn>0.42</m:mn><m:mo>+</m:mo><m:mn>2.50</m:mn><m:mi>i</m:mi></m:mtd>
</m:mtr><m:mtr>
   <m:mtd><m:mn>1.51</m:mn><m:mo>+</m:mo><m:mn>1.92</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mn>3.58</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.23</m:mn></m:mrow><m:mo>+</m:mo><m:mn>1.11</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>1.18</m:mn></m:mrow><m:mo>+</m:mo><m:mn>1.37</m:mn><m:mi>i</m:mi></m:mtd>
</m:mtr><m:mtr>
   <m:mtd><m:mn>1.90</m:mn><m:mo>-</m:mo><m:mn>0.84</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>1.11</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mn>4.09</m:mn><m:mo>+</m:mo><m:mn>0.00</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mn>2.33</m:mn><m:mo>-</m:mo><m:mn>0.14</m:mn><m:mi>i</m:mi></m:mtd>
</m:mtr><m:mtr>
   <m:mtd><m:mn>0.42</m:mn><m:mo>-</m:mo><m:mn>2.50</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>1.18</m:mn></m:mrow><m:mo>-</m:mo><m:mn>1.37</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mn>2.33</m:mn><m:mo>+</m:mo><m:mn>0.14</m:mn><m:mi>i</m:mi></m:mtd>
   <m:mtd><m:mn>4.29</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>

using packed storage.</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/f07grfe.f90">Program Text (f07grfe.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/f07grfe.d">Program&#160;Data (f07grfe.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/f07grfe.r">Program Results (f07grfe.r)</a></p>
<hr/><div><a class="rout" href="../../pdf/F07/f07grf.pdf">F07GRF (ZPPTRF) (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. 2011</a></div></body></html>