Related papers: A Universal Algorithm for Multivariate Integration
We reconsider a recently published algorithm (Dalkilic et al.) for merging lists by way of the perfect shuffle. The original publication gave only experimental results which, although consistent with linear execution time on the samples…
Optimal higher-order Sobolev type embeddings are shown to follow via isoperimetric inequalities. This establishes a higher-order analogue of a well-known link between first-order Sobolev embeddings and isoperimetric inequalities. Sobolev…
We consider the problem of learning a $d$-variate function $f$ defined on the cube $[-1,1]^d\subset {\mathbb R}^d$, where the algorithm is assumed to have black box access to samples of $f$ within this domain. Denote ${\mathcal S}_r \subset…
In this article, we give probabilistic versions of Sobolev embeddings on any Riemannian manifold $(M,g)$. More precisely, we prove that for natural probability measures on $L^2(M)$, almost every function belong to all spaces $L^p(M)$,…
We study mutually unbiased maximally entangled bases (MUMEB's) in bipartite system $\mathbb{C}^d\otimes\mathbb{C}^d (d \geq 3)$. We generalize the method to construct MUMEB's given in [16], by using any commutative ring $R$ with $d$…
The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize the supremum norm over a compact set in $\C^d.$ We study this problem on general sets, but devote special attention to product sets…
We perform a classification of integrable systems of mixed scalar and vector evolution equations with respect to higher symmetries. We consider polynomial systems that are homogeneous under a suitable weighting of variables. This paper…
This paper designs an alogrithm to compute the minimal combinations of finite sets in Euclidean spaces, and applys the algorithm of study the moment maps and geometric invariant stability of hypersurfaces. The classical example of cubic…
In this paper, we deal with several aspects of the universal Frolov cubature method, that is known to achieve optimal asymptotic convergence rates in a broad range of function spaces. Even though every admissible lattice has this favorable…
This paper proposes a practical and efficient solution for computing convolutions using hybrid dealiasing. It offers an alternative to explicit or implicit dealiasing and includes an optimized hyperparameter tuning algorithm that uses…
In a seminal paper on finding large matchings in sparse random graphs, Karp and Sipser proposed two algorithms for this task. The second algorithm has been intensely studied, but due to technical difficulties, the first algorithm has…
This paper proposes a universal algorithm for convex minimization problems of the composite form $g_0(x)+h(g_1(x),\dots, g_m(x)) + u(x)$. We allow each $g_j$ to independently range from being nonsmooth Lipschitz to smooth, from convex to…
We consider linear problems in the worst case setting. That is, given a linear operator and a pool of admissible linear measurements, we want to approximate the values of the operator uniformly on a convex and balanced set by means of…
This paper is concerned with the optimal convergence rate in homogenization of higher order parabolic systems with bounded measurable, rapidly oscillating periodic coefficients. The sharp $O(\va)$ convergence rate in the space $L^2(0,T;…
It is well known that selecting a good Mixed Integer Programming (MIP) formulation is crucial for an effective solution with state-of-the art solvers. While best practices and guidelines for constructing good formulations abound, there is…
In quantum mechanics some properties are maximally incompatible, such as the position and momentum of a particle or the vertical and horizontal projections of a 2-level spin. Given any definite state of one property the other property is…
In this paper in the space $L_2^{(m)}(0,1)$ the problem of construction of optimal quadrature formulas is considered. Here the quadrature sum consists on values of integrand at nodes and values of first derivative of integrand at the end…
In the present paper in $L_2^{(2)}(0,1)$ S.L.Sobolev space the optimal quadrature formula is constructed for approximate calculation of Cauchy type singular integral.
We investigate the numerical approximation of integrals over $\mathbb{R}^d$ equipped with the standard Gaussian measure $\gamma$ for integrands belonging to the Gaussian-weighted Sobolev spaces $W^\alpha_p(\mathbb{R}^d, \gamma)$ of mixed…
We develop a novel unified randomized block-coordinate primal-dual algorithm to solve a class of nonsmooth constrained convex optimization problems, which covers different existing variants and model settings from the literature. We prove…