English
Related papers

Related papers: Approximating classes of functions defined by a ge…

200 papers

We develop a globalized Proximal Newton method for composite and possibly non-convex minimization problems in Hilbert spaces. Additionally, we impose less restrictive assumptions on the composite objective functional considering…

Optimization and Control · Mathematics 2021-11-02 Bastian Pötzl , Anton Schiela , Patrick Jaap

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

Several new inequalities for moduli of smoothness and errors of the best approximation of a function and its derivatives in the spaces $L_p$, $0<p<1$, are obtained. For example, it is shown that for any $0<p<1$ and $k,\,r\in \mathbb{N}$ one…

Classical Analysis and ODEs · Mathematics 2016-12-26 Yurii Kolomoitsev

Bernstein polynomials provide a constructive proof for the Weierstrass approximation theorem, which states that every continuous function on a closed bounded interval can be uniformly approximated by polynomials with arbitrary accuracy.…

Numerical Analysis · Mathematics 2023-07-24 Tiangang Cui , Friedrich Pillichshammer

We develop a general, functional calculus approach to approximation of $C_0$-semigroups on Banach spaces by bounded completely monotone functions of their generators. The approach comprises most of well-known approximation formulas, yields…

Functional Analysis · Mathematics 2018-07-10 A. Gomilko , S. Kosowicz , Yu. Tomilov

The paper explores connection between the generalized order and the generalized type of an entire function and the speed of the best polynomial approximation in the unit disk. The relations which define the generalized order and the…

Classical Analysis and ODEs · Mathematics 2014-05-20 Mykhaylo Z. Dveyrin , Antonina S. Levadnaya

In the present paper, we introduce a Choldowsky type generalization of the q Favard-Szasz operators and obtain weighted statistical approximation properties of these operators. We also establish the rates of statistical convergence by means…

Classical Analysis and ODEs · Mathematics 2015-05-27 Ali Karaisa

For an arbitrary self-adjoint operator $B$ in a Hilbert space $H$, we present direct and inverse theorems establishing the relationship between the degree of smoothness of a vector $x \in H$ with respect to the operator $B$, the rate of…

Functional Analysis · Mathematics 2007-09-27 S. M. Torba , M. L. Gorbachuk , Ya. I. Grushka

The present article is devoted to the generalized Salem functions, the generailed shift operator, and certain related problems. A description of further investigations of the author of this article is given.These investigations (in terms of…

Classical Analysis and ODEs · Mathematics 2023-08-29 Symon Serbenyuk

The aim of this article is to introduce the Kantorovich form of generalized Szasz-type operators involving Charlier polynomials with certain parameters. In this paper we discussed the rate of convergence better error estimates and…

Classical Analysis and ODEs · Mathematics 2015-09-16 Abdul Wafi , Nadeem Rao

Generalized sampling consists in the recovery of a function $f$, from the samples of the responses of a collection of linear shift-invariant systems to the input $f$. The reconstructed function is typically a member of a finitely generated…

Numerical Analysis · Mathematics 2021-06-18 Alexis Goujon , Shayan Aziznejad , Alireza Naderi , Michael Unser

We prove a general factorization theorem for Lipschitz summing operators in the context of metric spaces which recovers several linear and nonlinear factorization theorems that have been proved recently in different environments. New…

Functional Analysis · Mathematics 2019-02-08 Geraldo Botelho , Mariana Maia , Daniel Pellegrino , Joedson Santos

We study the smooth structure of convex functions by generalizing a powerful concept so-called self-concordance introduced by Nesterov and Nemirovskii in the early 1990s to a broader class of convex functions, which we call generalized…

Optimization and Control · Mathematics 2018-05-09 Tianxiao Sun , Quoc Tran-Dinh

We will establish a nearby and vanishing cycle formalism for the arithmetic $\mathscr{D}$-module theory following Beilinson's philosophy. As an application, we define smooth objects in the framework of arithmetic $\mathscr{D}$-modules whose…

Algebraic Geometry · Mathematics 2018-05-02 Tomoyuki Abe

We study universal approximation of continuous functionals on compact subsets of products of Hilbert spaces. We prove that any such functional can be uniformly approximated by models that first take finitely many continuous linear…

Machine Learning · Computer Science 2026-02-04 Andrey Krylov , Maksim Penkin

We introduce appropriate computable moduli of smoothness to characterize the rate of best approximation by multivariate polynomials on a connected and compact $C^2$-domain $\Omega\subset \mathbb{R}^d$. This new modulus of smoothness is…

Classical Analysis and ODEs · Mathematics 2025-04-15 Feng Dai , Andriy Prymak

In this paper we give a unitary approach for the simultaneous study of the convergence of discrete and integral operators described by means of a family of linear continuous functionals acting on functions defined on locally compact…

Functional Analysis · Mathematics 2017-11-28 Gianluca Vinti , Luca Zampogni

We prove a multivariate Whitney type theorem for the local anisotropic polynomial approximation in $L_p(Q)$ with $1\leq p\leq \infty$. Here $Q$ is a $d$-parallelepiped in $\RR^d$ with sides parallel to the coordinate axes. We consider the…

Functional Analysis · Mathematics 2010-09-30 D. Dinh , T. Ullrich

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 prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…

Information Theory · Computer Science 2022-12-08 C. Sinan Güntürk , Weilin Li
‹ Prev 1 3 4 5 6 7 10 Next ›