diff options
| author |  Benoit Jacob <jacob.benoit.1@gmail.com> | 2010-10-19 21:56:11 -0400 |
|---|---|---|
| committer | Benoit Jacob <jacob.benoit.1@gmail.com> | 2010-10-19 21:56:11 -0400 |
| commit | 9044c98cff257a4f7429deaa78cae59132957db7 (patch) | |
| tree | 915a55a610fe4d8bbce080fc2d4a7184a221c948 /Eigen/src | |
| parent | e5073746f3686f01806d29724758c1df786013ed (diff) | |
work around stupid msvc error when constructing at compile time an expression
that involves a division by zero, even if the numeric type has floating point
Diffstat (limited to 'Eigen/src')
| -rw-r--r-- | Eigen/src/SVD/JacobiSVD.h | 3 |
1 files changed, 3 insertions, 0 deletions
diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h index f3b0ccce4..44880dcf4 100644 --- a/Eigen/src/SVD/JacobiSVD.h +++ b/Eigen/src/SVD/JacobiSVD.h @@ -239,6 +239,9 @@ struct ei_qr_preconditioner_impl<MatrixType, HouseholderQRPreconditioner, Precon * \a p is the greater dimension, meaning that it is still of the same order of complexity as the faster bidiagonalizing R-SVD algorithms. * In particular, like any R-SVD, it takes advantage of non-squareness in that its complexity is only linear in the greater dimension. * + * If the input matrix has inf or nan coefficients, the result of the computation is undefined, but the computation is guaranteed to + * terminate in finite (and reasonable) time. + * * The possible values for QRPreconditioner are: * \li ColPivHouseholderQRPreconditioner is the default. In practice it's very safe. It uses column-pivoting QR. * \li FullPivHouseholderQRPreconditioner, is the safest and slowest. It uses full-pivoting QR. |