From: Wolfgang Bangerth <bangerth@math.tamu.edu>
Date: Fri, 12 Jun 2015 21:59:46 +0000 (-0500)
Subject: Provide links to recently recorded video lectures.
X-Git-Tag: v8.3.0-rc1~117^2~1
X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=b2dcc4638be8cb569ef69613771dff9fe4ae1d9f;p=dealii.git

Provide links to recently recorded video lectures.
---

diff --git a/examples/step-1/doc/intro.dox b/examples/step-1/doc/intro.dox
index 6168f5fa30..14dbb8054f 100644
--- a/examples/step-1/doc/intro.dox
+++ b/examples/step-1/doc/intro.dox
@@ -186,7 +186,7 @@ are worthwhile browsing through before you start any large-scale programming:
 As a general recommendation: If you expect to spend more than a few days
 writing software in the future, do yourself the favor of learning tools that
 can make your life more productive, in particular debuggers and integrated
-development environments. (@dealiiVideoLectureSeeAlso{7,8,25})
+development environments. (@dealiiVideoLectureSeeAlso{7,8,8.01,25})
 You will find that you will get the time spent
 learning these tools back severalfold soon by being more productive!
 Several of the video lectures referenced above show how to use tools
diff --git a/examples/step-15/doc/intro.dox b/examples/step-15/doc/intro.dox
index 23be1d960e..5f103cafa6 100644
--- a/examples/step-15/doc/intro.dox
+++ b/examples/step-15/doc/intro.dox
@@ -29,6 +29,9 @@ locally be constructed as a graph but not globally.
 Because the equation is non-linear, we can't solve it directly. Rather, we
 have to use Newton's method to compute the solution iteratively.
 
+@dealiiVideoLecture{31.5,31.55,31.6}
+(@dealiiVideoLectureSeeAlso{31.65,31.7})
+
 
 
 <h3>Classical formulation</h3>
diff --git a/examples/step-22/doc/intro.dox b/examples/step-22/doc/intro.dox
index ba836b21a8..4b00e31674 100644
--- a/examples/step-22/doc/intro.dox
+++ b/examples/step-22/doc/intro.dox
@@ -141,6 +141,7 @@ form, and consequently a symmetric (if indefinite) system matrix.
 <h3>%Boundary conditions</h3>
 
 @dealiiVideoLecture{21.5}
+(@dealiiVideoLectureSeeAlso{21.55,21.6,21.65})
 
 The weak form just derived immediately presents us with different
 possibilities for imposing boundary conditions:
diff --git a/examples/step-26/doc/intro.dox b/examples/step-26/doc/intro.dox
index 289aff53eb..616844299c 100644
--- a/examples/step-26/doc/intro.dox
+++ b/examples/step-26/doc/intro.dox
@@ -2,6 +2,7 @@
 <h1>Introduction</h1>
 
 @dealiiVideoLecture{29,30}
+(@dealiiVideoLectureSeeAlso{31.7})
 
 
 This program implements the heat equation
diff --git a/examples/step-40/doc/intro.dox b/examples/step-40/doc/intro.dox
index 3e3a3c6799..5b4512ecde 100644
--- a/examples/step-40/doc/intro.dox
+++ b/examples/step-40/doc/intro.dox
@@ -26,7 +26,7 @@ instructions for PETSc.
 <a name="Intro"></a>
 <h1>Introduction</h1>
 
-@dealiiVideoLecture{41.5}
+@dealiiVideoLecture{41.5,41.75}
 
 Given today's computers, most finite element computations can be done on
 a single machine. The majority of previous tutorial programs therefore
diff --git a/include/deal.II/numerics/matrix_tools.h b/include/deal.II/numerics/matrix_tools.h
index 2ca5cc5545..b72cc11c81 100644
--- a/include/deal.II/numerics/matrix_tools.h
+++ b/include/deal.II/numerics/matrix_tools.h
@@ -608,6 +608,9 @@ namespace MatrixCreator
  * There are two ways to incorporate fixed degrees of freedom such as boundary
  * nodes into a linear system, as discussed below.
  *
+ * @dealiiVideoLecture{21.6,21.65}
+ *
+ *
  *
  * <h3>Global elimination</h3>
  *
@@ -981,6 +984,8 @@ namespace MatrixTools
    * matrices, or for PETSc or trilinos matrices). However, it doesn't work as
    * expected if there are also hanging nodes to be considered. More caveats
    * are listed in the general documentation of this class.
+   *
+   * @dealiiVideoLecture{21.6,21.65}
    */
   void
   local_apply_boundary_values (const std::map<types::global_dof_index,double> &boundary_values,