Asymmetric cubature formulas for polynomial integration in the triangle and square

We present five new cubature formula in the triangle and square for exact integration of polynomials. The points were computed numerically with a cardinal function algorithm which does not impose any symmetry requirements on the points. Cubature formula are presented which integrate degrees 10, 11 and 12 in the triangle and degrees 10 and 12 in the square. They have positive weights, contain no points outside the domain, and have fewer points than previously known results.     

Errors, condition numbers, and guaranteed accuracy of higher-dimensional spherical cubatures

We give upper bounds for the deviation of the norm of a perturbed error functional from the norm of the original error of a higher-dimensional spherical cubature formula. The deviation arises as a result of the combined influence on the computation of small variations of the weights of the cubature formula and rounding for the subsequent calculation of the cubature sum in the given standards of approximation to real numbers. We estimate the practical error of the cubature formula for its action on an arbitrary function in the unit ball of the normed space of integrands. The resulting estimates are applied to studying the practical error of spherical cubature formulas in the case of integrands in Sobolev-type spaces on the higher-dimensional unit sphere. We represent the norm of the error functional in the dual space of the Sobolev class as a positive definite quadratic form in the weights of the cubature formula. We estimate the practical error for spherical cubature formulas, each of which is constructed as the direct product of Gauss’s quadrature formula along the meridian of the sphere and of the rectangle quadrature formula along the equator. The weights of this direct product with 2m ² nodes are positive. The formula itself is exact at all spherical harmonics up to order 2m ? 1.     

The error and guaranteed accuracy of cubature formulas in multidimensional periodic Sobolev spaces

We give an upper bound for the deviation of the norm of a perturbed error from the norm of the original error of a cubature formula in a multidimensional bounded domain. The deviation arises as a result of the joint influence on the computations of small variations of the weights of a cubature formula and rounding in the subsequent calculations of the cubature sum in the given standards (formats) of approximation to real numbers. We estimate the practical error of a cubature formula acting on an arbitrary function from the unit ball of a normed space of integrands. The resulting estimates are applied to studying the practical error of cubature formulas in the case of integrands in Sobolev spaces on a multidimensional cube. The norm of the error in the dual space of the Sobolev class is represented as a positive definite quadratic form in the weights of the cubature formula. We estimate the practical error for cubature formulas constructed as the direct product of quadrature formulas of rectangles along the edges of the unit cube. The weights of this direct product are positive.     

Cubature Formula for Spherical Basis Function Networks

Some mathematical models in geophysics and graphic processing need to compute integrals with scattered data on the sphere. Thus cubature formula plays an important role in computing these spherical integrals. This paper is devoted to establishing an exact positive cubature formula for spherical basis function networks. The authors give an existence proof of the exact positive cubature formula for spherical basis function networks, and prove that the cubature points needed in the cubature formula are not larger than the number of the scattered data.     

Pseudo-differential Operators,Cubature and Equidistribution on the 3D ball: An Approach Based on Orthonormal Basis Systems

In this paper, the distribution of points on a unit ball in ?³ is investigated. The ansatz is motivated by an approach for point grids on the unit sphere by Cui and Freeden. A formula for a generalized discrepancy is developed, which is then used to check the uniformity of point grids on a ball. The generalized discrepancy originates from an error bound for a quadrature (cubature) rule on the ball with uniform weights. In particular, we discuss the integration of functions from particular Sobolev spaces based on known orthonormal systems on the ball. This includes the introduction of a concept of pseudo-differential operators on the ball. Finally, different point grids are constructed on the ball and are compared by the discrepancy. Furthermore, numerical and graphical comparisons of the grids are presented.     

Optimal cubature formulas in a reflexive Banach space

Sequences of cubature formulas with a joint countable set of nodes are studied. Each cubature formula under consideration has only a finite number of nonzero weights. We call a sequence of such kind a multicubature formula. For a given reflexive Banach space it is shown that there is a unique optimal multicubature formula and the sequence of the norm of optimal error functionals is monotonically decreasing to 0 as the number of the formula nodes tends to infinity.     

Solving multivariable mathematical models by the quadrature and cubature methods

The utilization and generalization of quadrature and cubature approximations for numerical solution of mathematical models of multivariable transport processes involving integral, differential, and integro-differential operators, and for numerical interpolation and extrapolation, are presented. The methodology for determination of the quadrature and cubature weights for composite operators is developed to accommodate for general functional representations. Application of these methods is demonstrated by solving two-dimensional steady-state and one-dimensional transient-state problems. The solutions are compared with exact-analytical solutions to evaluate the performance of these methods. It is demonstrated that the quadrature and cubature approximations are simple and universal; i.e., the same formula is applicable irrespective of the order of accuracy of the numerical approximation, the type of linear operator, and the number of temporal and/or spatial variables. Since the quadrature and cubature methods can produce solutions with sufficient accuracy even when using fewer discrete points, both the programming task and computational effort are reduced considerably. Therefore, the quadrature and cubature methods appear to be very practical in solving the mathematical models of a variety of transport processes. © 1994 John Wiley & Sons, Inc.     

Spherical cubature formulas in Sobolev spaces

We study sequences of cubature formulas on the unit sphere in a multidimensional Euclidean space. The grids for the cubature formulas under consideration embed in each other consecutively, forming in the limit a dense subset on the initial sphere. As the domain of cubature formulas, i.e. as the class of integrands, we take spherical Sobolev spaces. These spaces may have fractional smoothness. We prove that, among all possible spherical cubature formulas with given grid, there exists and is unique a formula with the least norm of the error, an optimal formula. The weights of the optimal cubature formula are shown to be solutions to a special nondegenerate system of linear equations. We prove that the errors of cubature formulas tend to zero as the number of nodes grows indefinitely.     

Optimal cubature formulas for tensor products of certain classes of functions

We study the problem of constructing an optimal formula of approximate integration along a d-dimensional parallelepiped. Our construction utilizes mean values along intersections of the integration domain with n hyperplanes of dimension (d−1), each of which is perpendicular to some coordinate axis. We find an optimal cubature formula of this type for two classes of functions. The first class controls the moduli of continuity with respect to all variables, whereas the second class is the intersection of certain periodic multivariate Sobolev classes. We prove that all node hyperplanes of the optimal formula in each case are perpendicular to a certain coordinate axis and are equally spaced and the weights are equal. For specific moduli of continuity and for sufficiently large n, the formula remains optimal for the first class among cubature formulas with arbitrary positions of hyperplanes.     

Why do so many cubature formulae have so many positive weights?

We consider cubature formulae which are invariant with respect to a transformation group and prove sufficient conditions for such formulae to have positive weights. This is worked out for different symmetries: we consider central symmetric, symmetric and fully symmetric cubature formulae. The theoretical results are illustrated with examples.     

On the (non)-existence of some cubature formulas: gaps between a theory and its applications

An overview of the lower bounds for the number of points for integrals over the square and triangle is presented. This is compared with the number of points in known cubature formulae.     

Construction of cubature formulae with preassigned nodes§

In this article, a technique for developing cubature rules with preassigned nodes is presented to avoid wasting of information in scientific computation. The corresponding constructive method of the cubature rule is also given. As an application of the rules, a cubature formula on disk, which was derived via the method of reproducing kernel in (Xu, Y., 2000, Constructing cubature formulae by the method of reproducing kernel. Numerische Mathematik, 85, 155–173), is reconstructed by using our technique. When the preassigned nodes are selected as the nodes of a cubature formula of lower degree, an embedded cubature formula can be easily obtained by the presented method. Furthermore, some examples are included in the article.     

Bivariate Lagrange interpolation at the Padua points: the ideal theory approach

The Padua points are a family of points on the square [−1, 1]² given by explicit formulas that admits unique Lagrange interpolation by bivariate polynomials. Interpolation polynomials and cubature formulas based on the Padua points are studied from an ideal theoretic point of view, which leads to the discovery of a compact formula for the interpolation polynomials. The L ^p convergence of the interpolation polynomials is also studied. S. De Marchi and M. Vianello were supported by the “ex-60%” funds of the University of Padua and by the INdAM GNCS (Italian National Group for Scientific Computing). Y. Xu was partially supported by NSF Grant DMS-0604056.     

Hyperinterpolation on the square

We show that hyperinterpolation at (near) minimal cubature points for the product Chebyshev measure, along with Xu compact formula for the corresponding reproducing kernel, provide a simple and powerful polynomial approximation formula in the uniform norm on the square. The Lebesgue constant of the hyperinterpolation operator grows like log² of the degree, as that of quasi-optimal interpolation sets recently proposed in the literature. Moreover, we give an accurate implementation of the hyperinterpolation formula with linear cost in the number of cubature points, and we compare it with interpolation formulas at the same set of points.     

Geometrical Solution to the Fermat Problem with Arbitrary Weights

The prime motivation for the present study is a famous problem, allegedly first formulated in 1643 by Fermat, and the so-called Complementary Problem (CP), proposed but incorrectly solved in 1941 by Courant and Robbins. For a given triangle, Fermat asks for a fourth point such that the sum of its Euclidean distances, each weighted by +1, to the three given points is minimized. CP differs from Fermat in that the weight associated with one of these points is –1 instead of +1. The geometrical approach suggested in 1998 by Krarup for solving CP is here extended to cover any combination of positive and negative weights associated with the vertices of a given triangle. Among the by-products are surprisingly simple correctness proofs of the geometrical constructions of Torricelli (around 1645), Cavalieri (1647), Viviani (1659), Simpson (1750), and Martelli (1998). Furthermore, alternative proofs of Ptolemy's theorem (around A.D. 150) and an observation by Heinen (1834) are provided.     

Extremal Systems of Points and Numerical Integration on the Sphere

This paper considers extremal systems of points on the unit sphere S ^r⊂R ^r+1, related problems of numerical integration and geometrical properties of extremal systems. Extremal systems are systems of d _n =dim P _n points, where P _n is the space of spherical polynomials of degree at most n, which maximize the determinant of an interpolation matrix. Extremal systems for S ² of degrees up to 191 (36,864 points) provide well distributed points, and are found to yield interpolatory cubature rules with positive weights. We consider the worst case cubature error in a certain Hilbert space and its relation to a generalized discrepancy. We also consider geometrical properties such as the minimal geodesic distance between points and the mesh norm. The known theoretical properties fall well short of those suggested by the numerical experiments.

     

Interpolation and cubature approximations and analysis for a class of wideband integrals on the sphere

We propose, analyze, and implement interpolatory approximations and Filon-type cubature for efficient and accurate evaluation of a class of wideband generalized Fourier integrals on the sphere. The analysis includes derivation of (i) optimal order Sobolev norm error estimates for an explicit discrete Fourier transform type interpolatory approximation of spherical functions; and (ii) a wavenumber explicit error estimate of the order $\mathcal {O}(\kappa ^{-\ell } N^{-r_{\ell }})$ , for $\ell = 0, 1, 2$ , where $\kappa $ is the wavenumber, $2N^2$ is the number of interpolation/cubature points on the sphere and $r_{\ell }$ depends on the smoothness of the integrand. Consequently, the cubature is robust for wideband (from very low to very high) frequencies and very efficient for highly-oscillatory integrals because the quality of the high-order approximation (with respect to quadrature points) is further improved as the wavenumber increases. This property is a marked advantage compared to standard cubature that require at least ten points per wavelength per dimension and methods for which asymptotic convergence is known only with respect to the wavenumber subject to stable of computation of quadrature weights. Numerical results in this article demonstrate the optimal order accuracy of the interpolatory approximations and the wideband cubature.     

Best cubature formulas for some classes of functions of many variables

The problem of minimizing the error in the cubature formula for a given class of functions is considered. For cubature formulas with a lattice arrangement of points this problems is solved exactly for a wide class of functions of m variables.Basic contents of this paper presented with proofs at the Seminar on Theory of Functions at Dnepropetrovsk State University, December, 1965.Translated from Matematicheskie Zametki, Vol. 3, No. 5, pp. 565–576, May, 1968.     

Polynomial interpolation in several variables,cubature formulae,and ideals[*]Supported by the National Science Foundation under Grant DMS-9802265.

We discuss polynomial interpolation in several variables from a polynomial ideal point of view. One of the results states that if I is a real polynomial ideal with real variety and if its codimension is equal to the cardinality of its variety, then for each monomial order there is a unique polynomial that interpolates on the points in the variety. The result is motivated by the problem of constructing cubature formulae, and it leads to a theorem on cubature formulae which can be considered an extension of Gaussian quadrature formulae to several variables. This revised version was published online in June 2006 with corrections to the Cover Date.     

Constructing fully symmetric cubature formulae for the sphere

We construct symmetric cubature formulae of degrees in the 13-39 range for the surface measure on the unit sphere. We exploit a recently published correspondence between cubature formulae on the sphere and on the triangle. Specifically, a fully symmetric cubature formula for the surface measure on the unit sphere corresponds to a symmetric cubature formula for the triangle with weight function , where , , and are homogeneous coordinates.