From f21bec8dd1213ad6fda223a22ff7f070cd69b95f Mon Sep 17 00:00:00 2001 From: bangerth Date: Wed, 1 Aug 2007 21:30:29 +0000 Subject: [PATCH] Start to write. git-svn-id: https://svn.dealii.org/trunk@14871 0785d39b-7218-0410-832d-ea1e28bc413d --- deal.II/examples/step-27/doc/intro.dox | 10 ++++++++-- 1 file changed, 8 insertions(+), 2 deletions(-) diff --git a/deal.II/examples/step-27/doc/intro.dox b/deal.II/examples/step-27/doc/intro.dox index 648e2fc21b..6a8852962d 100644 --- a/deal.II/examples/step-27/doc/intro.dox +++ b/deal.II/examples/step-27/doc/intro.dox @@ -1,6 +1,13 @@

Introduction

+This tutorial program attempts to show how to use $hp$ finite element methods +with deal.II. It solves the Laplace equation and so builds only on the first +few tutorial programs, in particular on @ref step_4 "step-4" for dimension +independent programming and @ref step_6 "step-6" for adaptive mesh +refinement. + +

A simple indicator for smoothness

One of the central pieces of the adaptive finite element method is that we @@ -8,8 +15,7 @@ inspect the computed solution (a posteriori) with an indicator that tells us which are the cells where the error is largest, and then refine them. In many of the other tutorial programs, we use the KellyErrorEstimator class to get an indication of the size of the error on a cell, although we also discuss more -complicated strategies in some programs, most importantly in @ref step_14 -"step-14". +complicated strategies in some programs, most importantly in @ref step_14 "step-14". In any case, as long as the decision is only "refine this cell" or "do not refine this cell", the actual refinement step is not particularly -- 2.39.5