English
Related papers

Related papers: On the Constant in The Lower Estimate for the Bern…

200 papers

Assuming the Generalized Riemann Hypothesis, we provide uniform upper and lower bounds with explicit main terms for $\log{\left|\cL(s)\right|}$ for $\sigma \in (1/2,1)$ and for functions in the Selberg class. In particular, we focus on the…

Number Theory · Mathematics 2025-05-06 Neea Palojärvi , Aleksander Simonič

Probability functions appear in constraints of many optimization problems in practice and have become quite popular. Understanding their first-order properties has proven useful, not only theoretically but also in implementable algorithms,…

Optimization and Control · Mathematics 2023-04-21 Wim van Ackooij , Pedro Pérez-Aros , Claudia Soto

We establish the exact-order estimates for the approximation of functions from the Nikol'skii-Besov classes $S^{\boldsymbol{r}}_{1,\theta} B(\mathbb{R}^d)$, $d\geqslant 1$, by entire function exponential type with some restrictions for…

Classical Analysis and ODEs · Mathematics 2019-12-04 S. Ya. Yanchenko

The article introduces a new algorithm for solving a class ofequilibrium problems involving strongly pseudomonotone bifunctions with Lipschitz-type condition. We describe how to incorporate the proximal-like regularized technique with…

Optimization and Control · Mathematics 2018-04-26 Dang Van Hieu

The (global) Lipschitz smoothness condition is crucial in establishing the convergence theory for most optimization methods. Unfortunately, most machine learning and signal processing problems are not Lipschitz smooth. This motivates us to…

Optimization and Control · Mathematics 2019-04-23 Qiuwei Li , Zhihui Zhu , Gongguo Tang , Michael B. Wakin

In terms of the best approximations of functions and generalized moduli of smoothness, direct and inverse approximation theorems are proved for Besicovitch almost periodic functions whose Fourier exponent sequences have a single limit point…

Classical Analysis and ODEs · Mathematics 2025-09-30 Stanislav Chaichenko , Andrii Shidlich , Tetiana Shulyk

We consider a functional calculus for compact operators, acting on the singular values rather than the spectrum, which appears frequently in applied mathematics. Necessary and sufficient conditions for this singular value functional…

Functional Analysis · Mathematics 2016-11-14 Fredrik Andersson , Marcus Carlsson , Karl-Mikael Perfekt

In this paper, First we have given the modified form of (p,q)-analogues of Bernstein and Bernstein operators [21-23] and then we introduce a new analogue of Bernstein-Kantorovich operators which we call as (p,q)-Bernstein-Kantorovich…

Classical Analysis and ODEs · Mathematics 2016-01-18 M. Mursaleen , Khursheed J. Ansari , Asif Khan

In this paper we give effective estimates for some classical arithmetic functions defined over prime numbers. First we find the smallest real number $x_0$ so that some inequality involving Chebyshev's $\vartheta$-function holds for every $x…

Number Theory · Mathematics 2022-06-30 Christian Axler

Let $L$ be a linear differential operator with constant coefficients of order $n$ and complex eigenvalues $\lambda_{0},...,\lambda_{n}$. Assume that the set $U_{n}$ of all solutions of the equation $Lf=0$ is closed under complex…

Classical Analysis and ODEs · Mathematics 2010-09-24 J. M. Aldaz , O. Kounchev , H. Render

We prove smoothing estimates for Schr\"odinger equations $i\partial_t \phi+\partial_x (a(x) \partial_x \phi) =0$ with $a(x)\in \mathrm{BV}$, the space of functions with bounded total variation, real, positive and bounded from below. We then…

Analysis of PDEs · Mathematics 2007-05-23 N. Burq , F. Planchon

The approximation of functions in Orlicz space by multivariate operators on simplex is considered. The convergence rate is given by using modulus of smoothness.

Functional Analysis · Mathematics 2021-01-25 Wan Ma , Lihong Chang , Yongxia Qiang

We derive the non-asymptotical non-uniform sharp error estimation for Bernstein's approximation of continuous function based on the modern probabilistic apparatus. We investigate also the convergence of derivative of these polynomials and…

Functional Analysis · Mathematics 2015-08-31 Eugene Ostrovsky , Leonid Sirota

These notes briefly consider some aspects of the Schwartz class of rapidly decreasing smooth functions, tempered distributions, and harmonic functions of polynomial growth.

Classical Analysis and ODEs · Mathematics 2007-05-23 Stephen Semmes

Horn functions form a subclass of Boolean functions and appear in many different areas of computer science and mathematics as a general tool to describe implications and dependencies. Finding minimum sized representations for such functions…

Data Structures and Algorithms · Computer Science 2019-03-25 Kristóf Bérczi , Endre Boros , Ondřej Čepek , Petr Kučera , Kazuhisa Makino

A priori estimates for finite-difference approximations for the first and second order derivatives are obtained for solutions of parabolic equations described in the title.

Numerical Analysis · Mathematics 2009-11-11 N. V. Krylov

In this paper, we introduce a new class of positive linear operators that generalize the classical Bernstein operators. Specifically, we construct a sequence of operators that reproduce the logarithmic function $\ln(1+\mu+x)$, with $\mu >…

Functional Analysis · Mathematics 2026-03-13 Laura Angeloni , Danilo Costarelli , Chiara Darielli

Parameter-dependent models arise in many contexts such as uncertainty quantification, sensitivity analysis, inverse problems or optimization. Parametric or uncertainty analyses usually require the evaluation of an output of a model for many…

Numerical Analysis · Mathematics 2018-10-22 Anthony Nouy

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 give a "regularity lemma" for degree-d polynomial threshold functions (PTFs) over the Boolean cube {-1,1}^n. This result shows that every degree-d PTF can be decomposed into a constant number of subfunctions such that almost all of the…

Computational Complexity · Computer Science 2015-03-13 Ilias Diakonikolas , Rocco A. Servedio , Li-Yang Tan , Andrew Wan