Related papers: Cubature formulas on combinatorial graphs

We prove lower bounds for the error of optimal cubature formulae for $d$-variate functions from Besov spaces of mixed smoothness $B^{\alpha}_{p,\theta}({\mathbb G}^d)$ in the case $0 < p, \theta \le \infty$ and $\alpha > 1/p$, where…

For Paley-Wiener functions on weighted combinatorial finite or infinite graphs we develop a weighted sampling theory in which samples are defined as inner products with weight functions (measuring devices). Three reconstruction methods are…

We introduce a new type of cubature formula for the evaluation of an integral over the disk with respect to a weight function. The method is based on an analysis of the Fourier series of the weight function and a reduction of the bivariate…

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).…

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)…

The optimal calculation order of a computational graph can be represented by a set of algebraic expressions. Computational graph and algebraic expression both have close relations and significant differences, this paper looks into these…

The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years. This theory is a spin-off of discrete convex analysis by Murota, and is motivated by…

We discuss the direct use of cubic-matrix splines to obtain continuous approximations to the unique solution of matrix models of the type $Y''(x) = f(x,Y(x))$. For numerical illustration, an estimation of the approximation error, an…

Closed formulae for all Gaussian or optimal, 1-parameter quadrature rules in a compact interval [a, b] with non uniform, asymmetric subintervals, arbitrary number of nodes per subinterval for the spline classes $S_{2N, 0}$ and $S_{2N+1,…

We prove local and global upper estimates for the infimum of the mean curvature, the scalar curvature and the norm of the shape operator of graphs in a warped product space. Using these estimates, we obtain some results on pseudo-hyperbolic…

Cubature on Wiener space [Lyons, T.; Victoir, N.; Proc. R. Soc. Lond. A 8 January 2004 vol. 460 no. 2041 169-198] provides a powerful alternative to Monte Carlo simulation for the integration of certain functionals on Wiener space. More…

We consider a sequence of composite bivariate Bernstein operators and the cubature formula associated with them. The upper bounds for the remainder term of the cubature formula are described in terms of moduli of continuity of order two.…

A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…

In a recent article by two of the present authors it turned out that Frolov's cubature formulae are optimal and universal for various settings (Besov-Triebel-Lizorkin spaces) of functions with dominating mixed smoothness. Those cubature…

We obtain an explicit error expansion for the solution of Backward Stochastic Differential Equations (BSDEs) using the cubature on Wiener spaces method. The result is proved under a mild strengthening of the assumptions needed for the…

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…

In practice symmetries of combinatorial structures are computed by transforming the structure into an annotated graph whose automorphisms correspond exactly to the desired symmetries. An automorphism solver is then employed to compute the…

We describe a new method to compute general cubature formulae. The problem is initially transformed into the computation of truncated Hankel operators with flat extensions. We then analyse the algebraic properties associated to flat…

This paper investigates the combinatorial $\alpha$-curvature for vertex scaling of piecewise hyperbolic metrics on polyhedral surfaces, which is a parameterized generalization of the classical combinatorial curvature. A discrete…

How does one generalize differential geometric constructs such as curvature of a manifold to the discrete world of graphs and other combinatorial structures? This problem carries significant importance for analyzing models of discrete…