English
Related papers

Related papers: Polynomial approximation on $C^2$-domains

200 papers

It is a classical result in rational approximation theory that certain non-smooth or singular functions, such as $|x|$ and $x^{1/p}$, can be efficiently approximated using rational functions with root-exponential convergence in terms of…

Numerical Analysis · Mathematics 2025-06-27 Kingsley Yeon , Steven B. Damelin

We obtain the asymptotic equalities for the least upper bounds of approximations by interpolation trigonometric polynomials with the equidistant nodes $x_k^{(n-1)}=\frac{2k\pi}{2n-1},\ k\in\mathbb{Z},$ in metrics of the spaces $L_p$ on…

Classical Analysis and ODEs · Mathematics 2018-06-08 A. S. Serdyuk , I. V. Sokolenko

In the Musielak-Orlicz type spaces ${\mathcal S}_{\bf M}$, exact Jackson-type inequalities are obtained in terms of best approximations of functions and the averaged values of their generalized moduli of smoothness. The values of…

Classical Analysis and ODEs · Mathematics 2020-06-17 F. G. Abdullayev , S. O. Chaichenko , M. Imashkyzy , A. L. Shidlich

Approximation on the spherical cap is different from that on the sphere which requires us to construct new operators. This paper discusses the approximation on the spherical cap. That is, so called Jackson-type operator…

Classical Analysis and ODEs · Mathematics 2014-09-15 Yuguang Wang , Feilong Cao

In this paper, based on the classical K. Yano's formula, we first establish an optimal integral inequality for compact Lagrangian submanifolds in the complex space forms, which involves the Ricci curvature in the direction $J\vec{H}$ and…

Differential Geometry · Mathematics 2021-02-04 Zejun Hu , Cheng Xing

We present a new proof of the Willmore inequality for an arbitrary bounded domain $\Omega\subset\mathbb{R}^{n}$ with smooth boundary. Our proof is based on a parametric geometric inequality involving the electrostatic potential for the…

Analysis of PDEs · Mathematics 2025-08-06 Carla Cederbaum , Anabel Miehe

It is natural to expect the following loosely stated approximation principle to hold: a numerical approximation solution should be in some sense as smooth as its target exact solution in order to have optimal convergence. For piecewise…

Numerical Analysis · Mathematics 2013-12-25 So-Hsiang Chou

This paper establishes inverse inequalities for kernel-based approximation spaces defined on bounded Lipschitz domains in $\mathbb{R}^d$ and compact Riemannian manifolds. While inverse inequalities are well-studied for polynomial spaces,…

Numerical Analysis · Mathematics 2025-08-27 Zhengjie Sun , Leevan Ling

Composite optimization problems, where the sum of a smooth and a merely lower semicontinuous function has to be minimized, are often tackled numerically by means of proximal gradient methods as soon as the lower semicontinuous part of the…

Optimization and Control · Mathematics 2022-07-05 Christian Kanzow , Patrick Mehlitz

In this paper, we prove an extended version of the Minkowski Inequality, holding for any smooth bounded set $\Omega \subset \mathbb R^n$, $n\geq 3$. Our proof relies on the discovery of effective monotonicity formulas holding along the…

Analysis of PDEs · Mathematics 2021-01-05 Virginia Agostiniani , Mattia Fogagnolo , Lorenzo Mazzieri

We prove an improvement for the sharp Adams inequality in $W^{m,\frac nm}_0(\Omega)$ where $\Omega$ is a bounded domain in $\mathbb{R}^n$ inspired by Lions Concentration--Compactness principle for the sharp Moser--Trudinger inequality. Our…

Analysis of PDEs · Mathematics 2016-04-27 Van Hoang Nguyen

This is the second part of the project `unified theory of classical orthogonal polynomials of a discrete variable derived from the eigenvalue problems of hermitian matrices.' In a previous paper, orthogonal polynomials having Jackson…

Classical Analysis and ODEs · Mathematics 2018-01-25 Satoru Odake , Ryu Sasaki

We develop new sub-optimality bounds for gradient descent (GD) that depend on the conditioning of the objective along the path of optimization rather than on global, worst-case constants. Key to our proofs is directional smoothness, a…

Machine Learning · Computer Science 2025-01-15 Aaron Mishkin , Ahmed Khaled , Yuanhao Wang , Aaron Defazio , Robert M. Gower

We give the full solution of the following problem: obtain sharp inequalities between the moduli of smoothness $\omega_\alpha(f,t)_q$ and $\omega_\beta(f,t)_p$ for $0<p<q\le \infty$. A similar problem for the generalized $K$-functionals and…

Classical Analysis and ODEs · Mathematics 2017-11-23 Yurii Kolomoitsev , Sergey Tikhonov

Given a sequence of Marcinkiewicz-Zygmund inequalities in $L_2$ on a compact space, Gr\"ochenig in \cite{G} discussed weighted least squares approximation and least squares quadrature. Inspired by this work, for all $1\le p\le\infty$, we…

Numerical Analysis · Mathematics 2024-03-01 Jiansong Li , Yun Ling , Jiaxin Geng , Heping Wang

We prove the existence of quadrature formulas exact for integrating high degree polynomials with respect to Jacobi weights based on scattered data on the unit interval. We also obtain a characterization of local Besov spaces using the…

Classical Analysis and ODEs · Mathematics 2008-11-18 H. N. Mhaskar

A property of smooth convex domains $\Omega \subset \mathbb{R}^n$ is that if two points on the boundary $x, y \in \partial \Omega$ are close to each other, then their normal vectors $n(x), n(y)$ point roughly in the same direction and this…

Classical Analysis and ODEs · Mathematics 2022-11-04 Stefan Steinerberger

In this paper we investigate the gamma-relative differentiation by the motivation of amending the order of the weighted polynomial approximation on the semiaxis for certain functions. With the help of this we give some definitions of…

Classical Analysis and ODEs · Mathematics 2013-08-28 Zoltán Markó

We introduce new global and local inexact oracle concepts for a wide class of convex functions in composite convex minimization. Such inexact oracles naturally come from primal-dual framework, barrier smoothing, inexact computations of…

Optimization and Control · Mathematics 2020-02-25 Tianxiao Sun , Ion Necoara , Quoc Tran-Dinh

We propose novel smooth approximations to the classical rounding function, suitable for differentiable optimization and machine learning applications. Our constructions are based on two approaches: (1) localized sigmoid window functions…

Machine Learning · Computer Science 2025-04-29 Stanislav Semenov