From: bangerth Date: Tue, 27 May 2008 19:16:33 +0000 (+0000) Subject: Use link to step-22 instead of step-31. X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=7f4f59e079713c75144a36d25a8732bb8d4b0ec2;p=dealii-svn.git Use link to step-22 instead of step-31. git-svn-id: https://svn.dealii.org/trunk@16228 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/deal.II/lac/include/lac/compressed_set_sparsity_pattern.h b/deal.II/lac/include/lac/compressed_set_sparsity_pattern.h index 544b6ae0d5..7cbcccf0e4 100644 --- a/deal.II/lac/include/lac/compressed_set_sparsity_pattern.h +++ b/deal.II/lac/include/lac/compressed_set_sparsity_pattern.h @@ -51,8 +51,8 @@ template class SparseMatrix; * module. * * This class is an example of the "dynamic" type of @ref Sparsity. It - * is discussed in the @ref step_27 "step-27" and @ref step_31 - * "step-31" tutorial programs. + * is discussed in the @ref step_27 "step-27" and @ref step_22 + * "step-22" tutorial programs. * *

Interface

* @@ -89,8 +89,8 @@ template class SparseMatrix; * situations, but seems to work much better than the * CompressedSparsityPattern in the context of hp-adaptivity (see for * example @ref step_27 "step-27"), or generally when there are many - * nonzero entries in each row of a matrix (see @ref step_31 - * "step-31"). On the other hand, a benchmark where nonzero entries + * nonzero entries in each row of a matrix (see @ref step_22 + * "step-22"). On the other hand, a benchmark where nonzero entries * were randomly inserted into the sparsity pattern revealed that this * class is slower by a factor 4-6 in this situation. Hence, currently * the suggestion is to carefully analyze which of the