]> https://gitweb.dealii.org/ - dealii-svn.git/commitdiff
Fix a typo.
authorbangerth <bangerth@0785d39b-7218-0410-832d-ea1e28bc413d>
Thu, 14 Aug 2008 17:22:07 +0000 (17:22 +0000)
committerbangerth <bangerth@0785d39b-7218-0410-832d-ea1e28bc413d>
Thu, 14 Aug 2008 17:22:07 +0000 (17:22 +0000)
git-svn-id: https://svn.dealii.org/trunk@16552 0785d39b-7218-0410-832d-ea1e28bc413d

deal.II/examples/step-22/doc/results.dox

index d906d6c01f1cd63a060ee9e6293e46fc66f1e213..fb174fe8717701b6887f5db94fe901605a755bfe 100644 (file)
@@ -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 

In the beginning the Universe was created. This has made a lot of people very angry and has been widely regarded as a bad move.

Douglas Adams


Typeset in Trocchi and Trocchi Bold Sans Serif.