From: bangerth Date: Mon, 25 Feb 2008 15:59:07 +0000 (+0000) Subject: Escape one word to avoid matching it with the namespace of same name X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=f79f57f00fd8f07a7621e9809d6d229aa549ec8c;p=dealii-svn.git Escape one word to avoid matching it with the namespace of same name git-svn-id: https://svn.dealii.org/trunk@15769 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/deal.II/examples/step-31/doc/intro.dox b/deal.II/examples/step-31/doc/intro.dox index db478ac095..08fb730d2a 100644 --- a/deal.II/examples/step-31/doc/intro.dox +++ b/deal.II/examples/step-31/doc/intro.dox @@ -463,7 +463,7 @@ O}(NB^2)$ operations. In 2d, this is ${\cal O}(N^2)$; though this is a higher complexity than, for example, assembling the linear system which takes ${\cal O}(N)$, the constant for computing the decomposition is so small that it doesn't become the dominating factor in the entire program until we get to -very large numbers of unknowns in the high 100,000s or more.) +very large %numbers of unknowns in the high 100,000s or more.) The situation changes in 3d, because there we quickly have many more unknowns and the bandwidth of matrices (which determines the number of