Related papers: Convergence rate for weighted polynomial approxima…
Efficient and stable algorithms for the calculation of spectral quantities and correlation functions are some of the key tools in computational condensed matter physics. In this article we review basic properties and recent developments of…
A new type of combinations of Bernstein operators is given in [1]. Here, we introduce another one, which can be used to approximate the functions with singularities. The direct and inverse results of the weighted approximation of this new…
The scientific literature contains a number of numerical approximation results for stochastic partial differential equations (SPDEs) with superlinearly growing nonlinearities but, to the best of our knowledge, none of them prove strong or…
We show that it is $\mathsf{NP}$-hard to approximate the hyperspherical radius of a triangulated manifold up to an almost-polynomial factor.
We study the convergence of these operators in a weighted space of functions on a positive semi-axis and estimate the approximation by using a new type of weighted modulus of continuity and error estimation.
Theorems of Khintchine, Groshev, Jarn\'ik, and Besicovitch in Diophantine approximation are fundamental results on the metric properties of $\Psi$-well approximable sets. These foundational results have since been generalised to the…
Numerical approximation of a general class of nonlinear unidirectional wave equations with a convolution-type nonlocality in space is considered. A semi-discrete numerical method based on both a uniform space discretization and the discrete…
We investigate training and using Gaussian kernel SVMs by approximating the kernel with an explicit finite- dimensional polynomial feature representation based on the Taylor expansion of the exponential. Although not as efficient as the…
Low-rank approximation of kernels is a fundamental mathematical problem with widespread algorithmic applications. Often the kernel is restricted to an algebraic variety, e.g., in problems involving sparse or low-rank data. We show that…
Given a finite metric space $(X\cup Y, \mathbf{d})$ the $k$-median problem is to find a set of $k$ centers $C\subseteq Y$ that minimizes $\sum_{p\in X} \min_{c\in C} \mathbf{d}(p,c)$. In general metrics, the best polynomial time algorithm…
We study approximation properties of weighted $L^2$-orthogonal projectors onto the space of polynomials of degree less than or equal to $N$ on the unit disk where the weight is of the generalized Gegenbauer form $x \mapsto…
In recent developments, a general approach for solving Riemann--Hilbert problems numerically has been developed. We review this numerical framework, and apply it to the calculation of orthogonal polynomials on the real line. Combining this…
We strengthen the Weierstrass approximation theorem by proving that any real-valued continuous function on an interval $I \subset \mathbb{R}$ can be uniformly approximated by a real-valued polynomial whose only (possibly complex) critical…
Given a basic compact semi-algebraic set $\K\subset\R^n$, we introduce a methodology that generates a sequence converging to the volume of $\K$. This sequence is obtained from optimal values of a hierarchy of either semidefinite or linear…
We propose a kernel mixture of polynomials prior for Bayesian nonparametric regression. The regression function is modeled by local averages of polynomials with kernel mixture weights. We obtain the minimax-optimal rate of contraction of…
We study the asymptotic behaviour of the approximation, Gelfand and Kolmogorov numbers of the compact embeddings of weighted function spaces of Besov and Triebel-Lizorkin type in the case where the weights belong to a large class. We obtain…
In this paper, we present a new iterative approximate method of solving boundary value problems. The idea is to compute approximate polynomial solutions in the Bernstein form using least squares approximation combined with some properties…
The general theory of greedy approximation with respect to arbitrary dictionaries is well developed in the case of real Banach spaces. Recently, some of results proved for the Weak Chebyshev Greedy Algorithm (WCGA) in the case of real…
We establish simultaneous approximation properties of weighted first-order Sobolev orthogonal projectors onto spaces of polynomials of bounded total degree in the Euclidean unit ball. The simultaneity is in the sense that we provide bounds…
This paper is devoted to find the numerical solutions of one dimensional general nonlinear system of third-order boundary value problems (BVPs) for the pair of functions using Galerkin weighted residual method. We derive mathematical…