A note on the rate of convergence of integration schemes for closed surfaces
Gentian Zavalani, Elima Shehu, Michael Hecht

TL;DR
This paper analyzes the convergence rates of surface integration schemes, explaining why even-degree polynomials perform better than odd-degree ones, supported by numerical examples and a proposed improved method.
Contribution
It provides an error analysis for surface integration schemes, explains the higher convergence of even-degree polynomials, and introduces a potential approach to address existing issues.
Findings
Even-degree polynomials have higher convergence rates than odd-degree polynomials.
Numerical examples support the theoretical error analysis.
A new approach is proposed to overcome limitations of the original scheme.
Abstract
In this paper, we issue an error analysis for integration over discrete surfaces using the surface parametrization presented in [PS22] as well as prove why even-degree polynomials exhibit a higher convergence rate than odd-degree polynomials. Additionally, we provide some numerical examples that illustrate our findings and propose a potential approach that overcomes the problems associated with the original one.
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Analysis Techniques · Advanced Numerical Methods in Computational Mathematics · Electromagnetic Scattering and Analysis
