]> https://gitweb.dealii.org/ - dealii-svn.git/commitdiff
Move contents of TODO file into .h and .cc files.
authorwolf <wolf@0785d39b-7218-0410-832d-ea1e28bc413d>
Thu, 29 Mar 2001 15:33:15 +0000 (15:33 +0000)
committerwolf <wolf@0785d39b-7218-0410-832d-ea1e28bc413d>
Thu, 29 Mar 2001 15:33:15 +0000 (15:33 +0000)
git-svn-id: https://svn.dealii.org/trunk@4335 0785d39b-7218-0410-832d-ea1e28bc413d

deal.II/lac/Todo [deleted file]
deal.II/lac/include/lac/solver_bicgstab.h
deal.II/lac/include/lac/sparse_ilu.templates.h
deal.II/lac/include/lac/vector.h
deal.II/lac/include/lac/vector_memory.h

diff --git a/deal.II/lac/Todo b/deal.II/lac/Todo
deleted file mode 100644 (file)
index 13179f9..0000000
+++ /dev/null
@@ -1,21 +0,0 @@
-=================================================================
-====== Things to be done for the lac library     ================
-=================================================================
-
-
-Make ILU decomposition faster by following the comment in the
-  innermost loop (about the better use of the index j).
-
-
-Why not replace Vector::scale by Vector::operator *= ?
-
-
-Use the commented-out version in PreconditionBlock::invert_diagblocks
-  using the try-catch clauses
-
-
-GrowingVectorMemory is not thread-safe. Use a Mutex to fix this.
-
-
-Implement "use the length of the computed orthogonal residual" in the
-  BiCGStab method.
\ No newline at end of file
index fb5b13040e687e76176c9cc0661cff5ff4b195fa..63a282e657b37aae7563d59d1c88f57bddf4d571 100644 (file)
@@ -284,6 +284,7 @@ typename Solver<VECTOR>::ReturnState
 SolverBicgstab<VECTOR>::iterate(const MATRIX& A,
                                const PRECONDITIONER& precondition)
 {
+//TODO:[GK] Implement "use the length of the computed orthogonal residual" in the BiCGStab method.
   SolverControl::State state = SolverControl::iterate;
   alpha = omega = rho = 1.;
 
index c77bd18ac5751d617591d79d6d5f79162396a565..b12ad24d3eebe00a28d7d4483cfe1bbaf68c1d34 100644 (file)
@@ -186,6 +186,7 @@ void SparseILU<number>::decompose (const SparseMatrix<somenumber> &matrix,
               j<&column_numbers[rowstart_indices[row+1]];
               ++j)
            {
+//TODO:[WB] make code faster by using the following comment          
                                               // note: this inner loop could
                                               // be made considerable faster
                                               // if we consulted the row
index 58caee7cc3dce7254d9bbf36a4a0055ca9f359bf..723648035f34a546c1fe53b9983ae266ba0f3986 100644 (file)
@@ -367,6 +367,7 @@ class Vector
                                      * Scale each element of the vector by the
                                      * given factor.
                                      */
+//TODO:[?] Why not have an operator *= instead of/in addition to `scale'?    
     void scale (const Number factor);
     
                                     /**
index aa7c21f77d42f1cdb994272f3a183e58f2b8c7c1..787ce13ce9137425971189958ffd3a767ef611ef 100644 (file)
@@ -109,6 +109,7 @@ class PrimitiveVectorMemory : public VectorMemory<Vector>
  * 
  * @author Guido Kanschat, 1999
  */
+//TODO:[GK,WB] GrowingVectorMemory is not thread-safe. use a mutex to synchronise
 template<class Vector = ::Vector<double> >
 class GrowingVectorMemory : public VectorMemory<Vector>
 {

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.