From: Wolfgang Bangerth Date: Sun, 24 Oct 2010 16:07:35 +0000 (+0000) Subject: Reference step-40. X-Git-Tag: v8.0.0~5206 X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=40839dc2c85da980e68be6e3b16e7453cdae13c1;p=dealii.git Reference step-40. git-svn-id: https://svn.dealii.org/trunk@22451 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/deal.II/examples/step-17/doc/intro.dox b/deal.II/examples/step-17/doc/intro.dox index 8178728464..18c8deeb6a 100644 --- a/deal.II/examples/step-17/doc/intro.dox +++ b/deal.II/examples/step-17/doc/intro.dox @@ -62,12 +62,9 @@ Note, however, that the only data structures we parallelize are matrices and vectors. We do, in particular, not split up the Triangulation and DoFHandler classes: each process still has a complete copy of these objects, and all processes have exact copies of what the other processes -have. Parallelizing the data structures used in hierarchic and unstructured -triangulations is a very hard problem, and we do not attempt to do so at -present. It also requires that many more aspects of the application program -have to be changed, since for example loops over all cells can only include -locally available cells. We thus went for the path of least resistance and -only parallelized the linear algebra part. +have. Doing so is slightly, though not much more complicated (from a user +perspective, it is much more complicated under the hood) to achieve and +we will show how to do this in step-40.