The output of the program looks as follows (the number of iterations
may vary by one or two, depending on your computer, since this is
often dependent on the round-off accuracy of floating point
-operations, which differs between micro-processors):
+operations, which differs between processors):
<pre><code>
Solving problem in 2 space dimensions.
Number of active cells: 256
Total number of cells: 341
Number of degrees of freedom: 289
- 25 CG iterations needed to obtain convergence.
+ 26 CG iterations needed to obtain convergence.
Solving problem in 3 space dimensions.
Number of active cells: 4096
Total number of cells: 4681
Number of degrees of freedom: 4913
- 29 CG iterations needed to obtain convergence.
+ 30 CG iterations needed to obtain convergence.
</code></pre>
It is obvious that in three spatial dimensions the number of cells and
therefore also the number of degrees of freedom is
<p>
The right picture shows the three dimensional grid, colorized by the
solutions values. 3D grids are difficult to visualize, which can be
-seen here already, even though the grid is not locally refined.
+seen here already, even though the grid is not even locally refined.
</p>