Provide links to recently recorded video lectures.

diff --git a/examples/step-1/doc/intro.dox b/examples/step-1/doc/intro.dox
index 6168f5fa3001bf52630c50a4bd9988b62ca31c0e..14dbb8054ffccac359440070d2b9bd68710523c4 100644 (file)
--- 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 23be1d960e95c0785b9fe829d4ffcd2eee7dec36..5f103cafa642ba5bac9ab82defa125cee9b789c2 100644 (file)
--- 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 ba836b21a8f76f4c524e5f07ae6f88c98765ef18..4b00e31674267f411994b2de9f5a88c78448b358 100644 (file)
--- 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 289aff53ebb118121e1f716ef0137b5ebcceb594..616844299c58d4164fecd52aa88bd66979e55970 100644 (file)
--- 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 3e3a3c6799fc6e91ecc59a04b5a7583b7f2af83b..5b4512ecde21d29b7b5ec3bed7af29b97086a761 100644 (file)
--- 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 2ca5cc554501bf353cc6555294d3571552bbc10b..b72cc11c8157b3f3919e5b0c2721d75e8b4269b0 100644 (file)
--- 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,