From: wolf Date: Tue, 5 Apr 2005 19:12:52 +0000 (+0000) Subject: . X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=9e7123465669800486a6da0809ff6cedb18302cb;p=dealii-svn.git . git-svn-id: https://svn.dealii.org/trunk@10356 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/deal.II/doc/tutorial/chapter-2.step-by-step/step-18.data/intro.tex b/deal.II/doc/tutorial/chapter-2.step-by-step/step-18.data/intro.tex index ae07804062..41327f1923 100644 --- a/deal.II/doc/tutorial/chapter-2.step-by-step/step-18.data/intro.tex +++ b/deal.II/doc/tutorial/chapter-2.step-by-step/step-18.data/intro.tex @@ -3,14 +3,17 @@ \begin{document} This tutorial program is another one in the series on the elasticity problem -that we have already started with step-8 and step-17. It extends it into -two different directions: first, it solves the quasistatic but time -dependent elasticity problem for large deformations with a Lagrangian mesh -movement approach. Secondly, it shows some more techniques for solving such -problems using parallel processing with PETSc's linear algebra; however, as -before in step-17, the program runs just as fine on a single sequential -machine as long as you have PETSc installed. Finally, a good number of -assorted improvements and techniques are demonstrated that have not been shown -yet in previous programs. +that we have already started with step-8 and step-17. It extends it into two +different directions: first, it solves the quasistatic but time dependent +elasticity problem for large deformations with a Lagrangian mesh movement +approach. Secondly, it shows some more techniques for solving such problems +using parallel processing with PETSc's linear algebra; however, as before in +step-17, the program runs just as fine on a single sequential machine as long +as you have PETSc installed. In addition to this, we show how to work around +the main bottleneck of step-17, namely there that we only generated graphical +output from one process, and that this scaled very badly with larger numbers +of processes and on large problems. Finally, a good number of assorted +improvements and techniques are demonstrated that have not been shown yet in +previous programs. \end{document}