English
Related papers

Related papers: New lower bounds for the integration of periodic f…

200 papers

We mainly study numerical integration of real valued functions defined on the $d$-dimensional unit cube with all partial derivatives up to some finite order $r\ge1$ bounded by one. It is well known that optimal algorithms that use $n$…

Numerical Analysis · Mathematics 2017-06-22 Aicke Hinrichs , Erich Novak , Mario Ullrich , Henryk Wozniakowski

In this paper we propose a new approach to least squares approximation problems. This approach is based on partitioning and Schur function. The nature of this approach is combinatorial, while most existing approaches are based on algebra…

Numerical Analysis · Mathematics 2018-05-31 Nadezda Sukhorukova , Julien Ugon

A general lower bound is developed for the minimax risk when estimating an arbitrary functional. The bound is based on testing two composite hypotheses and is shown to be effective in estimating the nonsmooth functional…

Statistics Theory · Mathematics 2011-05-17 T. Tony Cai , Mark G. Low

"Period collapse" refers to any situation where the period of the Ehrhart function of a polytope is less than the denominator of that polytope. We study several interesting situations where this occurs, primarily involving triangles. For…

Combinatorics · Mathematics 2015-09-08 Dan Cristofaro-Gardiner , Teresa Xueshan Li , Richard Stanley

We provide a new upper bound for sampling numbers $(g_n)_{n\in \mathbb{N}}$ associated to the compact embedding of a separable reproducing kernel Hilbert space into the space of square integrable functions. There are universal constants…

Numerical Analysis · Mathematics 2021-02-11 Nicolas Nagel , Martin Schäfer , Tino Ullrich

The integral of the Wigner function over a subregion of the phase-space of a quantum system may be less than zero or greater than one. It is shown that for systems with one degree of freedom, the problem of determining the best possible…

Quantum Physics · Physics 2009-10-31 A. J. Bracken , H. -D. Doebner , J. G. Wood

Recently, collocation based radial basis function (RBF) partition of unity methods (PUM) for solving partial differential equations have been formulated and investigated numerically and theoretically. When combined with stable evaluation…

Numerical Analysis · Mathematics 2017-02-24 Elisabeth Larsson , Victor Shcherbakov , Alfa Heryudono

We study here the error of numerical integration on metric measure spaces adapted to a decomposition of the space into disjoint subsets. We consider both the error for a single given function, and the worst case error for all functions in a…

Analysis of PDEs · Mathematics 2018-02-19 Luca Brandolini , William W. L. Chen , Leonardo Colzani , Giacomo Gigante , Giancarlo Travaglini

The theory of slice regular functions is nowadays widely studied and has found its elegant applications to a functional calculus for quaternionic linear operators and Schur analysis. However, much less is known about their boundary…

Complex Variables · Mathematics 2020-02-05 Guangbin Ren , Xieping Wang

In this paper we give a new proof of the second order Boltzmann-Gibbs principle. The proof does not impose the knowledge on the spectral gap inequality for the underlying model and it relies on a proper decomposition of the antisymmetric…

Probability · Mathematics 2017-08-30 Patricia Gonçalves , Milton Jara , Marielle Simon

Inspired by the boolean discrepancy problem, we study the following optimization problem which we term \textsc{Spherical Discrepancy}: given $m$ unit vectors $v_1, \dots, v_m$, find another unit vector $x$ that minimizes $\max_i \langle x,…

Computational Complexity · Computer Science 2019-11-19 Chris Jones , Matt McPartlon

Recently, Trefethen (SIAM Review 50 (2008), 67--87) and Xiang and Bornemann (SIAM J. Numer. Anal. 50 (2012), 2581--2587) investigated error bounds for n-point Gauss and Clenshaw-Curtis quadrature for the Legendre weight with integrands…

Numerical Analysis · Mathematics 2015-09-04 Kai Diethelm

We provide tools to help automate the error analysis of algorithms that evaluate simple functions over the floating-point numbers. The aim is to obtain tight relative error bounds for these algorithms, expressed as a function of the unit…

Numerical Analysis · Mathematics 2024-05-07 Jean-Michel Muller , Bruno Salvy

The backward-backward algorithm is a tool for finding minima of a regularization of the sum of two convex functions in Hilbert spaces. We generalize this setting to Hadamard spaces and prove the convergence of an error-tolerant version of…

Optimization and Control · Mathematics 2013-10-01 Sebastian Banert

We provide lower error bounds for randomized algorithms that approximate integrals of functions depending on an unrestricted or even infinite number of variables. More precisely, we consider the infinite-dimensional integration problem on…

Numerical Analysis · Mathematics 2021-02-09 Michael Gnewuch

In a recent paper, Carrell and Goulden found a combinatorial identity of the Bernstein operators that they then used to prove Bernstein's Theorem. We show that this identity is a straightforward consequence of the classical result. We also…

Combinatorics · Mathematics 2020-09-08 J. T. Hird , Naihuan Jing , Ernest Stitzinger

Destructive interference between signal and background processes poses a fundamental challenge in searches for top-philic scalar resonances, significantly reducing experimental sensitivity to well-motivated extensions of the Higgs sector.…

High Energy Physics - Phenomenology · Physics 2026-04-29 Diego A. Baron Moreno , Christoph Englert , Yvonne Peters

We study two notions of Dirichlet problem associated with BV energy minimizers (also called functions of least gradient) in bounded domains in metric measure spaces whose measure is doubling and supports a $(1,1)$-Poincar\'e inequality.…

Analysis of PDEs · Mathematics 2016-12-20 Riikka Korte , Panu Lahti , Xining Li , Nageswari Shanmugalingam

For many years, exact metric search relied upon the property of triangle inequality to give a lower bound on uncalculated distances. Two exclusion mechanisms derive from this property, generally known as pivot exclusion and hyperplane…

Data Structures and Algorithms · Computer Science 2022-11-11 Richard Connor

The Schwartz-Zippel Lemma states that if a low-degree multivariate polynomial with coefficients in a field is not zero everywhere in the field, then it has few roots on every finite subcube of the field. This fundamental fact about…

Computational Complexity · Computer Science 2024-11-13 Albert Atserias , Iddo Tzameret