arXiv · 2502.03446
Cheap and stable quadrature on polyhedral elements
Abstract
We discuss a cheap tetrahedra-free approach to the numerical integration of polynomials on polyhedral elements, based on hyperinterpolation in a bounding box and Chebyshev moment computation via the divergence theorem. No conditioning issues arise, since no matrix factorization or inversion is needed. The resulting quadrature formula is theoretically stable even in the presence of some negative weights.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Alvise Sommariva, Marco Vianello. 2025-02-05. Cheap and stable quadrature on polyhedral elements. https://arxiv.org/abs/2502.03446
Cite the original work for its findings. Save a collection to share your selection of sources.