From 10a7997a61acee773b2904bd0c549cf59194f234 Mon Sep 17 00:00:00 2001 From: David Wells Date: Tue, 19 May 2015 12:05:11 -0400 Subject: [PATCH] Explain the sparsity pattern changes in step-22. In particular, step-22 has used three different sparsity patterns at different points. --- examples/step-22/doc/intro.dox | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) 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 -- 2.39.5