diff options
| author |  Igor Krivenko <anonymous@invalid.net> | 2011-12-09 23:38:41 +0100 |
|---|---|---|
| committer | Igor Krivenko <anonymous@invalid.net> | 2011-12-09 23:38:41 +0100 |
| commit | 36457178f9d12481e699d07c0ac8d25a7e6a854f (patch) | |
| tree | e9b12b3ed7e4102fcf1d0c4384fec3c1d4c94f37 /Eigen/src/Eigenvalues/EigenSolver.h | |
| parent | d400a6245ec0d86b0e3dd2af30e49349ae28b0f0 (diff) | |
bug #352:properly cast constants
Diffstat (limited to 'Eigen/src/Eigenvalues/EigenSolver.h')
| -rw-r--r-- | Eigen/src/Eigenvalues/EigenSolver.h | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h index ac4c4242d..6bd47cdda 100644 --- a/Eigen/src/Eigenvalues/EigenSolver.h +++ b/Eigen/src/Eigenvalues/EigenSolver.h @@ -432,7 +432,7 @@ void EigenSolver<MatrixType>::doComputeEigenvectors() const Scalar eps = NumTraits<Scalar>::epsilon(); // inefficient! this is already computed in RealSchur - Scalar norm = 0.0; + Scalar norm(0); for (Index j = 0; j < size; ++j) { norm += m_matT.row(j).segment((std::max)(j-1,Index(0)), size-(std::max)(j-1,Index(0))).cwiseAbs().sum(); @@ -452,7 +452,7 @@ void EigenSolver<MatrixType>::doComputeEigenvectors() // Scalar vector if (q == Scalar(0)) { - Scalar lastr=0, lastw=0; + Scalar lastr(0), lastw(0); Index l = n; m_matT.coeffRef(n,n) = 1.0; @@ -498,7 +498,7 @@ void EigenSolver<MatrixType>::doComputeEigenvectors() } else if (q < Scalar(0) && n > 0) // Complex vector { - Scalar lastra=0, lastsa=0, lastw=0; + Scalar lastra(0), lastsa(0), lastw(0); Index l = n-1; // Last vector component imaginary so matrix is triangular |