Fix bug #314:

- remove most of the metaprogramming kung fu in MathFunctions.h (only keep functions that differs from the std)
- remove the overloads for array expression that were in the std namespace

1 files changed, 2 insertions, 1 deletions

diff --git a/unsupported/Eigen/src/IterativeSolvers/IncompleteCholesky.h b/unsupported/Eigen/src/IterativeSolvers/IncompleteCholesky.h
index 5bc41c0f8..746d29473 100644
--- a/unsupported/Eigen/src/IterativeSolvers/IncompleteCholesky.h
+++ b/unsupported/Eigen/src/IterativeSolvers/IncompleteCholesky.h
@@ -116,6 +116,7 @@ template<typename Scalar, int _UpLo, typename OrderingType>
 template<typename _MatrixType>
 void IncompleteCholesky<Scalar,_UpLo, OrderingType>::factorize(const _MatrixType& mat)
 {
+  using std::sqrt;
   eigen_assert(m_analysisIsOk && "analyzePattern() should be called first"); 
   
   // FIXME Stability: We should probably compute the scaling factors and the shifts that are needed to ensure a succesful LLT factorization and an efficient preconditioner. 
@@ -182,7 +183,7 @@ void IncompleteCholesky<Scalar,_UpLo, OrderingType>::factorize(const _MatrixType
        m_info = NumericalIssue; 
        return; 
      }
-     RealScalar rdiag = internal::sqrt(RealScalar(diag));
+     RealScalar rdiag = sqrt(RealScalar(diag));
      Scalar scal = Scalar(1)/rdiag; 
      vals[colPtr[j]] = rdiag;
      // Insert the largest p elements in the matrix and scale them meanwhile