From: alberto sartori Date: Tue, 27 Oct 2015 08:28:38 +0000 (+0100) Subject: fixed typo intro step 20 X-Git-Tag: v8.4.0-rc2~276^2 X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=08bede968b93f7ff74ada040496d8a7644f15ea7;p=dealii.git fixed typo intro step 20 --- diff --git a/examples/step-20/doc/intro.dox b/examples/step-20/doc/intro.dox index b1e3ba846d..5033c9b00e 100644 --- a/examples/step-20/doc/intro.dox +++ b/examples/step-20/doc/intro.dox @@ -360,7 +360,7 @@ route and shows that solving any linear system can be done in just But then, this is a tutorial: we teach how to do things. Consequently, in the following, we will introduce some techniques that can be used in cases like these. Namely, we will consider the linear system as not consisting of one -large matrix and vectors, but we will want to decompose matrices into vectors +large matrix and vectors, but we will want to decompose matrices into blocks that correspond to the individual operators that appear in the system. We note that the resulting solver is not optimal -- there are much better ways, for example those explained in the results section of step-22 or