Title of article
A numerical algorithm for the construction of efficient quadrature rules
Author/Authors
Hong Xiao a، نويسنده , , Zydrunas Gimbutasb، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2010
Pages
14
From page
663
To page
676
Abstract
We present a numerical algorithm for the construction of efficient, high-order quadratures
in two and higher dimensions. Quadrature rules constructed via this algorithm possess
positive weights and interior nodes, resembling the Gaussian quadratures in one
dimension. In addition, rules can be generated with varying degrees of symmetry,
adaptable to individual domains. We illustrate the performance of our method with
numerical examples, and report quadrature rules for polynomials on triangles, squares,
and cubes, up to degree 50. These formulae are near optimal in the number of nodes used,
and many of them appear to be new.
Keywords
Gaussian quadrature , Square , Cube , Point elimination method , Least squares Newton’s method , Triangle , Multivariate integration
Journal title
Computers and Mathematics with Applications
Serial Year
2010
Journal title
Computers and Mathematics with Applications
Record number
921195
Link To Document