// ------------------------------------------------------------------------ // // SPDX-License-Identifier: LGPL-2.1-or-later // Copyright (C) 2004 - 2025 by the deal.II authors // // This file is part of the deal.II library. // // Part of the source code is dual licensed under Apache-2.0 WITH // LLVM-exception OR LGPL-2.1-or-later. Detailed license information // governing the source code and code contributions can be found in // LICENSE.md and CONTRIBUTING.md at the top level directory of deal.II. // // ------------------------------------------------------------------------ #ifndef dealii_polynomials_raviart_thomas_h #define dealii_polynomials_raviart_thomas_h #include #include #include #include #include #include #include #include #include #include DEAL_II_NAMESPACE_OPEN /** * This class implements the Hdiv-conforming, * Raviart-Thomas polynomials as described in the book by Brezzi and Fortin. * Most of the functionality comes from the vector-valued anisotropic * polynomials class PolynomialsVectorAnisotropic. * * The Raviart-Thomas polynomials are constructed such that the divergence is * in the tensor product polynomial space Qk. Therefore, the * polynomial order of each component must be one order higher in the * corresponding direction, yielding the polynomial spaces * (Qk+1,k, Qk,k+1) and (Qk+1,k,k, * Qk,k+1,k, Qk,k,k+1) in 2d and 3d, resp. * * @ingroup Polynomials */ template class PolynomialsRaviartThomas : public PolynomialsVectorAnisotropic { public: /** * Constructor, using the common Raviart-Thomas space of degree `k + 1` in * normal direction and `k` in the tangential directions. * * @arg k: the degree of the Raviart-Thomas-space, which is the degree of * the largest tensor product polynomial space Qk * contains. */ PolynomialsRaviartThomas(const unsigned int k); /** * Variant of the n_polynomials() function taking only a single argument * `degree`, assuming `degree + 1` in the normal direction and `degree` in * the tangential directions. */ static unsigned int n_polynomials(const unsigned int degree); // Make respective two-argument method from base class available using PolynomialsVectorAnisotropic::n_polynomials; /** * Compute the lexicographic to hierarchic numbering underlying this class, * computed as a free function. */ static std::vector get_lexicographic_numbering(const unsigned int degree); /** * @copydoc TensorPolynomialsBase::clone() */ virtual std::unique_ptr> clone() const override; }; DEAL_II_NAMESPACE_CLOSE #endif