Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2409.02027

Help | Advanced Search

Mathematics > Numerical Analysis

arXiv:2409.02027 (math)
[Submitted on 3 Sep 2024 ]

Title: Very high-order symmetric positive-interior quadrature rules on triangles and tetrahedra

Title: 非常高阶对称正内部求积公式在三角形和四面体上

Authors:Zelalem Arega Worku, Jason E. Hicken, David W. Zingg
Abstract: We present novel fully-symmetric quadrature rules with positive weights and strictly interior nodes of degrees up to 84 on triangles and 40 on tetrahedra. Initial guesses for solving the nonlinear systems of equations needed to derive quadrature rules are generated by forming tensor-product structures on quadrilateral/hexahedral subdomains of the simplices using the Legendre-Gauss nodes on the first half of the line reference element. In combination with a methodology for node elimination, these initial guesses lead to the development of highly efficient quadrature rules, even for very high polynomial degrees. Using existing estimates of the minimum number of quadrature points for a given degree, we show that the derived quadrature rules on triangles and tetrahedra are more than 95% and 80% efficient, respectively, for almost all degrees. The accuracy of the quadrature rules is demonstrated through numerical examples.
Abstract: 我们提出了新颖的完全对称求积规则,其权重为正,节点严格位于三角形上的度数高达84,四面体上的度数高达40。 为了解决推导求积规则所需的非线性方程组,通过在单形的四边形/六面体子域上形成张量积结构,并使用线参考元前半部分的勒让德-高斯节点来生成初始猜测。 结合节点消除的方法,这些初始猜测导致了高度高效的求积规则,即使对于非常高的多项式次数也是如此。 利用现有给定度数的最小求积点数的估计,我们表明,对于几乎所有度数,三角形和四面体上的推导求积规则的效率分别超过95%和80%。 通过数值例子展示了求积规则的准确性。
Comments: 17 pages, 6 figures
Subjects: Numerical Analysis (math.NA)
Cite as: arXiv:2409.02027 [math.NA]
  (or arXiv:2409.02027v1 [math.NA] for this version)
  https://doi.org/10.48550/arXiv.2409.02027
arXiv-issued DOI via DataCite

Submission history

From: Zelalem Arega Worku [view email]
[v1] Tue, 3 Sep 2024 16:21:50 UTC (6,618 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
math.NA
< prev   |   next >
new | recent | 2024-09
Change to browse by:
cs
cs.NA
math

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号