Pith. sign in

REVIEW

Cheap and stable quadrature on polyhedral elements

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2502.03446 v1 pith:OE6VROTS submitted 2025-02-05 math.NA cs.NA

Alvise Sommariva , Marco Vianello This is my paper · ORCID
classification math.NAcs.NA
keywords cheapelementspolyhedralquadraturestableapproacharisebounding
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Pith tools