]> https://gitweb.dealii.org/ - dealii.git/commitdiff
Small clean-ups.
authorWolfgang Bangerth <bangerth@math.tamu.edu>
Mon, 17 Jan 2000 22:11:02 +0000 (22:11 +0000)
committerWolfgang Bangerth <bangerth@math.tamu.edu>
Mon, 17 Jan 2000 22:11:02 +0000 (22:11 +0000)
git-svn-id: https://svn.dealii.org/trunk@2242 0785d39b-7218-0410-832d-ea1e28bc413d

deal.II/lac/include/lac/sparse_vanka.templates.h

index 8b5ad7ca044209182b1d1621f4fc81fd60352b0a..25875fd708d3498f7fde28847bb78f4d6c3028f2 100644 (file)
@@ -52,6 +52,8 @@ SparseVanka<number>::compute_inverses ()
   const SparseMatrixStruct &structure
     = matrix->get_sparsity_pattern();
 
+  map<unsigned int, unsigned int> local_index;
+
                                   // traverse all rows of the matrix
                                   // which are selected
   for (unsigned int row=0; row< matrix->m() ; ++row)
@@ -73,7 +75,7 @@ SparseVanka<number>::compute_inverses ()
                                         // of each entry simply denotes
                                         // all degrees of freedom that
                                         // couple with #row#.
-       map<unsigned int, unsigned int> local_index;
+       local_index.clear ();
        for (unsigned int i=0; i<row_length; ++i)
          local_index.insert(pair<unsigned int, unsigned int>
                             (structure.column_number(row, i), i));
@@ -93,9 +95,6 @@ SparseVanka<number>::compute_inverses ()
                                             // irow (including irow itself)
            const unsigned int irow_length = structure.row_length(irow);
            
-                                            // copy rhs
-//         b(i) = src(irow);
-           
                                             // for all the DoFs that irow
                                             // couples with
            for (unsigned int j=0; j<irow_length; ++j)
@@ -110,16 +109,8 @@ SparseVanka<number>::compute_inverses ()
                                                 // #row#.
                const map<unsigned int, unsigned int>::const_iterator js
                  = local_index.find(col);
-                                                // if not, then still use
-                                                // this dof to modify the rhs
-                                                //
-                                                // note that if so, we already
-                                                // have copied the entry above
-               if (js == local_index.end())
-;//b(i) -= matrix->raw_entry(irow,j) * dst(col);
-               else
-                                                    // if so, then build the
-                                                    // matrix out of it
+
+               if (js != local_index.end())
                  (*inverses[row])(i,js->second) = matrix->raw_entry(irow,j);
              };
          };
@@ -156,6 +147,8 @@ SparseVanka<number>::operator ()(Vector<number2>       &dst,
   Vector<float> b (structure.max_entries_per_row());
   Vector<float> x (structure.max_entries_per_row());
   
+  map<unsigned int, unsigned int> local_index;
+
                                   // traverse all rows of the matrix
                                   // which are selected
   for (unsigned int row=0; row< matrix->m() ; ++row)
@@ -190,7 +183,7 @@ SparseVanka<number>::operator ()(Vector<number2>       &dst,
                                         // of each entry simply denotes
                                         // all degrees of freedom that
                                         // couple with #row#.
-       map<unsigned int, unsigned int> local_index;
+       local_index.clear ();
        for (unsigned int i=0; i<row_length; ++i)
          local_index.insert(pair<unsigned int, unsigned int>
                             (structure.column_number(row, i), i));

In the beginning the Universe was created. This has made a lot of people very angry and has been widely regarded as a bad move.

Douglas Adams


Typeset in Trocchi and Trocchi Bold Sans Serif.