Related papers: $\boldsymbol{L}_{\infty}$-approximation in Korobov…
We investigate multivariate integration for a space of infinitely times differentiable functions $\mathcal{F}_{s, \boldsymbol{u}} := \{f \in C^\infty [0,1]^s \mid \| f \|_{\mathcal{F}_{s, \boldsymbol{u}}} < \infty \}$, where $\| f…
We study linear polynomial approximation of functions in weighted Sobolev spaces $W^r_{p,w}(\mathbb{R}^d)$ of mixed smoothness $r \in \mathbb{N}$, and their optimality in terms of Kolmogorov and linear $n$-widths of the unit ball…
We study d-variate approximation problems in the average case setting with respect to a zero-mean Gaussian measure. Our interest is focused on measures having a structure of non-homogeneous linear tensor product, where covariance kernel is…
We study QPT (quasi-polynomial tractability) in the worst case setting for linear tensor product problems defined over Hilbert spaces. We assume that the domain space is a reproducing kernel Hilbert space so that function values are well…
The paper presents transfer functions for limited memory time-invariant linear integral predictors for continuous time processes such that the corresponding predicting kernels have bounded support. It is shown that processes with…
We study approximation properties of sequences of centered random elements $X_d$, $d\in\mathbb{N}$, with values in separable Hilbert spaces. We focus on sequences of tensor product-type random elements, which have covariance operators of…
It was recently shown in [4] that, for $L_2$-approximation of functions from a Hilbert space, function values are almost as powerful as arbitrary linear information, if the approximation numbers are square-summable. That is, we showed that…
Given $n$ samples of a function $f\colon D\to\mathbb C$ in random points drawn with respect to a measure $\varrho_S$ we develop theoretical analysis of the $L_2(D, \varrho_T)$-approximation error. For a parituclar choice of $\varrho_S$…
Motivated by numerical methods for solving parametric partial differential equations, this paper studies the approximation of multivariate analytic functions by algebraic polynomials. We introduce various anisotropic model classes based on…
We consider linear approximation based on function evaluations in reproducing kernel Hilbert spaces of certain analytic weighted power series kernels and stationary kernels on the interval $[-1,1]$. Both classes contain the popular Gaussian…
This paper explores the use of "generated sets" $\{ \{ k \boldsymbol{\zeta} \} : k = 1, \ldots, n \}$ for function approximation in reproducing kernel Hilbert spaces which consist of multi-dimensional functions with an absolutely convergent…
We extend results of the recursive-least-squares-with-forgetting-factor identifier for single-input-single-output systems to the multiple-output case by, under the assumption of persistence of excitation, deriving the corresponding…
The degrees of polynomials representing or approximating Boolean functions are a prominent tool in various branches of complexity theory. Sherstov recently characterized the minimal degree deg_{\eps}(f) among all polynomials (over the…
Approximation of high-dimensional functions is a problem in many scientific fields that is only feasible if advantageous structural properties, such as sparsity in a given basis, can be exploited. A relevant tool for analysing sparse…
We analyze the accuracy of the discrete least-squares approximation of a function $u$ in multivariate polynomial spaces $\mathbb{P}_\Lambda:={\rm span} \{y\mapsto y^\nu \,: \, \nu\in \Lambda\}$ with $\Lambda\subset \mathbb{N}_0^d$ over the…
We obtain the best approximation in $L^1(\R)$, by entire functions of exponential type, for a class of even functions that includes $e^{-\lambda|x|}$, where $\lambda >0$, $\log |x|$ and $|x|^{\alpha}$, where $-1 < \alpha < 1$. We also give…
This paper is devoted to discussing the weighted linear tensor product problems in the worst case setting. We consider algorithms that use finitely many evaluations of arbitrary continuous linear functionals. We investigate exponential $(s,…
How hard is it to estimate a discrete-time signal $(x_{1}, ..., x_{n}) \in \mathbb{C}^n$ satisfying an unknown linear recurrence relation of order $s$ and observed in i.i.d. complex Gaussian noise? The class of all such signals is…
We study multivariate linear tensor product problems with some special properties in the worst case setting. We consider algorithms that use finitely many continuous linear functionals. We use a unified method to investigate tractability of…
We consider the problem of approximating a smooth function from finitely-many pointwise samples using $\ell^1$ minimization techniques. In the first part of this paper, we introduce an infinite-dimensional approach to this problem. Three…