English
Related papers

Related papers: On the convergence of Chebyshev--Pad\'e approximat…

200 papers

We present effective algorithms for uniform approximation of multivariate functions satisfying some prescribed inner structure. We extend in several directions the analysis of recovery of ridge functions $f(x)=g(\langle a,x\rangle)$ as…

Functional Analysis · Mathematics 2014-06-09 Anton Kolleck , Jan Vybiral

The aim of the present work is to introduce a method based on Chebyshev polynomials for the numerical solution of a system of Cauchy type singular integral equations of the first kind on a finite segment. Moreover, an estimation error is…

Numerical Analysis · Mathematics 2015-08-11 Sedaghat Shahmorad , Samad Ahdiaghdam

Let X and Y be planar Jordan domains of the same finite connectivity, Y being inner chordarc regular (such are Lipschitz domains). Every homeomorphism h:X->Y in the Sobolev space $W^{1,2}$ extends to a continuous map between closed domains.…

Complex Variables · Mathematics 2013-02-12 Tadeusz Iwaniec , Leonid V. Kovalev , Jani Onninen

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…

Quantum Physics · Physics 2008-02-15 Ronald de Wolf

We study Sobolev spaces of radial functions on spherically symmetric Riemannian manifolds. Using geodesic polar coordinates, we give a sharp one-dimensional reduction: a radial function belongs to the Sobolev space on the manifold if and…

Analysis of PDEs · Mathematics 2026-02-17 João Marcos do Ó , Guozhen Lu , Raoní Ponciano

This paper studies the multivariate approximation of functions in weighted Korobov spaces using multiple rank-1 lattice rules. It has been shown by K\"{a}mmerer and Volkmer (2019) that algorithms based on multiple rank-1 lattices achieve…

Numerical Analysis · Mathematics 2026-04-03 Mou Cai , Takashi Goda

Direct and inverse approximation theorems are proved in the Besicovitch-Stepanets spaces $B{\mathcal S}^{p}$ of almost periodic functions in terms of the best approximations of functions and their generalized moduli of smoothness.

Classical Analysis and ODEs · Mathematics 2025-09-30 Anatolii Serdyuk , Andrii Shidlich

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…

Optimization and Control · Mathematics 2015-05-13 Didier Henrion , Jean Bernard Lasserre , Carlo Savorgnan

This paper proves that the approximation of pointwise derivatives of order $s$ of functions in Sobolev space $W_2^m(\R^d)$ by linear combinations of function values cannot have a convergence rate better than $m-s-d/2$, no matter how many…

Numerical Analysis · Mathematics 2016-11-16 Oleg Davydov , Robert Schaback

For a family of second-order elliptic systems in divergence form with rapidly oscillating almost-periodic coefficients, we obtain estimates for approximate correctors in terms of a function that quantifies the almost periodicity of the…

Analysis of PDEs · Mathematics 2015-06-26 Zhongwei Shen

We introduce and study the notion of plurisubharmonic functions in calibrated geometry. These functions generalize the classical plurisubharmonic functions from complex geometry and enjoy their important properties. Moreover, they exist in…

Differential Geometry · Mathematics 2017-12-12 F. Reese Harvey , H. Blaine Lawson

We establish a new global endpoint Sobolev inequality for measures that extends the classical theorem of Meyers-Ziemer by placing a maximal function on the right-hand side. This result has several significant consequences. It extends…

Classical Analysis and ODEs · Mathematics 2026-03-06 Simon Bortz , Kabe Moen , Andrea Olivo , Carlos Pérez , Ezequiel Rela

The algebraic polynomial interpolation on uniformly distributed nodes is affected by the Runge phenomenon, also when the function to be interpolated is analytic. Among all techniques that have been proposed to defeat this phenomenon, there…

Numerical Analysis · Mathematics 2014-07-10 Stefano De Marchi , Francesco Dell'Accio , Mariarosa Mazza

The objective of this paper is to provide a convergent numerical approximation of the Pareto optimal set for finite-horizon multiobjective optimal control problems for which the objective space is not necessarily convex. Our approach is…

Optimization and Control · Mathematics 2012-03-02 A. Guigue

A deep approximation is an approximating function defined by composing more than one layer of simple functions. We study deep approximations of functions of one variable using layers consisting of low-degree polynomials or simple conformal…

Numerical Analysis · Mathematics 2025-04-25 Kingsley Yeon

We consider finite element approximations of ill-posed elliptic problems with conditional stability. The notion of {\emph{optimal error estimates}} is defined including both convergence with respect to mesh parameter and perturbations in…

Numerical Analysis · Mathematics 2024-03-25 Erik Burman , Mihai Nechita , Lauri Oksanen

Both unconstrained and constrained minimax single facility location problems are considered in multidimensional space with Chebyshev distance. A new solution approach is proposed within the framework of idempotent algebra to reduce the…

Optimization and Control · Mathematics 2012-10-18 Nikolai Krivulin

We consider finite element approximations to the optimal constant for the Hardy inequality with exponent $p=2$ in bounded domains of dimension $n=1$ or $n \geq 3$. For finite element spaces of piecewise linear and continuous functions on a…

In a real Hilbert space $\mathcal{H}$. Given any function $f$ convex differentiable whose solution set $\argmin_{\mathcal{H}}\,f$ is nonempty, by considering the Proximal Algorithm $x_{k+1}=\text{prox}_{\b_k f}(d x_k)$, where $0<d<1$ and…

Optimization and Control · Mathematics 2023-09-26 A. C. Bagy , Z. Chbani , H. Riahi

A new modulus of smoothness and its equivalent $K$-function are defined on the conic domains in $\mathbb{R}^d$, and used to characterize the weighted best approximation by polynomials. Both direct and weak inverse theorems of the…

Classical Analysis and ODEs · Mathematics 2025-07-01 Yan Ge , Yuan Xu