Link to step-86.

diff --git a/examples/step-26/doc/results.dox b/examples/step-26/doc/results.dox
index db8010651ff0fe20a03adb29e1c6d95c13949f10..6a69efd0d9a7e6ff235b0806c08876a79f777624 100644 (file)
--- a/examples/step-26/doc/results.dox
+++ b/examples/step-26/doc/results.dox
@@ -103,9 +103,11 @@ not be implementing finite element methods by hand but use deal.II instead.
 Indeed, deal.II has interfaces to one such time stepping library,
 [SUNDIALS](https://computing.llnl.gov/projects/sundials), already available.
 In particular, the SUNDIALS::ARKode class would make for a great starting
-point for the use of much better (and much more accurate) time steppers;
+point for the use of much better (and much more accurate) time steppers,
+as would PETScWrappers::TimeStepper;
 the methods one would then get also implement the automatic time step
-control mentioned above.
+control mentioned above. To see how this works, take a look at
+step-86.
 
 
 <h4>Better refinement criteria</h4>