* possible and results in a
* blocking of several components
* into one. This is discussed in
- * @ref step_31 "step-31". If you
+ * @ref step_22 "step-22". If you
* omit this argument, the same
* order as given by the finite
* element is used.
* DataOut_DoFData::add_data_vector
* functions, this can be achieved.
*
- * See the @ref step_31 "step-31" tutorial
+ * See the @ref step_22 "step-22" tutorial
* program for an example on how this
* information can be used in practice.
*
* is logically an independent scalar field, or whether some of them together
* form logically a vector-field (see the
* DataComponentInterpretation::DataComponentInterpretation enum, and the @ref
- * step_31 "step-31" tutorial program).
+ * step_22 "step-22" tutorial program).
*
* It should be noted that this class does not copy the vector given to it through
* the add_data_vector() functions, for memory consumption reasons. It only
*
* The use of this function is
* explained in more detail in
- * @ref step_22 "step-22". It
+ * @ref step_31 "step-31". It
* doesn't make much sense in 1d,
* so the function throws an
* exception in that case.
* elements as well as vector-valued elements assembled via the
* FESystem class from other primitive (for example scalar) elements
* as shown in @ref step_8 "step-8", @ref step_29 "step_29" or @ref
- * step_22 "step-22". On the other hand, the FE_RaviartThomas and
- * FE_Nedelec classes provide non-primitive finite elements because
+ * step_22 "step-22". On the other hand, the FE_RaviartThomas class used
+ * in @ref step_20 "step-20" and @ref step_21 "step-21", or the
+ * FE_Nedelec class provide non-primitive finite elements because
* there each vector-value shape function may have several non-zero
* components.</dd>
*
* </ul>
* Other examples of using extractors and views are shown in tutorial programs
* @ref step_21 "step-21",
- * @ref step_31 "step-31",
- * @ref step_22 "step-22" and a few other programs.
+ * @ref step_22 "step-22",
+ * @ref step_31 "step-31" and a few other programs.
*
*
* @anchor VVAlternative
<li> <p>New: The function VectorTools::compute_no_normal_flux_constraints computes
the constraints that correspond to boundary conditions of the
form $\vec u \cdot \vec n = 0$. The use of the function is demonstrated in the
- @ref step_22 "step-22" tutorial program.
+ @ref step_31 "step-31" tutorial program.
<br>
(WB 2008/01/23)
</p></li>
* MultiFrontal method and direct sparse LU factorization. Matrices
* may have symmetric or unsymmetrix sparsity patterns, and may have
* unsymmetric entries. The use of this class is explained in the @ref
- * step_29 "step-29" and @ref
- * step_31 "step-31" tutorial programs.
+ * step_22 "step-22" and @ref
+ * step_29 "step-29" tutorial programs.
*
* This matrix class implements the usual interface of
* preconditioners, that is a function initialize(const