diff --git a/Eigen/src/Eigenvalues/ComplexSchur.h b/Eigen/src/Eigenvalues/ComplexSchur.h
index 531ebf709..c45151e82 100644
--- a/Eigen/src/Eigenvalues/ComplexSchur.h
+++ b/Eigen/src/Eigenvalues/ComplexSchur.h
@@ -191,7 +191,7 @@ void ComplexSchur<MatrixType>::compute(const MatrixType& matrix, bool skipU)
     if(iter >= 30)
     {
       // FIXME : what to do when iter==MAXITER ??
-      std::cerr << "MAXITER" << std::endl;
+      //std::cerr << "MAXITER" << std::endl;
       return;
     }
 
diff --git a/Eigen/src/Sparse/CholmodSupport.h b/Eigen/src/Sparse/CholmodSupport.h
index 248f56533..fbd035ce4 100644
--- a/Eigen/src/Sparse/CholmodSupport.h
+++ b/Eigen/src/Sparse/CholmodSupport.h
@@ -233,7 +233,7 @@ bool SparseLLT<MatrixType,Cholmod>::solveInPlace(MatrixBase<Derived> &b) const
   cholmod_dense* x = cholmod_solve(CHOLMOD_A, m_cholmodFactor, &cdb, &m_cholmod);
   if(!x)
   {
-    std::cerr << "Eigen: cholmod_solve failed\n";
+    //std::cerr << "Eigen: cholmod_solve failed\n";
     return false;
   }
   b = Matrix<typename Base::Scalar,Dynamic,1>::Map(reinterpret_cast<typename Base::Scalar*>(x->x),b.rows());
diff --git a/Eigen/src/Sparse/DynamicSparseMatrix.h b/Eigen/src/Sparse/DynamicSparseMatrix.h
index 2594ffebc..d73dce229 100644
--- a/Eigen/src/Sparse/DynamicSparseMatrix.h
+++ b/Eigen/src/Sparse/DynamicSparseMatrix.h
@@ -236,7 +236,7 @@ class DynamicSparseMatrix
       {
         // remove all coefficients with innerCoord>=innerSize
         // TODO
-        std::cerr << "not implemented yet\n";
+        //std::cerr << "not implemented yet\n";
         exit(2);
       }
       if (m_data.size() != outerSize)
diff --git a/Eigen/src/Sparse/SuperLUSupport.h b/Eigen/src/Sparse/SuperLUSupport.h
index 9a5bec554..18a967539 100644
--- a/Eigen/src/Sparse/SuperLUSupport.h
+++ b/Eigen/src/Sparse/SuperLUSupport.h
@@ -397,7 +397,7 @@ void SparseLU<MatrixType,SuperLU>::compute(const MatrixType& a)
       case MinimumDegree_ATA        : m_sluOptions.ColPerm = MMD_ATA; break;
       case ColApproxMinimumDegree   : m_sluOptions.ColPerm = COLAMD; break;
       default:
-        std::cerr << "Eigen: ordering method \"" << Base::orderingMethod() << "\" not supported by the SuperLU backend\n";
+        //std::cerr << "Eigen: ordering method \"" << Base::orderingMethod() << "\" not supported by the SuperLU backend\n";
         m_sluOptions.ColPerm = NATURAL;
   };
 
@@ -448,7 +448,7 @@ void SparseLU<MatrixType,SuperLU>::compute(const MatrixType& a)
       &recip_pivot_gross, &rcond,
       &m_sluStat, &info, Scalar());
     #else
-    std::cerr << "Incomplete factorization is only available in SuperLU v4\n";
+    //std::cerr << "Incomplete factorization is only available in SuperLU v4\n";
     Base::m_succeeded = false;
     return;
     #endif
@@ -486,7 +486,7 @@ bool SparseLU<MatrixType,SuperLU>::solve(const MatrixBase<BDerived> &b,
       case SvTranspose  :  m_sluOptions.Trans = TRANS;   break;
       case SvAdjoint    :  m_sluOptions.Trans = CONJ;    break;
       default:
-        std::cerr << "Eigen: transposition  option \"" << transposed << "\" not supported by the SuperLU backend\n";
+        //std::cerr << "Eigen: transposition  option \"" << transposed << "\" not supported by the SuperLU backend\n";
         m_sluOptions.Trans = NOTRANS;
   }
 
@@ -513,7 +513,7 @@ bool SparseLU<MatrixType,SuperLU>::solve(const MatrixBase<BDerived> &b,
       &recip_pivot_gross, &rcond,
       &m_sluStat, &info, Scalar());
     #else
-    std::cerr << "Incomplete factorization is only available in SuperLU v4\n";
+    //std::cerr << "Incomplete factorization is only available in SuperLU v4\n";
     return false;
     #endif
   }