English
Related papers

Related papers: Approximation of discontinuous functions by positi…

200 papers

In approximation theory classical discrete operators, like generalized sampling, Sz\'{a}sz-Mirak'jan, Baskakov and Bernstein operators, have been extensively studied for scalar functions. In this paper, we look at the approximation of…

Functional Analysis · Mathematics 2024-05-14 Rosario Corso , Gabriele Gucciardi

We consider the behaviour of holomorphic functions on a bounded open subset of the plane, satisfying a Lipschitz condition with exponent $\alpha$, with $0<\alpha<1$, in the vicinity of an exceptional boundary point where all such functions…

Complex Variables · Mathematics 2017-01-04 Anthony G. O'Farrell

We investigate lower bounds for the variance in arithmetic progressions of certain multiplicative functions "close" to $1$. Specifically, we consider $\alpha_N$-fold divisor functions, when $\alpha_N$ is a sequence of positive real numbers…

Number Theory · Mathematics 2021-02-23 Daniele Mastrostefano

In computational practice, most attention is paid to rational approximations of functions and approximations by the sum of exponents. We consider a wide enough class of nonlinear approximations characterized by a set of two required…

Numerical Analysis · Mathematics 2023-01-18 Petr N. Vabishchevich

This is a continuation of our earlier paper \cite{PT3}. We consider here operator-valued functions (or infinite matrix functions) on the unit circle $\T$ and study the problem of approximation by bounded analytic operator functions. We…

Functional Analysis · Mathematics 2007-05-23 V. V. Peller , S. R. Treil

This paper develops upper and lower bounds for the probability of Boolean functions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. We call this approach dissociation and give an…

Artificial Intelligence · Computer Science 2015-06-30 Wolfgang Gatterbauer , Dan Suciu

Submodular function minimization is well studied, and existing algorithms solve it exactly or up to arbitrary accuracy. However, in many applications, such as structured sparse learning or batch Bayesian optimization, the objective function…

Machine Learning · Computer Science 2022-03-10 Marwa El Halabi , Stefanie Jegelka

In this paper, we derive optimality conditions (Chebyshev approximation) for multivariate functions. The theory of Chebyshev (uniform) approximation for univariate functions is very elegant. The optimality conditions are based on the notion…

Optimization and Control · Mathematics 2015-10-22 Nadezda Sukhorukova , Julien Ugon , David Yost

Approximation theory plays a central role in numerical analysis, undergoing continuous evolution through a spectrum of methodologies. Notably, Lebesgue, Weierstrass, Fourier, and Chebyshev approximations stand out among these methods.…

Numerical Analysis · Mathematics 2024-04-30 S Akansha

Motivated by conforming finite element methods for elliptic problems of second order, we analyze the approximation of the gradient of a target function by continuous piecewise polynomial functions over a simplicial mesh. The main result is…

Numerical Analysis · Mathematics 2018-03-07 Andreas Veeser

The aim of this work is to introduced the concept of the best one-sided approximation of unbounded functions in weighted space by using algebraic operators in terms the average modulus of smoothness. We also show an estimate of the degree…

General Mathematics · Mathematics 2023-12-15 Raheam A. Al-Saphory , Abdullah A. Al-Hayani , Alaa A. Auad

Functional data analysis is a fast evolving branch of statistics. Estimation procedures for the popular functional linear model either suffer from lack of robustness or are computationally burdensome. To address these shortcomings, a…

Methodology · Statistics 2021-08-27 Ioannis Kalogridis , Stefan Van Aelst

This work advances knowledge of the threshold of prox-boundedness of a function; an important concern in the use of proximal point optimization algorithms and in determining the existence of the Moreau envelope of the function. In finite…

Optimization and Control · Mathematics 2019-09-12 Chayne Planiden

For various Hilbert spaces of analytic functions on the unit disk, we characterize when a function $f$ has optimal polynomial approximants given by truncations of a single power series. We also introduce a generalized notion of optimal…

Functional Analysis · Mathematics 2023-07-11 Christopher Felder

Let us assume that $f$ is a continuous function defined on the unit ball of $\mathbb R^d$, of the form $f(x) = g (A x)$, where $A$ is a $k \times d$ matrix and $g$ is a function of $k$ variables for $k \ll d$. We are given a budget $m \in…

Numerical Analysis · Mathematics 2012-01-18 Massimo Fornasier , Karin Schnass , Jan Vybiral

We exploit qualitative probabilistic relationships among variables for computing bounds of conditional probability distributions of interest in Bayesian networks. Using the signs of qualitative relationships, we can implement abstraction…

Artificial Intelligence · Computer Science 2013-02-01 Chao-Lin Liu , Michael P. Wellman

Motivated by the study of systems of higher order boundary value problems with functional boundary conditions, we discuss, by topological methods, the solvability of a fairly general class of systems of perturbed Hammerstein integral…

Classical Analysis and ODEs · Mathematics 2021-02-09 Gennaro Infante

Lower and upper bounds for a given function are important in many mathematical and engineering contexts, where they often serve as a base for both analysis and application. In this short paper, we derive piecewise linear and quadratic…

Optimization and Control · Mathematics 2014-06-17 Gene A. Bunin , Grégory François , Dominique Bonvin

We provide general adaptive upper bounds for estimating nonparametric functionals based on second order U-statistics arising from finite dimensional approximation of the infinite dimensional models. We then provide examples of functionals…

Statistics Theory · Mathematics 2021-06-07 Lin Liu , Rajarshi Mukherjee , James Robins , Eric Tchetgen Tchetgen

We consider optimal route planning when the objective function is a general nonlinear and non-monotonic function. Such an objective models user behavior more accurately, for example, when a user is risk-averse, or the utility function needs…

Data Structures and Algorithms · Computer Science 2015-11-24 Ger Yang , Evdokia Nikolova
‹ Prev 1 4 5 6 7 8 10 Next ›