From 024bc15a0ce5ed036e672436a76b0d3b9207f51e Mon Sep 17 00:00:00 2001 From: Martin Kronbichler Date: Thu, 11 Apr 2013 06:03:30 +0000 Subject: [PATCH] Fix typo. git-svn-id: https://svn.dealii.org/trunk@29255 0785d39b-7218-0410-832d-ea1e28bc413d --- deal.II/examples/step-37/doc/results.dox | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/deal.II/examples/step-37/doc/results.dox b/deal.II/examples/step-37/doc/results.dox index 6604cfce3a..0244754b53 100644 --- a/deal.II/examples/step-37/doc/results.dox +++ b/deal.II/examples/step-37/doc/results.dox @@ -208,7 +208,7 @@ more parallelism from more cells, exploited by the (involved) dynamic task scheduling approach taken in the cell loop of the MatrixFree class. Note that about 30% of the time in the matrix-free solver is spent on restriction and prolongation, which use sparse -matrices. So the speedup could be even better if all parts where done +matrices. So the speedup could be even better if all parts were done efficiently. Of course, this picture does not necessarily translate to all cases, as there -- 2.39.5