English
Related papers

Related papers: A lethargy result for real analytic functions

200 papers

Let $X$ be a compact K\"ahler manifold and $\theta$ a smooth closed $(1,1)$-real form representing a big cohomology class $\alpha \in H^{1,1}(X,\R)$. The purpose of this note is to show, using pluripotential and viscosity techniques, that…

Complex Variables · Mathematics 2013-11-13 Philippe Eyssidieux , Vincent Guedj , Ahmed Zeriahi

In the paper, necessary and sufficient conditions are presented for a function involving a ratio of gamma functions to be logarithmically completely monotonic. This extends and generalizes the main result in [\emph{Inequalities and…

Classical Analysis and ODEs · Mathematics 2012-08-21 Feng Qi , Bai-Ni Guo

In 1958, Sz\"{u}sz proved an inhomogeneous version of Khintchine's theorem on Diophantine approximation. Sz\"{u}sz's theorem states that for any non-increasing approximation function $\psi:\mathbb{N}\to (0,1/2)$ with $\sum_q \psi(q)=\infty$…

Number Theory · Mathematics 2021-06-15 Han Yu

We obtain an estimate of the deviation of de la Vallee Poussin sums V_{n,n/2}(f;x) from continuous functions f, expressed in terms of values of theirs modulus of continuity. It is established that this estimate can't be improved by using…

Classical Analysis and ODEs · Mathematics 2012-11-26 Ie. Yu. Ovsii , A. S. Serdyuk

We present new convolution based smooth approximations to the absolute value function and apply them to construct gradient based algorithms such as the nonlinear conjugate gradient scheme to obtain sparse, regularized solutions of linear…

Numerical Analysis · Mathematics 2015-07-02 Sergey Voronin , Gorkem Ozkaya , Davis Yoshida

The Nyman-Beurling criterion, equivalent to the Riemann hypothesis (RH), is an approximation problem in the space of square integrable functions on $(0,\infty)$, involving dilations of the fractional part function by factors…

Functional Analysis · Mathematics 2022-06-02 François Alouges , Sébastien Darses , Erwan Hillion

Generic approximation of entire functions by their Pad\'{e} approximants has been achieved in the past (\cite{3}). In the present article we obtain generic approximation of holomorphic functions on arbitrary open sets by sequences of their…

Complex Variables · Mathematics 2011-06-02 G. Fournodavlos , V. Nestoridis

We consider the problem of approximating an analytic function on a compact interval from its values at $M+1$ distinct points. When the points are equispaced, a recent result (the so-called impossibility theorem) has shown that the best…

Numerical Analysis · Mathematics 2018-04-09 Ben Adcock , Rodrigo Platte , Alexei Shadrin

In this note we show that a recent existence result on quasiequilibrium problems, which seems to improve deeply some well-known results, is not correct. We exhibit a counterexample and we furnish a generalization of a lemma about continuous…

Optimization and Control · Mathematics 2015-04-08 Marco Castellani , Massimiliano Giuli

We will prove that in a family of quasi-arithmetic means sattisfying certain smoothness assumption (embed with a naural pointwise ordering) every finite family has both supremum and infimum, which is also a quasi-arithmetic mean sattisfying…

Classical Analysis and ODEs · Mathematics 2021-01-20 Paweł Pasteczka

We prove that a real-valued function (that is not assumed to be continuous) on a real analytic manifold is analytic whenever all its restrictions to analytic submanifolds homeomorphic to the 2-sphere are analytic. This is a real analog for…

Classical Analysis and ODEs · Mathematics 2018-12-04 Jacek Bochnak , János Kollár , Wojciech Kucharz

In 1994, M. M. Popov [On integrability in F-spaces, Studia Math. no 3, 205-220] showed that the fundamental theorem of calculus fails, in general, for functions mapping from a compact interval of the real line into the lp-spaces for 0<p<1,…

Functional Analysis · Mathematics 2013-08-29 Fernando Albiac , Jose L Ansorena

We develop a complexity theory for approximate real computations. We first produce a theory for exact computations but with condition numbers. The input size depends on a condition number, which is not assumed known by the machine. The…

Computational Complexity · Computer Science 2020-05-05 Gregorio Malajovich , Mike Shub

Several results on constrained spline smoothing are obtained. In particular, we establish a general result, showing how one can constructively smooth any monotone or convex piecewise polynomial function (ppf) (or any $q$-monotone ppf,…

Numerical Analysis · Mathematics 2014-04-01 K. Kopotun , D. Leviatan , A. Prymak

We show that Newton's method converges globally at a linear rate for objective functions whose Hessians are stable. This class of problems includes many functions which are not strongly convex, such as logistic regression. Our linear…

Machine Learning · Computer Science 2018-06-04 Sai Praneeth Karimireddy , Sebastian U. Stich , Martin Jaggi

We show that on almost complex surfaces plurisubharmonic functions can be locally approximated by smooth plurisubharmonic functions. The main tool is the Poletsky type theorem due to U. Kuzman.

Complex Variables · Mathematics 2014-03-10 Szymon Pliś

In this work, a convergence lemma for function $f$ being finite compositions of analytic mappings and the maximum operator is proved. The lemma shows that the set of $\delta$-stationary points near an isolated local minimum point $x^*$ is…

Computer Science and Game Theory · Computer Science 2022-08-12 Xiaotie Deng , Hanyu Li , Ningyuan Li

A rational approximation by a ratio of polynomial functions is a flexible alternative to polynomial approximation. In particular, rational functions exhibit accurate estimations to nonsmooth and non- Lipschitz functions, where polynomial…

Optimization and Control · Mathematics 2020-02-27 V. Peiris , N. Sharon , N. Sukhorukova J. Ugon

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

Following Chaudhuri, Sankaranarayanan, and Vardi, we say that a function $f:[0,1] \to [0,1]$ is $r$-regular if there is a B\"{u}chi automaton that accepts precisely the set of base $r \in \mathbb{N}$ representations of elements of the graph…

Logic in Computer Science · Computer Science 2023-06-22 Alexi Block Gorman , Philipp Hieronymi , Elliot Kaplan , Ruoyu Meng , Erik Walsberg , Zihe Wang , Ziqin Xiong , Hongru Yang