Abstract
An algorithm to get an optimal choice for the number of symmetric quadrature points is given to find symmetric quadrature formulas over a unit disk with a minimal number of points even when a high degree of polynomial precision is required. The symmetric quadrature formulas for numerical integration over a unit disk of complete polynomial functions up to degree 19 are presented.
Similar content being viewed by others
References
D.A.Dunavant,Economical symmetrical quadrature rules for complete polynomials over a square domain, Int.J.Numer.Methods eng.21 (1985), 1777–1784.
K.Gatermann,The Construction of symmetric cubature formulas for the square and the triangle, Computing40 (1988), 229–240.
P.C.Hammer, O.J.Marlowe and A.H.Stroud,Numerical integration over simplexes and cones, MTAC10 (1956), 130–137.
P.C.Hammer and A.H.Stroud,Numerical evaluation of multiple integrals II, MTAC12 (1958), 272–280.
International Mathematical and Statistical Libraries,version 2.0, Visual Numerics Inc., Houston,Texas, 1991.
M.E.Laursen and M.Gellert,Some criteria for numerically integrated matrices and quadrature formulas for triangles, Int. J.Numer.Methods Eng.12 (1978), 67–76.
J.N.Lyness and D.Jespersen,Moderate degree symmetric quadrature rules for the triangle, Inst.Maths.Applies.15 (1975), 19–32.
Mathematica,enhanced version 2.2, Wolfram Research,Inc., 1993.
Microsoft Fortran Powerstation,Professional Edition, version 4.0, Microsoft Corporation, 1995.
P.Rabinowitz and N.Richter,Perfectly symmetric two dimensional integration formulas with minimal number of points, Math. Comp.23 (1969), 765–779.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kim, K., Song, M. Symmetric quadrature formulas over a unit disk. Korean J. Comp. & Appl. Math. 4, 179–192 (1997). https://doi.org/10.1007/BF03011388
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03011388