From 20a9b8ab60b51a3d9b9c99fc273fee8e35c4ae25 Mon Sep 17 00:00:00 2001
From: bangerth <bangerth@0785d39b-7218-0410-832d-ea1e28bc413d>
Date: Sun, 22 Jun 2014 11:29:53 +0000
Subject: [PATCH] Explain purpose. Build on step-26.

git-svn-id: https://svn.dealii.org/trunk@33072 0785d39b-7218-0410-832d-ea1e28bc413d
---
 deal.II/examples/step-52/doc/builds-on | 2 +-
 deal.II/examples/step-52/doc/intro.dox | 6 +++++-
 2 files changed, 6 insertions(+), 2 deletions(-)

diff --git a/deal.II/examples/step-52/doc/builds-on b/deal.II/examples/step-52/doc/builds-on
index 48a0f73876..1aabbdfdd6 100644
--- a/deal.II/examples/step-52/doc/builds-on
+++ b/deal.II/examples/step-52/doc/builds-on
@@ -1 +1 @@
-step-4
+step-26
diff --git a/deal.II/examples/step-52/doc/intro.dox b/deal.II/examples/step-52/doc/intro.dox
index d552ba90a8..e04f3c4d18 100644
--- a/deal.II/examples/step-52/doc/intro.dox
+++ b/deal.II/examples/step-52/doc/intro.dox
@@ -6,7 +6,11 @@
 <h1>Introducion</h1>
 
 This program shows how to use Runge-Kutta methods to solve a time-dependent
-problem.
+problem. It solves a small variation of the heat equation discussed first in
+step-26 but, since the purpose of this program is only to demonstrate using
+more advanced ways to interface with deal.II's time stepping algorithms, only
+solves a simple problem on a uniformly refined mesh.
+
 
 <h3>Problem statement</h3>
 
-- 
2.39.5