Related papers: A Remark on the Convolution with Box Splines
A non-algorithmic, generalized version of a recent result, asserting that a natural relaxation of the Koml\'os conjecture from boolean discrepancy to spherical discrepancy is true, is proved by a very short argument using convex geometry.
The Subspace Theorem is a powerful tool in number theory. It has appeared in various forms and been adapted and improved over time. It's applications include diophantine approximation, results about integral points on algebraic curves and…
We consider the problem of decomposing a multivariate polynomial as the difference of two convex polynomials. We introduce algebraic techniques which reduce this task to linear, second order cone, and semidefinite programming. This allows…
We consider the problem of approximating a semialgebraic set with a sublevel-set of a polynomial function. In this setting, it is standard to seek a minimum volume outer approximation and/or maximum volume inner approximation. As there is…
Semialgebraic splines are functions that are piecewise polynomial with respect to a cell decomposition into sets defined by polynomial inequalities. We study bivariate semialgebraic splines, formulating spaces of semialgebraic splines in…
We propose a new class of semi-implicit methods for solving nonlinear fractional differential equations and study their stability. Several versions of our new schemes are proved to be unconditionally stable by choosing suitable parameters.…
Univariate pseudo-splines are a generalization of uniform B-splines and interpolatory $2n$-point subdivision schemes. Each pseudo-spline is characterized as the subdivision scheme with least possible support among all schemes with specific…
The Bernstein polynomial basis sees significant use owing to its unique properties, particularly in the field of optimal control. However, the basis is known to have a slow rate of convergence to the function it approximates. With this in…
The Jacobi polynomial has been advocated by many authors as a useful tool to evolve non-singlet structure functions to higher $Q^2$. In this work, it is found that the convergence of the polynomial sum is not absolute, as there is always a…
We find particular relations which we call "Bernoulli-type" in some noncommutative polynomial ring with a single nontrivial relation. More precisely, our ring is isomorphic to the universal enveloping algebra of a two-dimensional…
Solving a system of nonlinear inequalities is an important problem for which conventional numerical analysis has no satisfactory method. With a box-consistency algorithm one can compute a cover for the solution set to arbitrarily close…
We introduce a guide to help deep learning practitioners understand and manipulate convolutional neural network architectures. The guide clarifies the relationship between various properties (input shape, kernel shape, zero padding, strides…
Many uncertainty sets encountered in control systems analysis and design can be expressed in terms of semialgebraic sets, that is as the intersection of sets described by means of polynomial inequalities. Important examples are for instance…
We investigate dimension-theoretic properties of concentric topological spheres, which are fractal sets emerging both in pure and applied mathematics. We calculate the box dimension and Assouad spectrum of such collections, and use them to…
We prove strong convergence of a semi-discrete finite difference method for the KdV and modified KdV equations. We extend existing results to non-smooth data (namely, in $L^2$), without size restrictions. Our approach uses a fourth order…
We introduce the concept of compressed convolution, a technique to convolve a given data set with a large number of non-orthogonal kernels. In typical applications our technique drastically reduces the effective number of computations. The…
Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…
We consider the existence of convolution of Roumieu type ultradistribution with the kernel $e^{s(1+|x|^2)^{q/2}}, q\geq 1$, $s\in\RR\backslash\{0\}$.
Discrete trigonometric transformations, such as the discrete Fourier and cosine/sine transforms, are important in a variety of applications due to their useful properties. For example, one well-known property is the convolution theorem for…
We shall give a variational formula of the full Bergman kernels associated to a family of smoothly bounded strongly pseudoconvex domains. An equivalent criterion for the triviality of holomorphic motions of planar domains in terms of the…