Newton-Cotes cubature rules over (d+1)-pencil lattices

Authors:
Jernej Kozak;Vito Vitrih
Affiliations:
University of Ljubljana, FMF and IMFM, Jadranska 19, Ljubljana, Slovenia;University of Primorska, PINT, Muzejski trg 2, Koper, Slovenia
Venue:
Journal of Computational and Applied Mathematics
Year:
2009

Citing 4
Cited 2

On multivariate Lagrange interpolation

Mathematics of Computation
An encyclopaedia of cubature formulas

Journal of Complexity
An adaptive numerical cubature algorithm for simplices

ACM Transactions on Mathematical Software (TOMS)
Lattices on simplicial partitions

Journal of Computational and Applied Mathematics

Lattices on simplicial partitions

Journal of Computational and Applied Mathematics
Lattices on simplicial partitions which are not simply connected

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	7.30

Visualization

Abstract

In this paper, Newton-Cotes cubature rules are extended to (d+1)-pencil lattices over simplices and simplicial partitions. The closed form of the cubature rules as well as the error term are determined. Further, the basic cubature rules can be combined with an adaptive algorithm over simplicial partitions. The key point of the algorithm is a subdivision step that refines a (d+1)-pencil lattice over a simplex to its subsimplices. If the number of function evaluations is crucial, the additional freedom provided by (d+1)-pencil lattices may be used to decrease it significantly.