diff options
| author |  A. Unique TensorFlower <nobody@tensorflow.org> | 2016-02-11 15:14:11 -0800 |
|---|---|---|
| committer |  TensorFlower Gardener <gardener@tensorflow.org> | 2016-02-11 17:14:08 -0800 |
| commit | 80e682562a202d5ed57c871aa76f0faec4061590 (patch) | |
| tree | 1cfdc58299fe61b7a9e6648150d6e525acd7b5cc /third_party/eigen3/Eigen/QR | |
| parent | 3c933761e40101952fdcc0896bb3de1c5654192b (diff) | |
Switch the slow path in matrix_solve_ls to using Eigen::CompleteOrthogonalDecomposition (COD), which I recently contributed to Eigen in https://bitbucket.org/eigen/eigen/pull-requests/163/implement-complete-orthogonal/diff
The advantage of COD over column pivoted QR is that it is able to compute the minimum-norm solution when the matrix is rank-deficient, which is usually the desired behavior and makes it consistent with the fast path.
Change: 114483303
Diffstat (limited to 'third_party/eigen3/Eigen/QR')
| -rw-r--r-- | third_party/eigen3/Eigen/QR | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/third_party/eigen3/Eigen/QR b/third_party/eigen3/Eigen/QR index 9ecf7be16d..3bffd1df6d 100644 --- a/third_party/eigen3/Eigen/QR +++ b/third_party/eigen3/Eigen/QR @@ -1 +1 @@ -#include "eigen-eigen-726c779797e8/Eigen/QR" +#include "eigen-eigen-0b9ab889fac2/Eigen/QR" |