+++ /dev/null
-=================================================================
-====== 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
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.;
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
* 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);
/**
*
* @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>
{