From d514f71be4f724d88f7652a28fbec05d5dea1318 Mon Sep 17 00:00:00 2001 From: wolf Date: Wed, 11 Oct 2000 13:41:04 +0000 Subject: [PATCH] Add some doc. git-svn-id: https://svn.dealii.org/trunk@3406 0785d39b-7218-0410-832d-ea1e28bc413d --- .../deal.II/include/grid/grid_refinement.h | 19 +++++++++++-------- 1 file changed, 11 insertions(+), 8 deletions(-) diff --git a/deal.II/deal.II/include/grid/grid_refinement.h b/deal.II/deal.II/include/grid/grid_refinement.h index 1815633c5a..b7701ea518 100644 --- a/deal.II/deal.II/include/grid/grid_refinement.h +++ b/deal.II/deal.II/include/grid/grid_refinement.h @@ -95,6 +95,10 @@ template class Vector; * A typical value for the fraction of the total error is 0.5. * @end{itemize} * + * There are other functions relying on different methods to flag + * cells for refinement or coarsening. See their documentation for + * further information. + * * For a more thorough discussion of advantages and disadvantages of the * different strategies for refinement, see the paper of R. Becker and * R. Rannacher titled "A Feed-Back Approach to Error Control in Finite @@ -107,7 +111,7 @@ template class Vector; * You can suppress coarsening or refining by giving zero as the fraction * for one of the operations. * - * @author Wolfgang Bangerth, 1998, 2000 + * @author Wolfgang Bangerth, 1998, 2000; Thomas Richter, 2000 */ class GridRefinement { @@ -302,13 +306,12 @@ class GridRefinement private: /** - * Sorts the vector ind as - * an index vector of a in - * increasing order. - * This implementation of - * quicksort seems to be faster - * than the STL version and is - * needed in + * Sorts the vector @p{ind} as an + * index vector of @p{a} in + * increasing order. This + * implementation of quicksort + * seems to be faster than the + * STL version and is needed in * @p{refine_and_coarsen_optimize} */ template -- 2.39.5