41 const std::vector<unsigned int> R =
42 FETools::lexicographic_to_hierarchic_numbering<dim>(n_points_1d - 1);
45 table.reinit(n_per_cell, n_per_cell);
48 const int N1d = n_points_1d;
49 for (
unsigned int i = 0; i < n_per_cell; ++i)
50 for (
unsigned int j = 0; j < n_per_cell; ++j)
57 for (
unsigned int d = 0; d < dim; ++d)
59 int current_distance =
std::abs((xi % N1d) - (xj % N1d));
62 distance =
std::max(distance, current_distance);
68 table(R[i], R[j]) =
true;
77template <
int dim,
int spacedim>
81 Polynomials::generate_complete_Lagrange_basis_on_subdivisions(
91 ExcMessage(
"This element can only be used with a positive number of "
99 internal::make_local_sparsity_pattern<dim>(subdivisions + 1);
104template <
int dim,
int spacedim>
106 const std::vector<
Point<1>> &support_points)
109 Polynomials::generate_complete_linear_basis_on_subdivisions(
113 support_points.
size() - 1,
117 Assert(support_points.size() > 1,
118 ExcMessage(
"This element can only be used with a positive number of "
123 internal::make_local_sparsity_pattern<dim>(support_points.size());
128template <
int dim,
int spacedim>
136 std::ostringstream namebuf;
138 << this->degree <<
")";
139 return namebuf.str();
144template <
int dim,
int spacedim>
149 std::vector<double> &nodal_values)
const
152 this->get_unit_support_points().size());
156 for (
unsigned int i = 0; i < this->n_dofs_per_cell(); ++i)
160 nodal_values[i] = support_point_values[i](0);
166template <
int dim,
int spacedim>
167std::unique_ptr<FiniteElement<dim, spacedim>>
170 return std::make_unique<FE_Q_iso_Q1<dim, spacedim>>(*this);
175template <
int dim,
int spacedim>
179 const unsigned int codim)
const
202 if (this->degree < fe_q_iso_q1_other->degree &&
203 fe_q_iso_q1_other->degree % this->degree == 0)
205 else if (this->degree == fe_q_iso_q1_other->degree)
207 else if (this->degree > fe_q_iso_q1_other->degree &&
208 this->degree % fe_q_iso_q1_other->degree == 0)
216 if (fe_nothing->is_dominating())
232#include "fe/fe_q_iso_q1.inst"
void initialize(const std::vector< Point< 1 > > &support_points_1d)
virtual FiniteElementDomination::Domination compare_for_domination(const FiniteElement< dim, spacedim > &fe_other, const unsigned int codim=0) const override final
virtual std::string get_name() const override
virtual void convert_generalized_support_point_values_to_dof_values(const std::vector< Vector< double > > &support_point_values, std::vector< double > &nodal_values) const override
virtual std::unique_ptr< FiniteElement< dim, spacedim > > clone() const override
FE_Q_iso_Q1(const unsigned int n_subdivisions)
Table< 2, bool > local_dof_sparsity_pattern
#define DEAL_II_NAMESPACE_OPEN
#define DEAL_II_NAMESPACE_CLOSE
#define DEAL_II_NOT_IMPLEMENTED()
#define Assert(cond, exc)
static ::ExceptionBase & ExcImpossibleInDim(int arg1)
#define AssertDimension(dim1, dim2)
static ::ExceptionBase & ExcMessage(std::string arg1)
@ either_element_can_dominate
@ other_element_dominates
@ neither_element_dominates
std::string dim_string(const int dim, const int spacedim)
constexpr T pow(const T base, const int iexp)
Table< 2, bool > make_local_sparsity_pattern(unsigned int n_points_1d)
::VectorizedArray< Number, width > max(const ::VectorizedArray< Number, width > &, const ::VectorizedArray< Number, width > &)
::VectorizedArray< Number, width > abs(const ::VectorizedArray< Number, width > &)