相关论文: Constructing Cubature Formulas of Degree 5 with Fe…

73 new cubature rules are found for three standard multidimensional integrals with spherically symmetric regions and weights, using direct search with a numerical zero-finder. All but four of the new rules have fewer integration points than…

We study cubature formulas for d-dimensional integrals with an arbitrary symmetric weight function of tensor product form. We present a construction that yields a high polynomial exactness: for fixed degree l=5 or l=7 and large dimension,…

Numerical integration formulas in $n$-dimensional Euclidean space of degree three are discussed. For the integrals with permutation symmetry we present a method to construct its third-degree integration formulas with $2n$ real points. We…

Gau{\ss} cubature (multidimensional numerical integration) rules are the natural generalisation of the 1D Gau{\ss} rules. They are optimal in the sense that they exactly integrate polynomials of as high a degree as possible for a particular…

We present a construction for improving numerical cubature formulas with equal weights and a convolution structure, in particular equal-weight product formulas, using linear error-correcting codes. The construction is most effective in low…

Many applications require multi-dimensional numerical integration, often in the form of a cubature formula. These cubature formulas are desired to be positive and exact for certain finite-dimensional function spaces (and weight functions).…

Archimedes' hat-box theorem states that uniform measure on a sphere projects to uniform measure on an interval. This fact can be used to derive Simpson's rule. We present various constructions of, and lower bounds for, numerical cubature…

We construct cubature formulas on spheres supported by homothetic images of shells in some Euclidian lattices. Our analysis of these cubature formulas uses results from the theory of modular forms. Examples are worked out on the sphere of…

A new algebraic cubature formula of degree $2n+1$ for the product Chebyshev measure in the $d$-cube with $\approx n^d/2^{d-1}$ nodes is established. The new formula is then applied to polynomial hyperinterpolation of degree $n$ in three…

A method is developed to compute analytically fully symmetric cubature rules on the triangle by using symmetric polynomials to express the two kinds of invariance inherent in these rules. Rules of degree up to 15, some of them new and of…

Positive cubature rules of degree 4 and 5 on the $d$-dimensional simplex are constructed and used to construct cubature rules of index 8 or degree 9 on the unit sphere. The latter ones lead to explicit isometric embedding among the…

Cubature formulas and geometrical designs are described in terms of reproducing kernels for Hilbert spaces of functions on the one hand, and Markov operators associated to orthogonal group representations on the other hand. In this way,…

Let $d$ and $k$ be positive integers. Let $\mu$ be a positive Borel measure on $\mathbb{R}^2$ possessing finite moments up to degree $2d-1$. If the support of $\mu$ is contained in an algebraic curve of degree $k$, then we show that there…

We present several new quadrature formulas in the triangle for exact integration of polynomials. The points were computed numerically with a cardinal function algorithm which imposes that the number of quadrature points $N$ be equal to the…

Beside simplices, $n$-cubes form an important class of simple polyhedra. Unlike hyperbolic Coxeter simplices, hyperbolic Coxeter $n$-cubes are not classified. We show that there is no hyperbolic Coxeter $n$-cube for $n\geq~6$, and provide a…

The nodes of certain minimal cubature rule are real common zeros of a set of orthogonal polynomials of degree $n$. They often consist of a well distributed set of points and interpolation polynomials based on them have desired convergence…

In this paper we prove a new asymptotic lower bound for the minimal number of simplices in simplicial dissections of $n$-dimensional cubes. In particular we show that the number of simplices in dissections of $n$-cubes without additional…

In numerical integration, cubature methods are effective, especially when the integrands can be well-approximated by known test functions, such as polynomials. However, the construction of cubature formulas has not generally been known, and…

Sphere-bases are constructed for the $\mathbb{Z}_2$ vector space formed by the $k$-dimensional subcomplexes, of $n$-simplex (or $n$-cube), for which every $(k{-}1)$-face is contained in a positive even number of $k$-cells; addition is…

Neighborly cubical polytopes exist: for any $n\ge d\ge 2r+2$, there is a cubical convex d-polytope $C^n_d$ whose $r$-skeleton is combinatorially equivalent to that of the $n$-dimensional cube. This solves a problem of Babson, Billera &…