From: Martin Kronbichler Date: Wed, 23 Sep 2009 06:27:05 +0000 (+0000) Subject: Cleanup of comments. X-Git-Tag: v8.0.0~7076 X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=2759d2f787ba863b88c552686d1686426aa74aa5;p=dealii.git Cleanup of comments. git-svn-id: https://svn.dealii.org/trunk@19499 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/deal.II/examples/step-37/doc/intro.dox b/deal.II/examples/step-37/doc/intro.dox index 0dc7a4d166..f8e8367b47 100644 --- a/deal.II/examples/step-37/doc/intro.dox +++ b/deal.II/examples/step-37/doc/intro.dox @@ -8,8 +8,8 @@ This example shows how to implement a matrix-free method, that is, a method that does not explicitly store the matrix elements, for a -second-order Poisson equation with variable coefficients on an unstructured -mesh. +second-order Poisson equation with variable coefficients on a rather +unstructured mesh representing a circle.

Matrix-vector product implementation

@@ -195,7 +195,7 @@ elements as there are degrees of freedom on the actual cell to compute. The multiplication itself is then done by two nested loops, which means that it is much cheaper. -A naive way to improve this is to realize that we actually build the local +One way to improve this is to realize that we actually build the local matrix by a product of three matrices, @f{eqnarray*} A_\mathrm{cell} = B D B^T. @@ -258,9 +258,9 @@ weight. The third loop applies the second gradient (in transposed form), so that we get back to a vector of (Laplacian) values on the cell dofs. This improves the situation a lot and reduced the complexity of the product -from something like $\mathcal {O}(\mathrm{dofs_per_cell}^3)$ to $\mathcal -{O}(\mathrm{dofs_per_cell}^2)$. In fact, all the remainder is just to make a -slightly more clever use of data in order to gain some extra speed. It does +from something like $\mathcal {O}(\mathrm{dofs\_per\_cell}^3)$ to $\mathcal +{O}(\mathrm{dofs\_per\_cell}^2)$. In fact, all the remainder is just to make +a slightly more clever use of data in order to gain some extra speed. It does not change the code structure, though. If one would implement the code above, one would soon realize that the diff --git a/deal.II/lac/include/lac/vector.h b/deal.II/lac/include/lac/vector.h index ccec876778..9cade6f7f1 100644 --- a/deal.II/lac/include/lac/vector.h +++ b/deal.II/lac/include/lac/vector.h @@ -972,6 +972,8 @@ class Vector : public Subscriptor /*----------------------- Inline functions ----------------------------------*/ +#ifndef DOXYGEN + template inline @@ -1296,11 +1298,11 @@ Vector::scale (const Number factor) template -template +template inline void Vector::add (const std::vector &indices, - const std::vector &values) + const std::vector &values) { Assert (indices.size() == values.size(), ExcDimensionMismatch(indices.size(), values.size())); @@ -1310,11 +1312,11 @@ Vector::add (const std::vector &indices, template -template +template inline void Vector::add (const std::vector &indices, - const Vector &values) + const Vector &values) { Assert (indices.size() == values.size(), ExcDimensionMismatch(indices.size(), values.size())); @@ -1324,12 +1326,12 @@ Vector::add (const std::vector &indices, template -template +template inline void Vector::add (const unsigned int n_indices, const unsigned int *indices, - const Number2 *values) + const OtherNumber *values) { for (unsigned int i=0; i::swap (Vector &v) +#endif + /*! @addtogroup Vectors *@{