Related papers: Approximation of Hausdorff operators
A unified approach to the concept of a Hausdorff operator is proposed in such a way that a number of classical and new operators feet into the given definition. Conditions are given for the boundedness of the operators under consideration…
In this work, we develop a method for rational approximation of the Fourier transform (FT) based on the real and imaginary parts of the complex error function \[ w(z) = e^{-z^2}(1 - {\rm{erf}}(-iz)) = K(x,y) + iL(x,y), \qquad z = x + iy, \]…
Let (\mathscr{F}) be the one dimensional Fourier-Plancherel operator and (E) be a subset of the real axis. The truncated Fourier operator is the operator (\mathscr{F}_E) of the form (\mathscr{F}_E=P_E\mathscr{F}P_E), where…
Bernstein's theorem (also called Hausdorff--Bernstein--Widder theorem) enables the integral representation of a completely monotonic function. We introduce a finite completely monotonic function, which is a completely monotonic function…
In this paper, we construct a linear positive operators q-parametric Szasz-Mirakjan operators generated by the q-Dunkl generalization of the exponential function. We obtain Korovkin's type approximation theorem for these operators and…
This paper offers a newly created integral approach for operators employing the orthogonal modified Laguerre polynomials and P\u{a}lt\u{a}nea basis. These operators approximate the functions over the interval $[0,\infty)$. Further, the…
In 'Tractable semi-algebraic approximation using Christoffel-Darboux kernel' Marx, Pauwels, Weisser, Henrion and Lasserre conjectured, that the approximation rate $\mathcal O(\frac 1 {\sqrt(d)})$ of a Lipschitz functions by a semi-algebraic…
Our main aim is to investigate the approximation properties for the summation integral type operators in a statistical sense. In this regard, we prove the statistical convergence theorem using well known Korovkin theorem and the degree of…
We consider the problem of approximating a truncated Gaussian kernel using Fourier (trigonometric) functions. The computation-intensive bilateral filter can be expressed using fast convolutions by applying such an approximation to its range…
In this paper we propose an approximation method for high-dimensional $1$-periodic functions based on the multivariate ANOVA decomposition. We provide an analysis on the classical ANOVA decomposition on the torus and prove some important…
Devoted to multi-task learning and structured output learning, operator-valued kernels provide a flexible tool to build vector-valued functions in the context of Reproducing Kernel Hilbert Spaces. To scale up these methods, we extend the…
The Hausdorff distance is a metric commonly used to compute the set similarity of geometric sets. For sets containing a total of $n$ points, the exact distance can be computed na\"{i}vely in $O(n^2)$ time. In this paper, we show how to…
The Laguerre functions $l_{n,\tau}^\alpha$, $n=0,1,\dots$, are constructed from generalized Laguerre polynomials. The functions $l_{n,\tau}^\alpha$ depend on two parameters: scale $\tau>0$ and order of generalization $\alpha>-1$, and form…
The Hausdorff dimension of the set of simultaneously tau well approximable points lying on a curve defined by a polynomial P(X)+alpha, where P(X) is a polynomial with integer coefficients and alpha is in R, is studied when tau is larger…
Given a weight vector $\tau=(\tau_{1}, \dots, \tau_{n}) \in \mathbb{R}^{n}_{+}$ with each $\tau_{i}$ bounded by certain constraints, we obtain a lower bound for the Hausdorff dimension of the set of $\tau$-approximable points points over a…
We show that simple modifications to van der Hoeven's forward and inverse truncated Fourier transforms allow the algorithms to be performed in-place, and with only a linear overhead in complexity.
When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given…
In this paper, some approximation properties of $(p,q)$-analogue of Bernstein-Stancu Operators has been studied. Rate of statistical convergence by means of modulus of continuity and Lipschitz type maximal functions has been investigated.…
Low-rank tensor approximation techniques attempt to mitigate the overwhelming complexity of linear algebra tasks arising from high-dimensional applications. In this work, we study the low-rank approximability of solutions to linear systems…
We investigate the approximation of quadratic Dirichlet $L$-functions over function fields by truncations of their Euler products. We first establish representations for such $L$-functions as products over prime polynomials times products…