Weighted cubature formulas for periodic functions

This article contains a study of weighted cubature formulas for periodic functions in n-dimensional Euclidean space with matrix period H. The principal error terms are considered.Translated from Matematicheskie Zametki, Vol. 3, No. 3, pp. 319–326, March, 1968.The author wishes to express his deep appreciation of S. L. Sobolev's guidance in this work.     

Weighted spherical semidesigns and cubature formulae for calculating integrals on a sphere

In this paper we study weighted spherical semidesigns, i.e., systems of points on a sphere of a specific type. We propose a new proof of the necessary and sufficient condition for a system of points on a sphere to be a weighted spherical semidesign. This criterion gives new approaches to the construction of cubature formulae for calculating integrals over a sphere with the degree of accuracy of 5 and 9.     

Extremal functions of forbidden multidimensional matrices

Pattern avoidance is a central topic in graph theory and combinatorics. Pattern avoidance in matrices has applications in computer science and engineering, such as robot motion planning and VLSI circuit design. A $d$-dimensional zero–one matrix $A$ avoids another$d$-dimensional zero–one matrix $P$ if no submatrix of $A$ can be transformed to $P$ by changing some ones to zeros. A fundamental problem is to study the maximum number of nonzero entries in a $d$-dimensional $n\times ?\times n$ matrix that avoids $P$. This maximum number, denoted by $f(n,P,d)$, is called the extremal function.We advance the extremal theory of matrices in two directions. The methods that we use come from combinatorics, probability, and analysis. Firstly, we obtain non-trivial lower and upper bounds on $f(n,P,d)$ when $n$ is large for every $d$-dimensional block permutation matrix $P$. We establish the tight bound $\Theta \left(n^{d?1}\right)$ on $f(n,P,d)$ for every $d$-dimensional tuple permutation matrix $P$. This tight bound has the lowest possible order that an extremal function of a nontrivial matrix can ever achieve. Secondly, we show that the limit inferior of the sequence $\left\{\frac{f(n,P,d)}{n^{d?1}}\right\}$ has a lower bound $2^{\Omega \left(k^{1∕2}\right)}$ for a family of $k\times ?\times k$ permutation matrices $P$. We also improve the upper bound on the limit superior from $2^{O(klogk)}$ to $2^{O\left(k\right)}$ for all $k\times ?\times k$ permutation matrices and show that the new upper bound also holds for tuple permutation matrices.     

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.     

Optimal cubature formulas for calculation of multidimensional integrals in weighted Sobolev spaces

Optimal cubature formulas are constructed for calculations of multidimensional integrals in weighted Sobolev spaces. We consider some classes of functions defined in the cube Ω = [-1, 1]^l, l = 1, 2,..., and having bounded partial derivatives up to the order r in Ω and the derivatives of jth order (r < j ≤ s) whose modulus tends to infinity as power functions of the form (d(x, Г))^-(j-r), where x ∈ Ω Г, x = (x₁,..., x_l), Г = ?Ω, and d(x, Г) is the distance from x to Г.     

Determinantal formulas for zonal spherical functions on hyperboloids

Abstract. We construct determinantal expressions for the zonal spherical functions on the hyperboloids with p,q odd (and larger than 1). This gives rise to explicit evaluation formulas for hypergeometric series representing half-integer parameter families of Jacobi functions and (via specialization) Jacobi polynomials. Received November 18, 1999 / Published online October 30, 2000     

Isometric embed-dings between classical Banach spaces,cubature formulas,and spherical designs

If an isometric embeddingl _p ^m →l _q ⁿ with finitep, q>1 exists, thenp=2 andq is an even integer. Under these conditions such an embedding exists if and only ifn?N(m, q) where $$\left( {\begin{array}{*{20}c} {m + q/2 - 1} \\ {m - 1} \\ \end{array} } \right) \leqslant N(m,q) \leqslant \left( {\begin{array}{*{20}c} {m + q - 1} \\ {m - 1} \\ \end{array} } \right).$$ To construct some concrete embeddings, one can use orbits of orthogonal representations of finite groups. This yields:N(2,q)=q/2+1 (by regular (q+2)-gon),N(3, 4)=6 (by icosahedron),N(3, 6)?11 (by octahedron), etc. Another approach is based on relations between embeddings, Euclidean or spherical designs and cubature formulas. This allows us to sharpen the above lower bound forN(m, q) and obtain a series of concrete values, e.g.N(3, 8)=16 andN(7, 4)=28. In the cases (m, n, q)=(3, 6, 10) and (3, 8, 15) some ε-embeddings with ε ～ 0.03 are constructed by the orbit method. The rigidness of spherical designs in Bannai's sense and a similar property for the embeddings are considered, and a conjecture of [7] is proved for any fixed (m, n, q).     

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.     

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.     

An encyclopaedia of cubature formulas

About 13 years ago we started collecting published cubature formulas for the approximation of multivariate integrals over some standard regions. In this paper we describe how we make this information available to a larger audience via the World Wide Web.     

Best cubature formulas for some classes of continuous functions of two variables

The exact value of the error of a cubature formula is determined for some classes of continuous functions of two variables defined by strictly monotone moduli of continuity.     

Symmetric cubature formulas for a truncated octahedron

For a truncated octahedron, which can be used to fill the whole space R³ by translating it, we construct symmetric cubature formulas, exact for polynomials of degrees 3, 5, and 7. We furnish estimates of the remainder terms, and we discuss the problem of numerical integration over an arbitrary bounded domain D R³.Translated from Matematicheskie Zametki, Vol. 14, No. 5, pp. 667–675, November, 1973.In conclusion I wish to thank S. B. Stechkin for his statement of the problem and for his constant interest in the course of its solution.     

The existence of Gaussian cubature formulas

We provide a necessary and sufficient condition for the existence of Gaussian cubature formulas. It consists of checking whether an overdetermined linear system has a solution and so complements Mysovskikh’s theorem which requires computing common zeros of orthonormal polynomials. Moreover, the size of the linear system shows that the existence of a cubature formula imposes severe restrictions on the associated linear functional. For fixed precision (or degree), the larger the number of variables, the worse it gets. And for fixed number of variables, the larger the precision, the worse it gets. Finally, we also provide an interpretation of the necessary and sufficient condition in terms of the existence of a polynomial with very specific properties.     

Optimal cubature formulas on compact homogeneous manifolds

We find lower bounds for the rate of convergence of optimal cubature formulas on sets of differentiable functions on compact homogeneous manifolds of rank I or two-point homogeneous spaces. It is shown that these lower bounds are sharp in the power scale in the case of S², the unit sphere in R³.     

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.