X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/book_gpu.git/blobdiff_plain/1874c46934f4ba7e8c2013d3829f65309456d292..17bff40b83bcdcc39769f9e59c70ffae1c525b72:/BookGPU/Chapters/chapter16/bdf.tex?ds=sidebyside

diff --git a/BookGPU/Chapters/chapter16/bdf.tex b/BookGPU/Chapters/chapter16/bdf.tex
index bd4e5d5..83abbc3 100644
--- a/BookGPU/Chapters/chapter16/bdf.tex
+++ b/BookGPU/Chapters/chapter16/bdf.tex
@@ -34,7 +34,7 @@ the index $i$ in $h_i$, $\alpha_1^i$ and $\alpha_2^i$ can be omitted.
 
 For the first step $t_1$,
 only the initial condition at $t_0$ is available.
-Therefore backward-Euler is used, i.e.,
+Therefore backward Euler is used, i.e.,
 \begin{equation}\label{eq:BE}
    \tfrac{1}{h_1}[q(x_1)-q(x_0)] + f(x_1) = b_1.
 \end{equation}
@@ -118,7 +118,7 @@ J\! =\! \frac{\ud x_M}{\ud x_0}
 
 \begin{algorithm}
 \caption{The matrix-free\index{matrix-free} method for
- Krylov subspace\index{Krylov subspace} construction.}
+ Krylov subspace\index{iterative method!Krylov subspace} construction.}
 \label{alg:mf_Gear}
   \KwIn{ current Krylov subspace basis vector $v$,
            time step lengths $h_i$,