From 4f6e5e59d3ef3ffa82c3a48b71f8ed85a1ee6bb4 Mon Sep 17 00:00:00 2001 From: David Wells Date: Tue, 11 Oct 2016 16:44:58 -0400 Subject: [PATCH] Remove QGauss2 doc references. This QGauss2, QGauss3, etc. were removed in commit 07e24b9065b (September 2010) in favor of QGauss. --- examples/step-11/step-11.cc | 14 +++++++------- include/deal.II/numerics/error_estimator.h | 6 +++--- 2 files changed, 10 insertions(+), 10 deletions(-) diff --git a/examples/step-11/step-11.cc b/examples/step-11/step-11.cc index ea9b17a48f..7ef0f3a1df 100644 --- a/examples/step-11/step-11.cc +++ b/examples/step-11/step-11.cc @@ -296,13 +296,13 @@ namespace Step11 // // The second remark concerns the quadrature formula we use: we want to // integrate over bilinear shape functions, so we know that we have to use - // at least a Gauss2 quadrature formula. On the other hand, we want to - // have the quadrature rule to have at least the order of the boundary - // approximation. Since the order of Gauss-r is 2r, and the order of the - // boundary approximation using polynomials of degree p is p+1, we know - // that 2r@>=p+1. Since r has to be an integer and (as mentioned above) - // has to be at least 2, this makes up for the formula above computing - // gauss_degree. + // at least an order two Gauss quadrature formula. On the other hand, we + // want the quadrature rule to have at least the order of the boundary + // approximation. Since the order of Gauss rule with $r$ points is $2r + + // 1$, and the order of the boundary approximation using polynomials of + // degree p is p+1, we know that $2r@>=p$. Since r has to be an integer + // and (as mentioned above) has to be at least 2, this makes up for the + // formula above computing gauss_degree. // // Since the generation of the body force contributions to the right hand // side vector was so simple, we do that all over again for the boundary diff --git a/include/deal.II/numerics/error_estimator.h b/include/deal.II/numerics/error_estimator.h index 23a244bce3..0175e7acfd 100644 --- a/include/deal.II/numerics/error_estimator.h +++ b/include/deal.II/numerics/error_estimator.h @@ -110,9 +110,9 @@ namespace hp * times some factor) of each cell and take the square root. * * The integration is done using a quadrature formula on the face. For linear - * trial functions (FEQ1), the QGauss2 or even the QMidpoint rule will - * suffice. For higher order elements, it is necessary to utilize higher order - * quadrature formulae as well. + * trial functions (FEQ1), QGauss (with two points) or even the QMidpoint rule + * will suffice. For higher order elements, it is necessary to utilize higher + * order quadrature formulae as well. * * We store the contribution of each face in a @p map, as provided by the C++ * standard library, with the iterator pointing to that face being the key -- 2.39.5