Several new quadrature formulas for polynomial integration in the triangle
Mark A. Taylor, Beth A. Wingate, Len P. Bos

TL;DR
This paper introduces several new quadrature formulas for polynomial integration over triangles, achieving higher degrees of exactness with positive weights and no points outside the domain, advancing numerical integration methods.
Contribution
The paper develops new quadrature formulas for triangles up to degree 25, with positive weights and improved accuracy over previous methods, using a novel cardinal function algorithm.
Findings
Seven formulas outperform existing ones in accuracy
All formulas have positive weights and are confined within the triangle
Quadrature formulas are computed for degrees up to 25
Abstract
We present several new quadrature formulas in the triangle for exact integration of polynomials. The points were computed numerically with a cardinal function algorithm which imposes that the number of quadrature points be equal to the dimension of a lower dimensional polynomial space. Quadrature forumulas are presented for up to degree , all which have positive weights and contain no points outside the triangle. Seven of these quadrature formulas improve on previously known results.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical Methods and Algorithms · Iterative Methods for Nonlinear Equations · Advanced Numerical Analysis Techniques
