reording tests

diff --git a/include/deal.II/lac/block_linear_operator.h b/include/deal.II/lac/block_linear_operator.h
index 64ff277b8f24fae65dc5306750ba6deb9fad387a..36acf4a369add7505905882801b3c310a9b618c2 100644 (file)
--- a/include/deal.II/lac/block_linear_operator.h
+++ b/include/deal.II/lac/block_linear_operator.h
@@ -328,7 +328,7 @@ block_diagonal_operator(const LinearOperator<typename Range::BlockType, typename
  * This function implement a forward substitution argument to invert a lower
  * block triangular matrix.
  * It takes as argement an array of array of LinearOperators @p block_matrix
- * representing a block matrix and an array of LinearOperators
+ * representing a lower block triangular matrix and an array of LinearOperators
  * @p inverse_diagonal representing inverses of digonal blocks of @p block_matrix.
  *
  * Let us assume we have a linear system where each coefficient of the system is a
@@ -344,6 +344,9 @@ block_diagonal_operator(const LinearOperator<typename Range::BlockType, typename
  * and therefore:
  *    xn = Ann^-1 ( yn - A0n x0 - ... - A(n-1)n x(n-1) )
  *
+ * Notice that we are not using the whole matrix: just the lower triangular block
+ * matrix obtained from @p block_matrix it is used.
+ *
  * Caveat: Tvmult and Tvmult_add have not been implemented, yet. This may lead to mistakes.
  * @ingroup LAOperators
  */
@@ -434,12 +437,12 @@ block_forward_substitution(const std::array<std::array<LinearOperator<typename R
  * This function implement a back substitution argument to invert an upper
  * block triangular matrix.
  * It takes as argement an array of array of LinearOperators @p block_matrix
- * representing a block matrix and an array of LinearOperators
+ * representing an upper block triangular matrix and an array of LinearOperators
  * @p inverse_diagonal representing inverses of digonal blocks of @p block_matrix.
  *
  * Let us assume we have a linear system where each coefficient of the system is a
  * matrix:
-
+ *
  * A00 x0 + A01 x1 + ... + A0n xn = yn
  *          A11 x1 + ...          = y1
  *                          ...     ..
@@ -451,6 +454,9 @@ block_forward_substitution(const std::array<std::array<LinearOperator<typename R
  * and therefore:
  *    x0 = A00^-1 ( y0 - A0n xn - ... - A01 x1 )
  *
+ * Notice that we are not using the whole matrix: just the upper triangular block
+ * matrix obtained from @p block_matrix it is used.
+ *
  * Caveat: Tvmult and Tvmult_add have not been implemented, yet. This may lead to mistakes.
  * @ingroup LAOperators
  */

diff --git a/tests/lac/block_linear_operator_05.cc b/tests/lac/block_linear_operator_03.cc
similarity index 100%
rename from tests/lac/block_linear_operator_05.cc
rename to tests/lac/block_linear_operator_03.cc

diff --git a/tests/lac/block_linear_operator_05.with_cxx11=on.output b/tests/lac/block_linear_operator_03.with_cxx11=on.output
similarity index 100%
rename from tests/lac/block_linear_operator_05.with_cxx11=on.output
rename to tests/lac/block_linear_operator_03.with_cxx11=on.output