]> https://gitweb.dealii.org/ - dealii-svn.git/commitdiff
Use link to step-22 instead of step-31.
authorbangerth <bangerth@0785d39b-7218-0410-832d-ea1e28bc413d>
Tue, 27 May 2008 19:16:33 +0000 (19:16 +0000)
committerbangerth <bangerth@0785d39b-7218-0410-832d-ea1e28bc413d>
Tue, 27 May 2008 19:16:33 +0000 (19:16 +0000)
git-svn-id: https://svn.dealii.org/trunk@16228 0785d39b-7218-0410-832d-ea1e28bc413d

deal.II/lac/include/lac/compressed_set_sparsity_pattern.h

index 544b6ae0d5514c6452dd58e1e43b446386a275a2..7cbcccf0e490963910425567ee5569d2aa7ae4ea 100644 (file)
@@ -51,8 +51,8 @@ template <typename number> 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.
  *
  * <h3>Interface</h3>
  *
@@ -89,8 +89,8 @@ template <typename number> 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

In the beginning the Universe was created. This has made a lot of people very angry and has been widely regarded as a bad move.

Douglas Adams


Typeset in Trocchi and Trocchi Bold Sans Serif.