From 1eea165a7e814665741d284b1a08dc24eb8e7e8f Mon Sep 17 00:00:00 2001 From: Timo Heister Date: Sat, 13 Aug 2016 14:43:56 -0400 Subject: [PATCH] rephrase tutorial --- examples/step-22/doc/intro.dox | 11 +++++------ 1 file changed, 5 insertions(+), 6 deletions(-) diff --git a/examples/step-22/doc/intro.dox b/examples/step-22/doc/intro.dox index 0271a23b0f..32def7a482 100644 --- a/examples/step-22/doc/intro.dox +++ b/examples/step-22/doc/intro.dox @@ -766,12 +766,11 @@ comparison of their results. Apart from this, many other algorithms have been tested and improved during the creation of this program. For example, in building the sparsity pattern, -we originally used a BlockCompressedSparsityPattern object that added one -element at a time (this no longer exists in deal.II); however, its data -structures are poorly adapted for the -large numbers of nonzero entries per row created by our discretization in -3d, leading to a quadratic behavior. Replacing the internal algorithms in -deal.II to set many elements at a time, and using a +we originally used a (now no longer existing) BlockCompressedSparsityPattern +object that added one element at a time; however, its data structures were poorly +adapted for the large numbers of nonzero entries per row created by our +discretization in 3d, leading to a quadratic behavior. Replacing the internal +algorithms in deal.II to set many elements at a time, and using a BlockCompressedSimpleSparsityPattern (which has, as of early 2015, been in turn replaced by BlockDynamicSparsityPattern) as a better adapted data structure, removed this bottleneck at the price of a slightly higher memory -- 2.39.5