English
Related papers

Related papers: Polyharmonic approximation on the sphere

200 papers

The direct and inverse theorems are established for the best approximation in the weighted $L^p$ space on the unit sphere of $\RR^{d+1}$, in which the weight functions are invariant under finite reflection groups. The theorems are stated…

Classical Analysis and ODEs · Mathematics 2007-05-23 Yuan Xu

Fractional order controllers become increasingly popular due to their versatility and superiority in various performance. However, the bottleneck in deploying these tools in practice is related to their analog or numerical implementation.…

Numerical Analysis · Mathematics 2021-01-28 Yiheng Wei , YangQuan Chen , Yingdong Wei , Xuefeng Zhang

Approximation properties of the expansions $\sum_{k\in{\mathbb z}^d}c_k\phi(M^jx+k)$, where $M$ is a matrix dilation, $c_k$ is either the sampled value of a signal $f$ at $M^{-j}k$ or the integral average of $f$ near $M^{-j}k$ (falsified…

Functional Analysis · Mathematics 2014-07-02 A. Krivoshein , M. Skopina

We consider the pointwise approximation of a subharmonic function by the logarithm of the modulus of an entire function up to a bounded quantity. In the case of finite order an estimate from below of the planar Lebesgue measure of an…

Complex Variables · Mathematics 2010-01-08 Markiyan Hirnyk

We study approximation of functions by algebraic polynomials in the H\"older spaces corresponding to the generalized Jacobi translation and the Ditzian-Totik moduli of smoothness. By using modifications of the classical moduli of…

Classical Analysis and ODEs · Mathematics 2016-02-17 Yurii Kolomoitsev , Tetiana Lomako , Jürgen Prestin

We provide a comprehensive study of interrelations between different measures of smoothness of functions on various domains and smoothness properties of approximation processes. Two general approaches to this problem have been developed:…

Classical Analysis and ODEs · Mathematics 2020-03-18 Yu. Kolomoitsev , S. Tikhonov

This paper considers optimization of smooth nonconvex functionals in smooth infinite dimensional spaces. A H\"older gradient descent algorithm is first proposed for finding approximate first-order points of regularized polynomial…

Optimization and Control · Mathematics 2021-04-07 Serge Gratton , Sadok Jerad , Philippe L. Toint

We prove almost sharp upper bounds for the $L^p$ norms of eigenfunctions of the full ring of invariant differential operators on a compact locally symmetric space, as well as their restrictions to maximal flat subspaces. Our proof combines…

Analysis of PDEs · Mathematics 2016-06-22 Simon Marshall

In this paper we provide a priori error estimates in standard Sobolev (semi-)norms for approximation in spline spaces of maximal smoothness on arbitrary grids. The error estimates are expressed in terms of a power of the maximal grid…

Numerical Analysis · Mathematics 2019-07-09 Espen Sande , Carla Manni , Hendrik Speleers

Given cell-average data values of a piecewise smooth bivariate function $f$ within a domain $\Omega$, we look for a piecewise adaptive approximation to $f$. We are interested in an explicit and global (smooth) approach. Bivariate…

Numerical Analysis · Mathematics 2022-01-27 Sergio Amat , David Levin , Juan Ruiz-Alvarez , Dionisio F. Yáñez

We obtain order estimates in the spaces $L_p$ of the best $n$-term trigonometric orthogonal approximations of the classes ${\cal F}_{q}^{\psi}$ of periodic functions, whose Fourier coefficients decrease faster then any power function. We…

Classical Analysis and ODEs · Mathematics 2013-03-05 Andriy L. Shidlich

Numerical solutions of differential equations are usually not smooth functions. However, they should resemble the smoothness of the corresponding real solutions in one way or another. In two of our recent papers, a kind of spacial…

Numerical Analysis · Mathematics 2012-07-13 Tong Sun

We introduce a new method to prove lower estimates for the approximation error of general linear operators with smooth range in terms of classical moduli of smoothness and related $K$-functionals. In addition, we explicitly show how to…

Classical Analysis and ODEs · Mathematics 2017-06-05 Johannes Nagler

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…

Numerical Analysis · Mathematics 2016-11-24 Annalisa Buffa , Eduardo M. Garau

In some applications, one is interested in reconstructing a function $f$ from its Fourier series coefficients. The problem is that the Fourier series is slowly convergent if the function is non-periodic, or is non-smooth. In this paper, we…

Numerical Analysis · Mathematics 2020-04-14 David Levin

In this paper we consider $L_{\overline{p}, \overline\alpha, \overline{\tau}}^{*}(\mathbb{T}^{m})$ anisotropic Lorentz-Zyg\-mu\-nd space $ 2\pi$ of periodic functions of $m$ variables and Nikol'skii--Besov's class $S_{\overline{p},…

Classical Analysis and ODEs · Mathematics 2021-06-22 Gabdolla Akishev

This paper is devoted to the question of constructing a higher order Faber spline basis for the sampling discretization of functions with higher regularity than Lipschitz. The basis constructed in this paper has similar properties as the…

Functional Analysis · Mathematics 2020-07-08 Nadiia Derevianko , Tino Ullrich

In this paper, exact rate of approximation of functions by linear means of Fourier series and Fourier integrals and corresponding $K$-functionals are expressed via special moduli of smoothness. . Introduction is given in $\S 1$. In $\S2$…

Classical Analysis and ODEs · Mathematics 2016-06-27 R. M. Trigub

This paper studies function approximation in Gaussian Sobolev spaces over the real line and measures the error in a Gaussian-weighted $L^p$-norm. We construct two linear approximation algorithms using $n$ function evaluations that achieve…

Numerical Analysis · Mathematics 2026-03-20 Yuya Suzuki , Toni Karvonen

Some prominent discretisation methods such as finite elements provide a way to approximate a function of $d$ variables from $n$ values it takes on the nodes $x_i$ of the corresponding mesh. The accuracy is $n^{-s_a/d}$ in $L^2$-norm, where…

Numerical Analysis · Mathematics 2024-07-19 Camille Pouchol , Marc Hoffmann