Skip to content

Add partition-of-unity testing #3398

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
roystgnr merged 1 commit into from
Sep 13, 2022
Merged

Add partition-of-unity testing #3398

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
76 changes: 76 additions & 0 deletions tests/fe/fe_test.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -22,6 +22,7 @@

#define FETEST \
CPPUNIT_TEST( testU ); \
CPPUNIT_TEST( testPartitionOfUnity ); \
CPPUNIT_TEST( testGradU ); \
CPPUNIT_TEST( testGradUComp ); \
CPPUNIT_TEST( testHessU ); \
Expand Down Expand Up @@ -564,6 +565,81 @@ class FETest : public FETestBase<order, family, elem_type, 1> {
#endif // LIBMESH_ENABLE_EXCEPTIONS
}

void testPartitionOfUnity()
{
if (!this->_elem)
return;

this->_fe->reinit(this->_elem);

bool satisfies_partition_of_unity = true;
for (const auto qp : make_range(this->_qrule->n_points()))
{
Real phi_sum = 0;
for (std::size_t d = 0; d != this->_dof_indices.size(); ++d)
phi_sum += this->_fe->get_phi()[d][qp];
if (phi_sum < (1 - TOLERANCE) || phi_sum > (1 + TOLERANCE))
{
satisfies_partition_of_unity = false;
break;
}
}

switch (this->_fe->get_family())
{
case MONOMIAL:
{
switch (this->_fe->get_order())
{
case CONSTANT:
CPPUNIT_ASSERT(satisfies_partition_of_unity);
break;

default:
CPPUNIT_ASSERT(!satisfies_partition_of_unity);
break;
}
break;
}
case SZABAB:
case HIERARCHIC:
case L2_HIERARCHIC:
{
switch (this->_fe->get_order())
{
case FIRST:
CPPUNIT_ASSERT(satisfies_partition_of_unity);
break;

default:
CPPUNIT_ASSERT(!satisfies_partition_of_unity);
break;
}
break;
}

case XYZ:
case CLOUGH:
case HERMITE:
{
CPPUNIT_ASSERT(!satisfies_partition_of_unity);
break;
}

case LAGRANGE:
case L2_LAGRANGE:
case BERNSTEIN:
case RATIONAL_BERNSTEIN:
{
CPPUNIT_ASSERT(satisfies_partition_of_unity);
break;
}

default:
CPPUNIT_FAIL("Uncovered FEFamily");
}
}


void testU()
{
Expand Down