From: Guido Kanschat <dr.guido.kanschat@gmail.com>
Date: Fri, 8 Apr 2005 07:42:56 +0000 (+0000)
Subject: set small entries equal zero
X-Git-Tag: v8.0.0~14124
X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=efff040605563e498ebf028ffa37d9debaf1d8a6;p=dealii.git

set small entries equal zero


git-svn-id: https://svn.dealii.org/trunk@10423 0785d39b-7218-0410-832d-ea1e28bc413d
---

diff --git a/deal.II/deal.II/source/fe/fe_tools.cc b/deal.II/deal.II/source/fe/fe_tools.cc
index d81bcc5cfe..d8edb0d827 100644
--- a/deal.II/deal.II/source/fe/fe_tools.cc
+++ b/deal.II/deal.II/source/fe/fe_tools.cc
@@ -571,19 +571,24 @@ FETools::compute_embedding_matrices(const FiniteElement<dim>& fe,
 					   // solve the least squares
 					   // problem.
 	  const double result = H.least_squares(v_fine, v_coarse);
-	  Assert (result < 1.e-10, ExcLeastSquaresError(result));
+	  Assert (result < 1.e-12, ExcLeastSquaresError(result));
 	    
-					   // Finally copy into the
-					   // result matrix. Since the
-					   // matrix maps a coarse
-					   // grid function to a fine
-					   // grid function, the
-					   // columns are fine grid.
+					   // Copy into the result
+					   // matrix. Since the matrix
+					   // maps a coarse grid
+					   // function to a fine grid
+					   // function, the columns
+					   // are fine grid.
 	  for (unsigned int j=0;j<n;++j)
 	    matrix(j,i) = v_fine(j);
 	}
+				       // Remove small entries from
+				       // the matrix
+      for (unsigned int i=0; i<matrix.m(); ++i)
+	for (unsigned int j=0; j<matrix.n(); ++j)
+	  if (std::fabs(matrix(i,j)) < 1e-12)
+	    matrix(i,j) = 0.;
     }
-  
 }