From 5da060802ebb07fae9dd8d1f5c6c274e206d8378 Mon Sep 17 00:00:00 2001 From: bangerth Date: Wed, 23 Jun 2010 13:38:45 +0000 Subject: [PATCH] Better links. git-svn-id: https://svn.dealii.org/trunk@21277 0785d39b-7218-0410-832d-ea1e28bc413d --- deal.II/doc/doxygen/headers/matrices.h | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/deal.II/doc/doxygen/headers/matrices.h b/deal.II/doc/doxygen/headers/matrices.h index d6ca6152e6..794881e1c1 100644 --- a/deal.II/doc/doxygen/headers/matrices.h +++ b/deal.II/doc/doxygen/headers/matrices.h @@ -2,7 +2,7 @@ // $Id$ // Version: $Name$ // -// Copyright (C) 2003, 2004, 2006, 2007 by the deal.II authors +// Copyright (C) 2003, 2004, 2006, 2007, 2010 by the deal.II authors // // This file is subject to QPL and may not be distributed // without copyright and license information. Please refer @@ -122,9 +122,9 @@ * difficult to estimate the maximal number of entries per row. Consequently, * a common strategy is to first build and intermediate sparsity pattern that * uses a less efficient storage scheme during construction of the sparsity - * pattern and later copy it directly into the static, compressed form (see, - * for example the step-11, step-18, and @ref - * step_27 "step-27" tutorial programs). + * pattern and later copy it directly into the static, compressed form. Most + * tutorial programs do this, starting at step-2 (see also, for example the + * step-11, step-18, and step-27 tutorial programs). * * *

"Dynamic" or "compressed" sparsity patterns

-- 2.39.5