From: David Wells Date: Tue, 19 May 2015 16:05:11 +0000 (-0400) Subject: Explain the sparsity pattern changes in step-22. X-Git-Tag: v8.3.0-rc1~161^2 X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=refs%2Fpull%2F945%2Fhead;p=dealii.git Explain the sparsity pattern changes in step-22. In particular, step-22 has used three different sparsity patterns at different points. --- diff --git a/examples/step-22/doc/intro.dox b/examples/step-22/doc/intro.dox index 089e909414..ba836b21a8 100644 --- a/examples/step-22/doc/intro.dox +++ b/examples/step-22/doc/intro.dox @@ -731,7 +731,8 @@ element at a time; 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 -BlockCompressedSimpleSparsityPattern as a better adapted data structure, +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 consumption. Likewise, the implementation of the decomposition step in the SparseILU class was very inefficient and has been replaced by one that is