Related papers: Sharp error estimates for spline approximation: ex…
In this article we develop function-based a posteriori error estimators for the solution of linear second order elliptic problems considering hierarchical spline spaces for the Galerkin discretization. We prove a global upper bound for the…
We consider the problem of approximating smoothing spline estimators in a nonparametric regression model. When applied to a sample of size $n$, the smoothing spline estimator can be expressed as a linear combination of $n$ basis functions,…
Smoothing splines have been used pervasively in nonparametric regressions. However, the computational burden of smoothing splines is significant when the sample size $n$ is large. When the number of predictors $d\geq2$, the computational…
We prove lower bounds for the approximation error of the variation-diminishing Schoenberg operator on the interval $[0,1]$ in terms of classical moduli of smoothness depending on the degree of the spline basis using a functional analysis…
The aim of this paper is to develop stable and accurate numerical schemes for boundary integral formulations of the heat equation with Dirichlet boundary conditions. The accuracy of Galerkin discretisations for the resulting boundary…
Optimization-based problems have become of great interest for signal approximation purposes, as they achieved good accuracy results while being extremely flexible and versatile. In this work, we put our focus on the context of periodic…
Krylov subspace methods are a powerful tool for efficiently solving high-dimensional linear algebra problems. In this work, we study the approximation quality that a Krylov subspace provides for estimating the numerical range of a matrix.…
We give a short survey of recent results on sparse-grid linear algorithms of approximate recovery and integration of functions possessing a unweighted or weighted Sobolev mixed smoothness based on their sampled values at a certain finite…
The methods of approximation, regularization and smoothing of trigonometric interpolation splines are considered in the paper. It is shown that trigonometric splines can be considered from two points of view - as a trigonometric Fourier…
This paper studies smoothing properties of the local fractional maximal operator, which is defined in a proper subdomain of the Euclidean space. We prove new pointwise estimates for the weak gradient of the maximal function, which imply…
Single hidden layer feedforward neural networks can represent multivariate functions that are sums of ridge functions. These ridge functions are defined via an activation function and customizable weights. The paper deals with best…
The Sinc approximation is a function approximation formula that attains exponential convergence for rapidly decaying functions defined on the whole real axis. Even for other functions, the Sinc approximation works accurately when combined…
On smooth compact manifolds with smooth boundary, we first establish the sharp lower bounds for the restrictions of harmonic functions in terms of their frequency functions, by using a combination of microlocal analysis and frequency…
In this article some explicit estimates on the decay of the convolutive inverse of a sequence are proved. They are derived from the functional calculus for Sobolev algebras. Applications include localization in spline-type spaces and…
Error estimates for approximations of harmonic functions on planar regions by subspaces spanned by the first harmonic Steklov eigenfunctions are found. They are based on the explicit representation of harmonic functions in terms of these…
Approximations of the Dirac delta distribution are commonly used to create sequences of smooth functions approximating nonsmooth (generalized) functions, via convolution. In this work, we show a priori rates of convergence of this…
In this paper, we revisit approximation properties of piecewise polynomial spaces, which contain more than ${\cal P}_{r-1}$ but not ${\cal P}_r$. We develop more accurate upper and lower error bounds that are sharper than those used in…
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded error. In applications of this method to semidefinite programs,…
Bilevel optimization problems are receiving increasing attention in machine learning as they provide a natural framework for hyperparameter optimization and meta-learning. A key step to tackle these problems is the efficient computation of…
We introduce a novel type of approximation spaces for functions with values in a nonlinear manifold. The discrete functions are constructed by piecewise polynomial interpolation in a Euclidean embedding space, and then projecting pointwise…