From 7fb7959f6ee8a36ff72ec9741593b82b8118fcbc Mon Sep 17 00:00:00 2001
From: kanschat <kanschat@0785d39b-7218-0410-832d-ea1e28bc413d>
Date: Thu, 15 May 2014 19:59:33 +0000
Subject: [PATCH] Change documentation for nonlinear problems

git-svn-id: https://svn.dealii.org/trunk@32910 0785d39b-7218-0410-832d-ea1e28bc413d
---
 deal.II/include/deal.II/algorithms/theta_timestepping.h | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/deal.II/include/deal.II/algorithms/theta_timestepping.h b/deal.II/include/deal.II/algorithms/theta_timestepping.h
index 43ade372df..0bfec47e27 100644
--- a/deal.II/include/deal.II/algorithms/theta_timestepping.h
+++ b/deal.II/include/deal.II/algorithms/theta_timestepping.h
@@ -65,11 +65,11 @@ namespace Algorithms
    * error term. In order to avoid a loss of convergence order, the
    * adaptive theta scheme can be used, where <i>#theta=½+c dt</i>.
    *
-   * Assume that we want to solve the equation <i>u' + Au = 0</i> with a
+   * Assume that we want to solve the equation <i>u' + F(u) = 0</i> with a
    * step size <i>k</i>.  A step of the theta scheme can be written as
    *
    * @f[
-   *   (M + \theta k A) u_{n+1} = (M - (1-\theta)k A) u_n.
+   *   M u_{n+1} + \theta k F(u_{n+1})  = M u_n - (1-\theta)k F(u_n).
    * @f]
    *
    * Here, <i>M</i> is the mass matrix. We see, that the right hand side
-- 
2.39.5