From: Wolfgang Bangerth Date: Mon, 22 May 2023 00:23:56 +0000 (-0600) Subject: Also link to the discussion from step-77. X-Git-Tag: v9.5.0-rc1~205^2 X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=refs%2Fpull%2F15244%2Fhead;p=dealii.git Also link to the discussion from step-77. --- diff --git a/examples/step-77/doc/results.dox b/examples/step-77/doc/results.dox index 5db6f9e1d8..3d1dd05b61 100644 --- a/examples/step-77/doc/results.dox +++ b/examples/step-77/doc/results.dox @@ -194,7 +194,9 @@ But iterative solvers also afford other opportunities. For example (and as discussed briefly in the introduction), we may not need to solve to very high accuracy (small tolerances) in early nonlinear iterations as long as we are still far away from the actual solution. This was the basis of the -Eisenstat-Walker trick mentioned there. +Eisenstat-Walker trick mentioned there. (This is also the underlying reason +why one can store the matrix in single precision rather than double precision, +see the discussion in the "Possibilities for extensions" section of step-15.) KINSOL provides the function that does the linear solution with a target tolerance that needs to be reached. We ignore it in the program above