aboutsummaryrefslogtreecommitdiffhomepage
path: root/doc/LinearLeastSquares.dox
diff options
context:
space:
mode:
Diffstat (limited to 'doc/LinearLeastSquares.dox')
-rw-r--r--doc/LinearLeastSquares.dox27
1 files changed, 27 insertions, 0 deletions
diff --git a/doc/LinearLeastSquares.dox b/doc/LinearLeastSquares.dox
new file mode 100644
index 000000000..ab21a87ae
--- /dev/null
+++ b/doc/LinearLeastSquares.dox
@@ -0,0 +1,27 @@
+namespace Eigen {
+
+/** \eigenManualPage LinearLeastSquares Solving linear least squares problems
+
+lede
+
+\eigenAutoToc
+
+\section LinearLeastSquaresCopied Copied
+
+The best way to do least squares solving is with a SVD decomposition. Eigen provides one as the JacobiSVD class, and its solve()
+is doing least-squares solving.
+
+Here is an example:
+<table class="example">
+<tr><th>Example:</th><th>Output:</th></tr>
+<tr>
+ <td>\include TutorialLinAlgSVDSolve.cpp </td>
+ <td>\verbinclude TutorialLinAlgSVDSolve.out </td>
+</tr>
+</table>
+
+For more information, including faster but less reliable methods, read our page concentrating on \ref LinearLeastSquares "linear least squares problems".
+
+*/
+
+}