From: bangerth Date: Thu, 14 Aug 2008 17:22:07 +0000 (+0000) Subject: Fix a typo. X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=3733ca583ef5a0c6a87a2bb56fb69e6f5bc90c81;p=dealii-svn.git Fix a typo. git-svn-id: https://svn.dealii.org/trunk@16552 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/deal.II/examples/step-22/doc/results.dox b/deal.II/examples/step-22/doc/results.dox index d906d6c01f..fb174fe871 100644 --- a/deal.II/examples/step-22/doc/results.dox +++ b/deal.II/examples/step-22/doc/results.dox @@ -516,7 +516,7 @@ J.W. Demmel (Applied Numerical Linear Algebra, SIAM, 1997, section 6.6.6). For our specific problem with the ILU preconditioner for $A$, we certainly need to perform hundreds of iterations on the block system for large problem sizes (we won't beat CG!). Actually, this disfavors GMRES: During the GMRES -iterations, a basis of Krylov vectors is successively build up and some +iterations, a basis of Krylov vectors is successively built up and some operations are performed on these vectors. The more vectors are in this basis, the more operations and memory will be needed. The number of operations scales as ${\cal O}(n + k^2)$ and memory as ${\cal O}(kn)$, where $k$ is the number of