* space Polynomials::Legendre. The tensor product is achieved using
* TensorProductPolynomials and the ordering of shape functions, like in
* TensorProductPolynomials, is lexicographic. For instance, the ordering in 2d
- * is $P_0(x)P_0(y),\ P_1(x)P_0(y),\ \ldots,\ P_n(x)P_0(y),\ P_0(x)P_1(y),\
- * \ldots,\ P_n(x)P_1(y),\ \ldots,\ P_0(x)P_n(y),\ \ldots,\ P_n(x)P_n(y)$ when
- * <tt>degree=n</tt> where $\{P_i\}_{i=0}^{n}$ are the one-dimensional Legendre
- * polynomials defined on $[0,1]$. As opposed to the basic FE_DGQ element,
- * these elements are not interpolatory and no support points are defined.
+ * is $P_0(x)P_0(y),\ P_1(x)P_0(y),\ \ldots,\ P_n(x)P_0(y),\ P_0(x)P_1(y),
+ * \ \ldots,\ P_n(x)P_1(y),\ \ldots,\ P_0(x)P_n(y),\ \ldots,\ P_n(x)P_n(y)$
+ * when <tt>degree=n</tt> where $\{P_i\}_{i=0}^{n}$ are the one-dimensional
+ * Legendre polynomials defined on $[0,1]$. As opposed to the basic FE_DGQ
+ * element, these elements are not interpolatory and no support points are
+ * defined.
*
* See the base class documentation in FE_DGQ for details.
*/