We consider cubature rules of precision or degree d of the form
Bn | w(x) f(x) dV = IN[f] + RN[f]        (1) |
IN f := | N i = 1 | wi f(xi),     wi 0,     i = 1, ..., N        (2) |
n j = 1 | xji |   with   | n j = 1 | ij d |   and   |
RN f 0 for some such monomial with   | n j = 1 | ij = d + 1. |
r2 := | n j = 1 | xj2 . |
Cn     : -1 xj 1,   j = 1, ..., n |
Sn     : r2 1 |
Tn     : | n j = 1 | xj 1,     xj 0,     j = 1, ..., n . |
As a general rule we do not include cubature rules of degree 2m - 1 which use more than mn points since the (Cartesian, Spherical or Conical) product Gaussian rule of degree 2m - 1 requires mn points and is usually superior to any other cubature rule of the same degree. This also holds true for the top of an embedded sequence since there is a very good way to generate an embedded sequence starting with a product Gaussian rule and generating cubature rules of lower degree in an optimal manner [CH89]. Exceptions to this rule are cubature rules with properties that some users may desire, such as equal weights, points on the boundary or more symmetry.