diff options
author | Gael Guennebaud <g.gael@free.fr> | 2014-06-17 09:37:07 +0200 |
---|---|---|
committer | Gael Guennebaud <g.gael@free.fr> | 2014-06-17 09:37:07 +0200 |
commit | 95ecd582a37c5e3b3df47392f6807280488852f8 (patch) | |
tree | d85b06a5cde7c057d73fd84c448140f8cad00841 /doc/TutorialLinearAlgebra.dox | |
parent | b0979b8598054ff4beec7671b5aaf7c495ac23b1 (diff) |
Update decompositions tables
Diffstat (limited to 'doc/TutorialLinearAlgebra.dox')
-rw-r--r-- | doc/TutorialLinearAlgebra.dox | 26 |
1 files changed, 21 insertions, 5 deletions
diff --git a/doc/TutorialLinearAlgebra.dox b/doc/TutorialLinearAlgebra.dox index e6c41fd70..cb92ceeae 100644 --- a/doc/TutorialLinearAlgebra.dox +++ b/doc/TutorialLinearAlgebra.dox @@ -40,8 +40,9 @@ depending on your matrix and the trade-off you want to make: <tr> <th>Decomposition</th> <th>Method</th> - <th>Requirements on the matrix</th> - <th>Speed</th> + <th>Requirements<br/>on the matrix</th> + <th>Speed<br/> (small-to-medium)</th> + <th>Speed<br/> (large)</th> <th>Accuracy</th> </tr> <tr> @@ -49,6 +50,7 @@ depending on your matrix and the trade-off you want to make: <td>partialPivLu()</td> <td>Invertible</td> <td>++</td> + <td>++</td> <td>+</td> </tr> <tr class="alt"> @@ -56,6 +58,7 @@ depending on your matrix and the trade-off you want to make: <td>fullPivLu()</td> <td>None</td> <td>-</td> + <td>- -</td> <td>+++</td> </tr> <tr> @@ -63,20 +66,23 @@ depending on your matrix and the trade-off you want to make: <td>householderQr()</td> <td>None</td> <td>++</td> + <td>++</td> <td>+</td> </tr> <tr class="alt"> <td>ColPivHouseholderQR</td> <td>colPivHouseholderQr()</td> <td>None</td> - <td>+</td> <td>++</td> + <td>-</td> + <td>+++</td> </tr> <tr> <td>FullPivHouseholderQR</td> <td>fullPivHouseholderQr()</td> <td>None</td> <td>-</td> + <td>- -</td> <td>+++</td> </tr> <tr class="alt"> @@ -84,21 +90,31 @@ depending on your matrix and the trade-off you want to make: <td>llt()</td> <td>Positive definite</td> <td>+++</td> + <td>+++</td> <td>+</td> </tr> <tr> <td>LDLT</td> <td>ldlt()</td> - <td>Positive or negative semidefinite</td> + <td>Positive or negative<br/> semidefinite</td> <td>+++</td> + <td>+</td> <td>++</td> </tr> + <tr class="alt"> + <td>JacobiSVD</td> + <td>jacobiSvd()</td> + <td>None</td> + <td>- -</td> + <td>- - -</td> + <td>+++</td> + </tr> </table> All of these decompositions offer a solve() method that works as in the above example. For example, if your matrix is positive definite, the above table says that a very good -choice is then the LDLT decomposition. Here's an example, also demonstrating that using a general +choice is then the LLT or LDLT decomposition. Here's an example, also demonstrating that using a general matrix (not a vector) as right hand side is possible. <table class="example"> |