devtools/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2026-04-10 11:34:33 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix linalg tut; remove the old one

Browse Source
This commit is contained in:
Benoit Jacob
2010-06-30 19:27:30 -04:00
parent 97f3c7f282
commit 962b30d75e
4 changed files with 7 additions and 318 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
doc/TopicLinearAlgebraDecompositions.dox
View File

@@ -249,8 +249,8 @@ namespace Eigen {
\b Notes:
<ul>
<li><a name="note1">\b 1: </a>There exist a couple of variants of the LDLT algorithm. Eigen's one produces a pure diagonal matrix, and therefore it cannot handle indefinite matrix, unlike Lapack's one which produces a block diagonal matrix.</li>
<li><a name="note2">\b 2: </a>Eigenvalues and Schur decompositions rely on iterative algorithms. Their convergence speed depends on how well the eigenvalues are separated.</li>
<li><a name="note1">\b 1: </a>There exist two variants of the LDLT algorithm. Eigen's one produces a pure diagonal D matrix, and therefore it cannot handle indefinite matrices, unlike Lapack's one which produces a block diagonal D matrix.</li>
<li><a name="note2">\b 2: </a>Eigenvalues, SVD and Schur decompositions rely on iterative algorithms. Their convergence speed depends on how well the eigenvalues are separated.</li>
</ul>
\section TopicLinAlgTerminology Terminology