Saved in:
| Main Authors: | , , |
|---|---|
| 格式: | Preprint |
| 出版: |
2024
|
| 主題: | |
| 在線閱讀: | https://arxiv.org/abs/2409.02027 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| _version_ | 1866916380360572928 |
|---|---|
| author | Worku, Zelalem Arega Hicken, Jason E. Zingg, David W. |
| author_facet | Worku, Zelalem Arega Hicken, Jason E. Zingg, David W. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_02027 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Very high-order symmetric positive-interior quadrature rules on triangles and tetrahedra Worku, Zelalem Arega Hicken, Jason E. Zingg, David W. Numerical Analysis 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. |
| title | Very high-order symmetric positive-interior quadrature rules on triangles and tetrahedra |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2409.02027 |