From: bangerth Date: Fri, 24 Feb 2012 22:39:10 +0000 (+0000) Subject: Minor latex fix. X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=76132ba6c76e2105cde05a0c9f06401f0f671277;p=dealii-svn.git Minor latex fix. git-svn-id: https://svn.dealii.org/trunk@25167 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/deal.II/examples/step-41/doc/step-41-doc.tex b/deal.II/examples/step-41/doc/step-41-doc.tex index 2c1f82e565..44c64ac145 100644 --- a/deal.II/examples/step-41/doc/step-41-doc.tex +++ b/deal.II/examples/step-41/doc/step-41-doc.tex @@ -223,7 +223,7 @@ pp. 865-888. The algorithm for the primal-dual active set method works as follows: \begin{itemize} - \item [(0)] Initialize $\mathcal{A}_k$ and $\mathcal{F}_k$, such that $\mathcal{S}=\mathcal{A}_k\cup\mathcal{F}_k$ and $\mathcal{A}_k\cap\mathcal{F}_k=\O{}$ and set $k=1$. + \item [(0)] Initialize $\mathcal{A}_k$ and $\mathcal{F}_k$, such that $\mathcal{S}=\mathcal{A}_k\cup\mathcal{F}_k$ and $\mathcal{A}_k\cap\mathcal{F}_k=\emptyset$ and set $k=1$. \item [(1)] Find the primal-dual pair $(U^k,\Lambda^k)$ that satisfies \begin{align*} AU^k + B\Lambda^k &= F,\\ @@ -370,6 +370,6 @@ and the AMG preconditioner from Trilinos. This tutorial is quite similar to step-4. But to solve the obstacle problem, two new methods are implemented: assemble\_mass\_matrix\_diagonal (TrilinosWrappers::SparseMatrix \&mass\_matrix) and -update\_solution\_and\_constraints (). +update\_solution\_and\_constraints (). -\end{document} \ No newline at end of file +\end{document}