From: Wolfgang Bangerth <bangerth@colostate.edu>
Date: Mon, 3 Jun 2019 20:11:10 +0000 (-0600)
Subject: Document the new tutorial programs.
X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=eb00f331bc44e2ed218a7a75083e5807eb58f34d;p=release-papers.git

Document the new tutorial programs.
---

diff --git a/9.1/paper.tex b/9.1/paper.tex
index ee54990..05ad6fd 100644
--- a/9.1/paper.tex
+++ b/9.1/paper.tex
@@ -510,16 +510,45 @@ largest runs now at XYZ (Kronbichler?)}
 \subsection{New and improved tutorial and code gallery programs}
 \label{subsec:steps}
 
-\marginpar{Missing}
-
-talk about the new programs; also mention updating for C++11 style
+Many of the \dealii{} tutorial programs were substantially revised as
+part of this release. In particular, we have converted many places
+that now allow for simpler code through the use of C++11 features such
+as range-based for loops and lambda functions.
 
-
-\texttt{step-64} demonstrates the usage of matrix-free methods on Nvidia GPUs.
+In addition, there are four new tutorial programs and one new code
+gallery program:
+\begin{itemize}
+\item \texttt{step-61} is a program that implements the ``weak
+  Galerkin'' method to solve the Laplace equation. Weak Galerkin
+  methods are related to the Hybridized Discontinuous Galerkin method
+  in that they introduce degrees of freedom on the interfaces between
+  cells, but they do not require the reformulation of the problem as a
+  first-order system and instead re-define what the gradient of a
+  discontinuous function is.
+
+\item \texttt{step-62} demonstrates the solution of problems related
+  to phononic or photonic crystals. Among the techniques shown in this
+  program is the solution of complex-valued linear systems, and the
+  use of absorbing boundary conditions through the Perfectly Matched
+  Layer technique.
+
+\item \texttt{step-63} implements a multigrid preconditioner
+  and solver for the advection-diffusion equation, yielding optimal
+  complexity.
+
+\item \texttt{step-64} demonstrates the usage of matrix-free methods on Nvidia GPUs.
 GPUs are advantageous for these kind of operations because of their superior
 hardware characteristics, in particular a higher memory bandwidth than server
 CPUs within a given power envelope.
 
+\item The \texttt{MCMC-Laplace} code gallery program is a code useful
+  for the forward solution that is used as a building block in
+  Bayesian inverse problems, and for sampling the parameter space
+  through a Metropolis-Hastings sampler (a kind of Monte Carlo
+  Markov Chain method).
+\end{itemize}
+
+
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \subsection{Incompatible changes}