1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML>
<HEAD>
<TITLE>void Routines for symmetric eigenvalue problems.::mxTriEig</TITLE>
<META NAME="GENERATOR" CONTENT="DOC++ 3.4.8">
</HEAD>
<BODY BGCOLOR="#ffffff">
<H2>void <A HREF="#DOC.DOCU"> Routines for symmetric eigenvalue problems.::mxTriEig</A></H2><H2>(<!1><A HREF="Vec.html">Vec</A>* a,<BR> <!1><A HREF="Vec.html">Vec</A>* <!1><A HREF="SVM.html#DOC.42.4">b</A>,<BR> <!1><A HREF="Mat.html">Mat</A>* mat_q)</H2><BLOCKQUOTE>Finds eigenvalues of symmetric tridiagonal matrices.</BLOCKQUOTE>
<A NAME="DOC.DOCU"></A>
<HR>
<H2>Documentation</H2>
<BLOCKQUOTE>Finds eigenvalues of symmetric tridiagonal matrices.
The matrix is represented by a pair of vectors <TT>a</TT> (diag entries)
and <TT>b</TT> (sub-diag and super-diag entries).
Eigenvalues in <TT>a</TT> on return, and eigenvectors in <TT>mat_q</TT>, if this one
is not <TT>NULL</TT>.</BLOCKQUOTE>
<DL><DT><DD></DL><P><P><I><A HREF="index.html">Alphabetic index</A></I> <I><A HREF="HIER.html">HTML hierarchy of classes</A> or <A HREF="HIERjava.html">Java</A></I></P><HR>
<BR>
This page was generated with the help of <A HREF="http://docpp.sourceforge.net">DOC++</A>.
</BODY>
</HTML>
|
