<?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>F08SCF (DSYGVD) : 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/f08scf.pdf">F08SCF (DSYGVD) (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/>F08SCF (DSYGVD)</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">F08SCF (DSYGVD) computes all the eigenvalues and, optionally, the eigenvectors of a real generalized symmetric-definite eigenproblem, of the form

<div class="formula"><table class="formula"><tr><td class="formula"><m:math display="block">
 <m:mi>A</m:mi><m:mi>z</m:mi><m:mo>=</m:mo><m:mi>&#955;</m:mi><m:mi>B</m:mi><m:mi>z</m:mi>
 <m:mtext>, &#8195;</m:mtext>
 <m:mi>A</m:mi><m:mi>B</m:mi><m:mi>z</m:mi><m:mo>=</m:mo><m:mi>&#955;</m:mi><m:mi>z</m:mi>
 <m:mtext>&#8195; or &#8195;</m:mtext>
 <m:mi>B</m:mi><m:mi>A</m:mi><m:mi>z</m:mi><m:mo>=</m:mo><m:mi>&#955;</m:mi><m:mi>z</m:mi>
 <m:mtext>,</m:mtext>
</m:math></td><td class="formula2"/></tr></table></div>

where <m:math><m:mi>A</m:mi></m:math>&#160;and <m:math><m:mi>B</m:mi></m:math>&#160;are symmetric and <m:math><m:mi>B</m:mi></m:math>&#160;is also positive definite. If eigenvectors are desired, it uses a divide-and-conquer algorithm.</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;F08SCF&#160;(</td>
<td class="tdfspec2" valign="top" align="left"><a class="arg" href="#ITYPE">ITYPE</a>, <a class="arg" href="#JOBZ">JOBZ</a>, <a class="arg" href="#UPLO">UPLO</a>, <a class="arg" href="#N">N</a>, <a class="arg" href="#A">A</a>, <a class="arg" href="#LDA">LDA</a>, <a class="arg" href="#B">B</a>, <a class="arg" href="#LDB">LDB</a>, <a class="arg" href="#W">W</a>, <a class="arg" href="#WORK">WORK</a>, <a class="arg" href="#LWORK">LWORK</a>, <a class="arg" href="#IWORK">IWORK</a>, <a class="arg" href="#LIWORK">LIWORK</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">ITYPE, N, LDA, LDB, LWORK, IWORK(max(1,LIWORK)), LIWORK, 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">A(LDA,*), B(LDB,*), W(N), WORK(max(1,LWORK))</td>
</tr><tr>
<td class="tdfspec1" valign="top" align="left">CHARACTER(1)&#160;</td>
<td class="tdfspec2" valign="top" align="left">JOBZ, UPLO</td></tr></tbody>
</table></div>
</td></tr></table>
<div class="paramtext">The routine may be called by its 
    LAPACK
    name <span class="bitalic">dsygvd</span>.</div><h2 class="standard"><a class="sec" name="description" id="description"/>3&#160;&#160;Description</h2>
<div class="paramtext">F08SCF (DSYGVD) first performs a Cholesky factorization of the matrix <m:math><m:mi>B</m:mi></m:math>&#160;as <m:math>
 <m:mi>B</m:mi><m:mo>=</m:mo><m:msup><m:mi>U</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup><m:mi>U</m:mi>
</m:math>, when <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>B</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>, when <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 generalized problem is then reduced to a standard symmetric eigenvalue problem

<div class="formula"><table class="formula"><tr><td class="formula"><m:math display="block">
 <m:mi>C</m:mi><m:mi>x</m:mi><m:mo>=</m:mo><m:mi>&#955;</m:mi><m:mi>x</m:mi>
 <m:mtext>,</m:mtext>
</m:math></td><td class="formula2"/></tr></table></div>

which is solved for the eigenvalues and, optionally, the eigenvectors; the eigenvectors are then backtransformed to give the eigenvectors of the original problem.</div><div class="paramtext">For the problem <m:math>
 <m:mi>A</m:mi><m:mi>z</m:mi><m:mo>=</m:mo><m:mi>&#955;</m:mi><m:mi>B</m:mi><m:mi>z</m:mi>
</m:math>, the eigenvectors are normalized so that the matrix of eigenvectors, <m:math><m:mi>z</m:mi></m:math>, satisfies

<div class="formula"><table class="formula"><tr><td class="formula"><m:math display="block">
 <m:msup><m:mi>Z</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup>
 <m:mi>A</m:mi>
 <m:mi>Z</m:mi>
 <m:mo>=</m:mo>
 <m:mi>&#923;</m:mi>
 <m:mtext>&#8195; and &#8195;</m:mtext>
 <m:msup><m:mi>Z</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup>
 <m:mi>B</m:mi>
 <m:mi>Z</m:mi>
 <m:mo>=</m:mo>
 <m:mi>I</m:mi>
 <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 the diagonal matrix whose diagonal elements are the eigenvalues.  For the problem <m:math>
 <m:mi>A</m:mi>
 <m:mi>B</m:mi>
 <m:mi>z</m:mi>
 <m:mo>=</m:mo>
 <m:mi>&#955;</m:mi>
 <m:mi>z</m:mi>
</m:math>&#160;we correspondingly have 

<div class="formula"><table class="formula"><tr><td class="formula"><m:math display="block">
 <m:msup><m:mi>Z</m:mi><m:mrow><m:mo>-</m:mo><m:mn>1</m:mn></m:mrow></m:msup>
 <m:mi>A</m:mi>
 <m:msup><m:mi>Z</m:mi><m:mrow><m:mo>-</m:mo><m:mi mathvariant="normal">T</m:mi></m:mrow></m:msup>
 <m:mo>=</m:mo>
 <m:mi>&#923;</m:mi>
 <m:mtext>&#8195; and &#8195;</m:mtext>
 <m:msup><m:mi>Z</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup>
 <m:mi>B</m:mi>
 <m:mi>Z</m:mi>
 <m:mo>=</m:mo>
 <m:mi>I</m:mi>
 <m:mtext>,</m:mtext>
</m:math></td><td class="formula2"/></tr></table></div>

and for <m:math>
 <m:mi>B</m:mi>
 <m:mi>A</m:mi>
 <m:mi>z</m:mi>
 <m:mo>=</m:mo>
 <m:mi>&#955;</m:mi>
 <m:mi>z</m:mi>
</m:math>&#160;we have 
<div class="formula"><table class="formula"><tr><td class="formula"><m:math display="block">
 <m:msup><m:mi>Z</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup>
 <m:mi>A</m:mi>
 <m:mi>Z</m:mi>
 <m:mo>=</m:mo>
 <m:mi>&#923;</m:mi>
 <m:mtext>&#8195; and &#8195;</m:mtext>
 <m:msup><m:mi>Z</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup>
 <m:msup><m:mi>B</m:mi><m:mrow><m:mo>-</m:mo><m:mn>1</m:mn></m:mrow></m:msup>
 <m:mi>Z</m:mi>
 <m:mo>=</m:mo>
 <m:mi>I</m:mi>
 <m:mtext>.</m:mtext>
</m:math></td><td class="formula2"/></tr></table></div></div><h2 class="standard"><a class="sec" name="references" id="references"/>4&#160;&#160;References</h2><div class="paramtext"><a name="ref252" id="ref252"/>Anderson E, Bai Z, Bischof C, Blackford S, Demmel J, Dongarra J J, Du Croz J J, Greenbaum A, Hammarling S, McKenney A and Sorensen D (1999)  <i>LAPACK Users' Guide</i> (3rd Edition) SIAM, Philadelphia <a class="url" href="http://www.netlib.org/lapack/lug">http://www.netlib.org/lapack/lug</a></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="ITYPE" id="ITYPE"/>1: &#160;&#160;&#8194; ITYPE &#8211; INTEGER<span class="pclass">Input</span></dt><dd>
<div class="paramtext"><i>On entry</i>: specifies the problem type to be solved.

<dl>
<dt class="paramval"><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#ITYPE"><m:mi mathcolor="#EE0000" mathvariant="bold">ITYPE</m:mi></m:maction><m:mo>=</m:mo><m:mn>1</m:mn></m:math></dt>
<dd><m:math><m:mi>A</m:mi><m:mi>z</m:mi><m:mo>=</m:mo><m:mi>&#955;</m:mi><m:mi>B</m:mi><m:mi>z</m:mi></m:math>.</dd>
<dt class="paramval"><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#ITYPE"><m:mi mathcolor="#EE0000" mathvariant="bold">ITYPE</m:mi></m:maction><m:mo>=</m:mo><m:mn>2</m:mn></m:math></dt>
<dd><m:math><m:mi>A</m:mi><m:mi>B</m:mi><m:mi>z</m:mi><m:mo>=</m:mo><m:mi>&#955;</m:mi><m:mi>z</m:mi></m:math>.</dd>
<dt class="paramval"><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#ITYPE"><m:mi mathcolor="#EE0000" mathvariant="bold">ITYPE</m:mi></m:maction><m:mo>=</m:mo><m:mn>3</m:mn></m:math></dt>
<dd><m:math><m:mi>B</m:mi><m:mi>A</m:mi><m:mi>z</m:mi><m:mo>=</m:mo><m:mi>&#955;</m:mi><m:mi>z</m:mi></m:math>.</dd></dl>
</div>
</dd><dt class="paramhead"><a name="JOBZ" id="JOBZ"/>2: &#160;&#160;&#8194; JOBZ &#8211; CHARACTER(1)<span class="pclass">Input</span></dt><dd>
<div class="paramtext"><i>On entry</i>: if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#JOBZ"><m:mi mathcolor="#EE0000" mathvariant="bold">JOBZ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'N'</m:mtext></m:math>, compute eigenvalues only.
<div class="paramtext">If <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#JOBZ"><m:mi mathcolor="#EE0000" mathvariant="bold">JOBZ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'V'</m:mtext></m:math>, compute eigenvalues and eigenvectors.</div>
</div><div class="paramtext"><i>Constraint</i>:
  <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#JOBZ"><m:mi mathcolor="#EE0000" mathvariant="bold">JOBZ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'N'</m:mtext></m:math>&#160;or <m:math><m:mtext>'V'</m:mtext></m:math>.
</div>
</dd><dt class="paramhead"><a name="UPLO" id="UPLO"/>3: &#160;&#160;&#8194; UPLO &#8211; CHARACTER(1)<span class="pclass">Input</span></dt><dd>
<div class="paramtext"><i>On entry</i>: 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 triangles of <m:math><m:mi>A</m:mi></m:math>&#160;and <m:math><m:mi>B</m:mi></m:math>&#160;are stored.
<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>, the lower triangles of <m:math><m:mi>A</m:mi></m:math>&#160;and <m:math><m:mi>B</m:mi></m:math>&#160;are stored.</div>
</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"/>4: &#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 matrices 
<m:math><m:mi>A</m:mi></m:math>&#160;and <m:math><m:mi>B</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="A" id="A"/>5: &#160;&#160;&#8194; A(<a class="arg" href="#LDA">LDA</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="#A">A</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;symmetric
matrix <m:math><m:mi>A</m:mi></m:math>.

<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 triangular part of <m:math><m:mi>A</m:mi></m:math>&#160;must be stored  and the elements of the array below the diagonal are not referenced.</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 triangular part of <m:math><m:mi>A</m:mi></m:math>&#160;must be stored  and the elements of the array above the diagonal are not referenced.</li></ul>
</div><div class="paramtext"><i>On exit</i>: if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#JOBZ"><m:mi mathcolor="#EE0000" mathvariant="bold">JOBZ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'V'</m:mtext></m:math>, then 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>, <a class="arg" href="#A">A</a> contains the matrix <m:math><m:mi>Z</m:mi></m:math>&#160;of eigenvectors. The eigenvectors are normalized as follows:
<ul class="listind"><li class="listind">if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#ITYPE"><m:mi mathcolor="#EE0000" mathvariant="bold">ITYPE</m:mi></m:maction><m:mo>=</m:mo><m:mn>1</m:mn></m:math>&#160;or <m:math><m:mn>2</m:mn></m:math>, <m:math><m:msup><m:mi>Z</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup><m:mi>B</m:mi><m:mi>Z</m:mi><m:mo>=</m:mo><m:mi>I</m:mi></m:math>;</li><li class="listind">if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#ITYPE"><m:mi mathcolor="#EE0000" mathvariant="bold">ITYPE</m:mi></m:maction><m:mo>=</m:mo><m:mn>3</m:mn></m:math>, <m:math><m:msup><m:mi>Z</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup><m:msup><m:mi>B</m:mi><m:mrow><m:mo>-</m:mo><m:mn>1</m:mn></m:mrow></m:msup><m:mi>Z</m:mi><m:mo>=</m:mo><m:mi>I</m:mi></m:math>.</li></ul>
<div class="paramtext">If <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#JOBZ"><m:mi mathcolor="#EE0000" mathvariant="bold">JOBZ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'N'</m:mtext></m:math>, the upper triangle (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>) or the lower triangle (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>) of <a class="arg" href="#A">A</a>, including the diagonal, is destroyed.</div>
</div></dd><dt class="paramhead"><a name="LDA" id="LDA"/>6: &#160;&#160;&#8194; LDA &#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="#A">A</a> as declared in the (sub)program from which F08SCF (DSYGVD) is called.</div><div class="paramtext"><i>Constraint</i>:
  <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#LDA"><m:mi mathcolor="#EE0000" mathvariant="bold">LDA</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="B" id="B"/>7: &#160;&#160;&#8194; B(<a class="arg" href="#LDB">LDB</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="#B">B</a>
must be at least
<m:math><m:mrow><m:mi>max</m:mi><m:mspace width="0.125em"/><m:mfenced separators=""><m:mn>1</m:mn><m:mo>,</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#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
symmetric
matrix <m:math><m:mi>B</m:mi></m:math>:
<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 leading <m:math><m:mi>n</m:mi></m:math>&#160;by <m:math><m:mi>n</m:mi></m:math>&#160;upper triangular part of <a class="arg" href="#B">B</a> contains the upper triangular part of the matrix <m:math><m:mi>B</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 leading <m:math><m:mi>n</m:mi></m:math>&#160;by <m:math><m:mi>n</m:mi></m:math>&#160;lower triangular part of <a class="arg" href="#B">B</a> contains the lower triangular part of the matrix <m:math><m:mi>B</m:mi></m:math>.</li></ul>
</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>&#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>, the part of <a class="arg" href="#B">B</a> containing the matrix is overwritten by the triangular 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:maction actiontype="link" dsi:type="simple" dsi:href="#B"><m:mi mathcolor="#EE0000" mathvariant="bold">B</m:mi></m:maction><m:mo>=</m:mo><m:msup><m:mi>U</m:mi><m:mi mathvariant="normal">T</m:mi></m:msup><m:mi>U</m:mi></m:math>&#160;or <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#B"><m:mi mathcolor="#EE0000" mathvariant="bold">B</m:mi></m:maction><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>.</div></dd><dt class="paramhead"><a name="LDB" id="LDB"/>8: &#160;&#160;&#8194; LDB &#8211; INTEGER<span class="pclass">Input</span></dt><dd>
<div class="paramtext"><i>On entry</i>: the first dimension of the array <a class="arg" href="#B">B</a> as declared in the (sub)program from which F08SCF (DSYGVD) is called.</div><div class="paramtext"><i>Constraint</i>:
  <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#LDB"><m:mi mathcolor="#EE0000" mathvariant="bold">LDB</m:mi></m:maction><m:mo>&#8805;</m:mo><m:mrow><m:mi>max</m:mi><m:mspace width="0.125em"/><m:mfenced separators=""><m:mn>1</m:mn><m:mo>,</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#N"><m:mi mathcolor="#EE0000" mathvariant="bold">N</m:mi></m:maction></m:mfenced></m:mrow></m:math>.
</div>
</dd><dt class="paramhead"><a name="W" id="W"/>9: &#160;&#160;&#8194; W(<a class="arg" href="#N">N</a>) &#8211; REAL&#160;(KIND=nag_wp)&#160;array<span class="pclass">Output</span></dt><dd><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 eigenvalues in ascending order.</div>
</dd><dt class="paramhead"><a name="WORK" id="WORK"/>10: &#8194; WORK(<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="#LWORK"><m:mi mathcolor="#EE0000" mathvariant="bold">LWORK</m:mi></m:maction></m:mfenced></m:mrow></m:math>) &#8211; REAL&#160;(KIND=nag_wp)&#160;array<span class="pclass">Workspace</span></dt><dd><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>, <m:math><m:mrow><m:maction actiontype="link" dsi:type="simple" dsi:href="#WORK"><m:mi mathcolor="#EE0000" mathvariant="bold">WORK</m:mi></m:maction><m:mfenced separators="," open="(" close=")"><m:mn>1</m:mn></m:mfenced></m:mrow></m:math>&#160;contains the minimum value of <a class="arg" href="#LWORK">LWORK</a> required for optimal performance.</div>
</dd><dt class="paramhead"><a name="LWORK" id="LWORK"/>11: &#8194; LWORK &#8211; INTEGER<span class="pclass">Input</span></dt><dd>
<div class="paramtext"><i>On entry</i>: the dimension of the array <a class="arg" href="#WORK">WORK</a> as declared in the (sub)program from which F08SCF (DSYGVD) is called.

<div class="paramtext">If <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#LWORK"><m:mi mathcolor="#EE0000" mathvariant="bold">LWORK</m:mi></m:maction><m:mo>=</m:mo><m:mrow><m:mo>-</m:mo><m:mn>1</m:mn></m:mrow></m:math>, a workspace query is assumed; the routine only calculates the optimal size of the <a class="arg" href="#WORK">WORK</a> array and the minimum size of the <a class="arg" href="#IWORK">IWORK</a> array, returns these values as the first entries of the <a class="arg" href="#WORK">WORK</a> and <a class="arg" href="#IWORK">IWORK</a> arrays, and no error message related to <a class="arg" href="#LWORK">LWORK</a> or <a class="arg" href="#LIWORK">LIWORK</a> is issued.</div></div>
<div class="paramtext"><i>Suggested value</i>:
  for optimal performance, <a class="arg" href="#LWORK">LWORK</a> should usually be larger than the minimum, try increasing by <m:math><m:mi mathvariant="italic">nb</m:mi><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>, where <m:math><m:mi mathvariant="italic">nb</m:mi></m:math>&#160;is the optimal <span class="bitalic">block size</span>.

</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="#N"><m:mi mathcolor="#EE0000" mathvariant="bold">N</m:mi></m:maction><m:mo>&#8804;</m:mo><m:mn>1</m:mn></m:math>, <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#LWORK"><m:mi mathcolor="#EE0000" mathvariant="bold">LWORK</m:mi></m:maction><m:mo>&#8805;</m:mo><m:mn>1</m:mn></m:math>;</li>
<li class="listcons">if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#JOBZ"><m:mi mathcolor="#EE0000" mathvariant="bold">JOBZ</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="#N"><m:mi mathcolor="#EE0000" mathvariant="bold">N</m:mi></m:maction><m:mo>&gt;</m:mo><m:mn>1</m:mn></m:math>, <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#LWORK"><m:mi mathcolor="#EE0000" mathvariant="bold">LWORK</m:mi></m:maction><m:mo>&#8805;</m:mo><m:mn>2</m:mn><m:mo>&#215;</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#N"><m:mi mathcolor="#EE0000" mathvariant="bold">N</m:mi></m:maction><m:mo>+</m:mo><m:mn>1</m:mn></m:math>;</li>
<li class="listcons">if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#JOBZ"><m:mi mathcolor="#EE0000" mathvariant="bold">JOBZ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'V'</m:mtext></m:math>&#160;and <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>&gt;</m:mo><m:mn>1</m:mn></m:math>, <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#LWORK"><m:mi mathcolor="#EE0000" mathvariant="bold">LWORK</m:mi></m:maction><m:mo>&#8805;</m:mo><m:mn>1</m:mn><m:mo>+</m:mo><m:mn>6</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:mo>+</m:mo><m:mn>2</m:mn><m:mo>&#215;</m:mo><m:msup><m:maction actiontype="link" dsi:type="simple" dsi:href="#N"><m:mi mathcolor="#EE0000" mathvariant="bold">N</m:mi></m:maction><m:mn>2</m:mn></m:msup></m:math>.</li>
</ul></div>
</dd><dt class="paramhead"><a name="IWORK" id="IWORK"/>12: &#8194; IWORK(<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="#LIWORK"><m:mi mathcolor="#EE0000" mathvariant="bold">LIWORK</m:mi></m:maction></m:mfenced></m:mrow></m:math>) &#8211; INTEGER&#160;array<span class="pclass">Workspace</span></dt><dd><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>, <m:math><m:mrow><m:maction actiontype="link" dsi:type="simple" dsi:href="#IWORK"><m:mi mathcolor="#EE0000" mathvariant="bold">IWORK</m:mi></m:maction><m:mfenced separators="," open="(" close=")"><m:mn>1</m:mn></m:mfenced></m:mrow></m:math>&#160;returns the minimum <a class="arg" href="#LIWORK">LIWORK</a>.</div>
</dd><dt class="paramhead"><a name="LIWORK" id="LIWORK"/>13: &#8194; LIWORK &#8211; INTEGER<span class="pclass">Input</span></dt><dd>
<div class="paramtext"><i>On entry</i>: the dimension of the array <a class="arg" href="#IWORK">IWORK</a> as declared in the (sub)program from which F08SCF (DSYGVD) is called.

<div class="paramtext">If <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#LIWORK"><m:mi mathcolor="#EE0000" mathvariant="bold">LIWORK</m:mi></m:maction><m:mo>=</m:mo><m:mrow><m:mo>-</m:mo><m:mn>1</m:mn></m:mrow></m:math>, a workspace query is assumed; the routine only calculates the optimal size of the <a class="arg" href="#WORK">WORK</a> array and the minimum size of the <a class="arg" href="#IWORK">IWORK</a> array, returns these values as the first entries of the <a class="arg" href="#WORK">WORK</a> and <a class="arg" href="#IWORK">IWORK</a> arrays, and no error message related to <a class="arg" href="#LWORK">LWORK</a> or <a class="arg" href="#LIWORK">LIWORK</a> is issued.</div></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="#N"><m:mi mathcolor="#EE0000" mathvariant="bold">N</m:mi></m:maction><m:mo>&#8804;</m:mo><m:mn>1</m:mn></m:math>, <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#LIWORK"><m:mi mathcolor="#EE0000" mathvariant="bold">LIWORK</m:mi></m:maction><m:mo>&#8805;</m:mo><m:mn>1</m:mn></m:math>;</li>
<li class="listcons">if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#JOBZ"><m:mi mathcolor="#EE0000" mathvariant="bold">JOBZ</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="#N"><m:mi mathcolor="#EE0000" mathvariant="bold">N</m:mi></m:maction><m:mo>&gt;</m:mo><m:mn>1</m:mn></m:math>, <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#LIWORK"><m:mi mathcolor="#EE0000" mathvariant="bold">LIWORK</m:mi></m:maction><m:mo>&#8805;</m:mo><m:mn>1</m:mn></m:math>;</li>
<li class="listcons">if <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#JOBZ"><m:mi mathcolor="#EE0000" mathvariant="bold">JOBZ</m:mi></m:maction><m:mo>=</m:mo><m:mtext>'V'</m:mtext></m:math>&#160;and <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>&gt;</m:mo><m:mn>1</m:mn></m:math>, <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#LIWORK"><m:mi mathcolor="#EE0000" mathvariant="bold">LIWORK</m:mi></m:maction><m:mo>&#8805;</m:mo><m:mn>3</m:mn><m:mo>+</m:mo><m:mn>5</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>.</li>
</ul></div>
</dd><dt class="paramhead"><a name="INFO" id="INFO"/>14: &#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"><a class="rout" href="../F07/f07fdf.xml">F07FDF (DPOTRF)</a>
or
<a class="rout" href="../F08/f08fcf.xml">F08FCF (DSYEVD)</a>
returned an error code:
<table class="standard-90"><tr>
<td style="width:3.0em;" valign="baseline"><m:math><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></td>
<td valign="top">
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>,
<a class="rout" href="../F08/f08fcf.xml">F08FCF (DSYEVD)</a>
failed to converge; <m:math><m:mi>i</m:mi></m:math>&#160;off-diagonal elements of an intermediate tridiagonal form did not converge to zero;</td>
</tr><tr>
<td style="width:3.0em;" valign="baseline"><m:math><m:mo>&gt;</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></td>
<td valign="top">
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>, for <m:math><m:mn>1</m:mn><m:mo>&#8804;</m:mo><m:mi>i</m:mi><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>, then the leading minor of order <m:math><m:mi>i</m:mi></m:math>&#160;of <m:math><m:mi>B</m:mi></m:math>&#160;is not positive definite. The factorization of <m:math><m:mi>B</m:mi></m:math>&#160;could not be completed and no eigenvalues or eigenvectors were computed.</td>
</tr></table>
</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:mi>B</m:mi></m:math>&#160;is ill-conditioned with respect to inversion, then the error bounds for the computed eigenvalues and vectors may be large, although when the diagonal elements of <m:math><m:mi>B</m:mi></m:math>&#160;differ widely in magnitude the eigenvalues and eigenvectors may be less sensitive than the condition of <m:math><m:mi>B</m:mi></m:math>&#160;would suggest.  See Section 4.10 of <a class="ref" href="#ref252">Anderson <span class="italic">et al.</span> (1999)</a> for details of the error bounds.</div><div class="paramtext">The example program below illustrates the computation of approximate error bounds.</div><h2 class="standard"><a class="sec" name="fcomments" id="fcomments"/>8&#160;&#160;Further Comments</h2>
<div class="paramtext">The total number of floating point operations is proportional to <m:math>
 <m:msup><m:mi>n</m:mi><m:mn>3</m:mn></m:msup>
</m:math>.</div><div class="paramtext">The complex analogue of this routine is <a class="rout" href="../F08/f08sqf.xml">F08SQF (ZHEGVD)</a>.</div><h2 class="standard"><a class="sec" name="example" id="example"/>9&#160;&#160;Example</h2>
<div class="paramtext">This example finds all the eigenvalues and eigenvectors of the generalized symmetric eigenproblem <m:math>
 <m:mi>A</m:mi><m:mi>B</m:mi><m:mi>z</m:mi><m:mo>=</m:mo><m:mi>&#955;</m:mi><m:mi>z</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>0.24</m:mn></m:mtd>
   <m:mtd><m:mn>0.39</m:mn></m:mtd>
   <m:mtd><m:mn>0.42</m:mn></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>0.16</m:mn></m:mrow></m:mtd>
</m:mtr><m:mtr>
   <m:mtd><m:mn>0.39</m:mn></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>0.11</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mn>0.79</m:mn></m:mtd>
   <m:mtd><m:mn>0.63</m:mn></m:mtd>
</m:mtr><m:mtr>
   <m:mtd><m:mn>0.42</m:mn></m:mtd>
   <m:mtd><m:mn>0.79</m:mn></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>0.25</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mn>0.48</m:mn></m:mtd>
</m:mtr><m:mtr>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>0.16</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mn>0.63</m:mn></m:mtd>
   <m:mtd><m:mn>0.48</m:mn></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>0.03</m:mn></m:mrow></m:mtd>
</m:mtr>
</m:mtable></m:mfenced>
<m:mtext>&#8195; and &#8195;</m:mtext>
 <m:mi>B</m:mi>
 <m:mo>=</m:mo>
  <m:mfenced><m:mtable columnalign="right">
<m:mtr>
   <m:mtd><m:mn>4.16</m:mn></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>3.12</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mn>0.56</m:mn></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>0.10</m:mn></m:mrow></m:mtd>
</m:mtr><m:mtr>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>3.12</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mn>5.03</m:mn></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>0.83</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mn>1.09</m:mn></m:mtd>
</m:mtr><m:mtr>
   <m:mtd><m:mn>0.56</m:mn></m:mtd>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>0.83</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mn>0.76</m:mn></m:mtd>
   <m:mtd><m:mn>0.34</m:mn></m:mtd>
</m:mtr><m:mtr>
   <m:mtd><m:mrow><m:mo>-</m:mo><m:mn>0.10</m:mn></m:mrow></m:mtd>
   <m:mtd><m:mn>1.09</m:mn></m:mtd>
   <m:mtd><m:mn>0.34</m:mn></m:mtd>
   <m:mtd><m:mn>1.18</m:mn></m:mtd>
</m:mtr>
</m:mtable></m:mfenced>
 <m:mtext>,</m:mtext>
</m:math></td><td class="formula2"/></tr></table></div>

together with an estimate of the condition number of <m:math><m:mi>B</m:mi></m:math>, and approximate error bounds for the computed eigenvalues and eigenvectors.</div><div class="paramtext">The example program for <a class="rout" href="../F08/f08saf.xml">F08SAF (DSYGV)</a> illustrates solving a generalized symmetric eigenproblem of the form <m:math>
 <m:mi>A</m:mi><m:mi>z</m:mi><m:mo>=</m:mo><m:mi>&#955;</m:mi><m:mi>B</m:mi><m:mi>z</m:mi>
</m:math>.</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/f08scfe.f90">Program Text (f08scfe.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/f08scfe.d">Program&#160;Data (f08scfe.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/f08scfe.r">Program Results (f08scfe.r)</a></p>
<hr/><div><a class="rout" href="../../pdf/F08/f08scf.pdf">F08SCF (DSYGVD) (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>