diff --git a/src/linalg.cpp b/src/linalg.cpp
index f15217c0a..a2f0e7440 100644
--- a/src/linalg.cpp
+++ b/src/linalg.cpp
@@ -86,14 +86,6 @@ void DoubleVector::swap(int i, int j) {
   (*this)(i) = m;
 }
 
-bool DoubleVector::testNan() const
-{
-   for (std::size_t i = 0; i < x.size(); ++i)
-      if (::testNan(x[i]))
-         return true;
-   return false;
-}
-
 /*
  *  STANDARD INPUT / OUTPUT
  */
@@ -254,14 +246,6 @@ void DoubleMatrix::resize(int numberOfRows, int numberOfCols)
    setRows(numberOfRows);
 }
 
-bool DoubleMatrix::testNan() const
-{
-   for (std::size_t i = 0; i < x.size(); ++i)
-      if (::testNan(x[i]))
-         return true;
-   return false;
-}
-
 double DoubleMatrix::trace() const {
 #ifdef ARRAY_BOUNDS_CHECKING
   if (rows != cols)  {
diff --git a/src/linalg.h b/src/linalg.h
index 82c45e03a..83ac2eae1 100644
--- a/src/linalg.h
+++ b/src/linalg.h
@@ -160,7 +160,6 @@ class DoubleVector : public Indexable<double, DoubleVector> {
            return false;
      return true;
   }
-  bool testNan() const; ///< test for Nan elements
 };
 
 
@@ -328,7 +327,6 @@ class DoubleMatrix : public MatIndexable<double, DoubleMatrix> {
   /// resize matrix (Warning: can be slow because it internally copys a std::valarray<double>)
   void resize(int, int);
 
-  bool testNan() const; ///< test for Nan elements
   double trace() const;///< trace must only be performed on a square matrix
   DoubleMatrix transpose() const; ///< can be any size
   DoubleVector flatten() const; ///< matrix to vector, row by row