Related papers: Exponential Convergence of Deep Composite Polynomi…
We construct "large" Cantor sets whose complements resemble the unit disk arbitrarily well from the point of view of the squeezing function, and we construct "large" Cantor sets whose complements do not resemble the unit disk from the point…
We study multivariate integration over the $s$-dimensional unit cube in a weighted space of infinitely differentiable functions. It is known from a recent result by Suzuki that there exists a good quasi-Monte Carlo (QMC) rule which achieves…
We introduce two explicit examples of polynomials orthogonal on the unit circle. Moments and the reflection coefficients are expressed in terms of Jacobi elliptic functions. We find explicit expression for these polynomials in terms of a…
We seek to approximate a composite function h(x) = g(f(x)) with a global polynomial. The standard approach chooses points x in the domain of f and computes h(x) at each point, which requires an evaluation of f and an evaluation of g. We…
We investigate finite-dimensional constrained structured optimization problems, featuring composite objective functions and set-membership constraints. Offering an expressive yet simple language, this problem class provides a modeling…
We study approximation by arbitrary linear combinations of $n$ translates of a single function of periodic functions. We construct some methods of this approximation for functions in a class induced by the convolution with a given function,…
We consider the unconstrained optimization of multivariate trigonometric polynomials by the sum-of-squares hierarchy of lower bounds. We first show a convergence rate of $O(1/s^2)$ for the relaxation with degree $s$ without any assumption…
This paper presents a novel method for generating a single polynomial approximation that produces correctly rounded results for all inputs of an elementary function for multiple representations. The generated polynomial approximation has…
This is an expository paper aiming to introduce Zilber's Exponential Closedness conjecture to a general audience. Exponential Closedness predicts when (systems of) equations involving addition, multiplication, and exponentiation have…
We introduce Lipschitz continuous and $C^{1,1}$ geometric approximation and interpolation methods for sampled bounded uniformly continuous functions over compact sets and over complements of bounded open sets in $\mathbb{R}^n$ by using…
We analyze the convergence of compressive sensing based sampling techniques for the efficient evaluation of functionals of solutions for a class of high-dimensional, affine-parametric, linear operator equations which depend on possibly…
A method for approximating continuous functions $\mathbb{Z}_{p}^{n}\rightarrow\mathbb{Z}_{p}$ by a linear superposition of continuous functions $\mathbb{Z}_{p}\rightarrow\mathbb{Z}_{p}$ is presented and a polynomial regression model is…
We present a new algorithm for reconstructing an exact algebraic number from its approximate value using an improved parameterized integer relation construction method. Our result is consistent with the existence of error controlling on…
For a function $f$, continuous on a compact convex set $K$ and analytic in its interior we construct a sequence of almost optimal polynomials that converge with a geometric rate at points of analyticity of $f$.
We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on…
Interpolation and approximation of functionals with conditionally positive definite kernels is considered on sets of centers that are not determining for polynomials. It is shown that polynomial consistency is sufficient in order to define…
We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…
Many high-dimensional uncertainty quantification problems are solved by polynomial dimensional decomposition (PDD), which represents Fourier-like series expansion in terms of random orthonormal polynomials with increasing dimensions. This…
In this paper we study a family of limsup sets that are defined using iterated function systems. Our main result is an analogue of Khintchine's theorem for these sets. We then apply this result to the topic of intrinsic Diophantine…
Two approximations of the integral of a class of sinusoidal composite functions, for which an explicit form does not exist, are derived. Numerical experiments show that the proposed approximations yield an error that does not depend on the…