From: schrage Date: Thu, 29 Apr 1999 13:55:45 +0000 (+0000) Subject: First check-in, by no means finished. X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=1805fcd136dbfed406d39ec4d6b0a6f7aae4b3cd;p=dealii-svn.git First check-in, by no means finished. git-svn-id: https://svn.dealii.org/trunk@1222 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/deal.II/doc/tutorial/chapter-1.elements/solve.html b/deal.II/doc/tutorial/chapter-1.elements/solve.html new file mode 100644 index 0000000000..f37ac2df6c --- /dev/null +++ b/deal.II/doc/tutorial/chapter-1.elements/solve.html @@ -0,0 +1,120 @@ + + + + + +Solving the Problem + + + + + + + + +

Solving the Problem

+ +

+deal.II offers several solver classes: +

+ + + +

+Besides, there is a class named +SolverControl in order to +control the iterative solvers, i.e. to determine whether the iteration +should be continued. +

+ +

+We will begin with the discussion of the SolverControl +class and preconditioners, then discuss the solvers in more detail. +

+ +

Solver Control

+ +

+The class SolverControl is used by iterative solvers +to determine whether to continue with the iteration. It takes two +to three parameters: the maximum number of iterations and the criterium for +abortion, usually the residual and a flag controlling whether to log the +history (the value to be checked and the number of the iteration step). +SolverControl is initialized using
+SolverControl (const unsigned int n, const double tol, const bool log_history = false) + +

+Example:We initialize a solver control with +a maximum of 1000 iterations and a maximum residual of 1e-6. +

+ +
+
+#include 
+
+SolverControl control(1000,1e-6);
+
+
+ +

SolverBicgstab

+ +

+This class implements the Bicgstab algorithm by van der Worst. +It is initialized by
+SolverBicgstab (SolverControl &cn, VectorMemory &mem). +

+

+Example:We initialize a Bicgstab-solver for +the problem Au=f. +

+ +
+
+
+
+ + + + +
+ + + + + + + +
+
+Jan Schrage
+

+Last modified: $Date$ +

+ +