English
Related papers

Related papers: Functions measuring smoothness and the constants i…

200 papers

We introduce a notion of self-concordant smoothing for minimizing the sum of two convex functions, one of which is smooth and the other nonsmooth. The key highlight is a natural property of the resulting problem's structure that yields a…

Optimization and Control · Mathematics 2025-12-01 Adeyemi D. Adeoye , Alberto Bemporad

We consider the surface Stokes equation with Lagrange multiplier and approach it numerically. Using a Taylor-Hood surface finite element method, along with an appropriate estimate for the additional Lagrange multiplier, we derive a new…

Numerical Analysis · Mathematics 2025-07-03 Charles M. Elliott , Achilleas Mavrakis

The article is devoted to the investigation of smoothness of functions $f(x_1,...,x_m)$ of variables $x_1,...,x_m$ in infinite fields with non-trivial multiplicative ultra-norms, where $m\ge 2$. Theorems about classes of smoothness $C^n$ or…

Classical Analysis and ODEs · Mathematics 2007-05-23 S. V. Ludkovsky

We study the concepts of orthogonality and smoothness in normed linear spaces, induced by the derivatives of the norm function. We obtain analytic characterizations of the said orthogonality relations in terms of support functionals in the…

Functional Analysis · Mathematics 2024-08-02 Debmalya Sain

We prove that every continuous function on a separable infinite-dimensional Hilbert space X can be uniformly approximated by smooth functions with no critical points. This kind of result can be regarded as a sort of very strong approximate…

Differential Geometry · Mathematics 2007-05-23 Daniel Azagra , Manuel Cepedello Boiso

We study the approximation by tensor networks (TNs) of functions from classical smoothness classes. The considered approximation tool combines a tensorization of functions in $L^p([0,1))$, which allows to identify a univariate function with…

Functional Analysis · Mathematics 2024-06-26 Mazen Ali , Anthony Nouy

For functions belonging to the classes $C^{2}[0, 1]$ and $C^{3}[0, 1]$, we establish the lower estimate with an explicit constant in approximation by Bernstein polynomials in terms of the second order Ditzian-Totik modulus of smoothness.…

Classical Analysis and ODEs · Mathematics 2015-04-08 Sorin Gal , Gancho Tachev

We survey key techniques and results from approximation theory in the context of uniform approximations to real functions such as e^{-x}, 1/x, and x^k. We then present a selection of results demonstrating how such approximations can be used…

Data Structures and Algorithms · Computer Science 2013-09-20 Sushant Sachdeva , Nisheeth Vishnoi

Replacing operators with continuous operator-valued functions, we prove time-dependent versions of well-known results on compressions and diagonals of bounded operators. The setting of smooth functions is also addressed. Our results have no…

Functional Analysis · Mathematics 2025-12-18 Vladimir Müller , Yuri Tomilov

Fixpoints are ubiquitous in computer science and when dealing with quantitative semantics and verification one often considers least fixpoints of (higher-dimensional) functions over the non-negative reals. We show how to approximate the…

Logic in Computer Science · Computer Science 2025-06-16 Paolo Baldan , Sebastian Gurke , Barbara König , Tommaso Padoan , Florian Wittbold

We prove that every nonnegative continuous real-valued function on a given compact metric space is the uniform limit of some increasing sequence of nonnegative simple functions being linear combinations of indicators of open sets; here the…

General Mathematics · Mathematics 2020-10-21 Yu-Lin Chou

This paper is concerned with polynomial approximations of the spectral abscissa function (the supremum of the real parts of the eigenvalues) of a parameterized eigenvalue problem, which are closely related to polynomial chaos approximations…

Numerical Analysis · Mathematics 2020-11-03 Luca Fenzi , Wim Michiels

We present a new time-dependent Density Functional approach to study the relaxational dynamics of an assembly of interacting particles subject to thermal noise. Starting from the Langevin stochastic equations of motion for the velocities of…

Statistical Mechanics · Physics 2016-08-31 Umberto Marini Bettolo Marconi , Pedro Tarazona

In this paper, we provide near-optimal accelerated first-order methods for minimizing a broad class of smooth nonconvex functions that are strictly unimodal on all lines through a minimizer. This function class, which we call the class of…

Optimization and Control · Mathematics 2023-02-27 Oliver Hinder , Aaron Sidford , Nimit S. Sohoni

In the first part of this paper, we establish a conditional optimality result for an adaptive mixed finite element method for the stationary Stokes problem discretized by the standard Taylor-Hood elements, under the assumption of the…

Numerical Analysis · Mathematics 2014-10-14 Tsogtgerel Gantumur

Most approximation methods in high dimensions exploit smoothness of the function being approximated. These methods provide poor convergence results for non-smooth functions with kinks. For example, such kinks can arise in the uncertainty…

Numerical Analysis · Mathematics 2019-02-19 Barbara Fuchs , Jochen Garcke

This note is a continuation of our papers [1,2], devoted to $L$-approximation of characteristic function of $(-h, h)$ by trigonometric polynomials. In the paper [1] the sharp values of the best approximation for the special values of $h$…

Classical Analysis and ODEs · Mathematics 2008-11-06 A. G. Babenko , Yu. V. Kryakin

Slepian process $S(t)$ is a stationary Gaussian process with zero mean and covariance $ E S(t)S(t')=\max\{0,1-|t-t'|\}\, . $ For any $T>0$ and $h>0$, define $F_T(h ) = {\rm Pr}\left\{\max_{t \in [0,T]} S(t) < h \right\} $ and the constants…

Probability · Mathematics 2019-04-17 Jack Noonan , Anatoly Zhigljavsky

We show how to efficiently compute asymptotically sharp estimates of extreme event probabilities in stochastic differential equations (SDEs) with small multiplicative Brownian noise. The underlying approximation is known as sharp large…

Computation · Statistics 2026-03-16 Timo Schorlepp , Tobias Grafke

The purpose of this short article is to prove some potential estimates that naturally arise in the study of subelliptic Sobolev inequalites for functions. This will allow us to prove a local subelliptic Sobolev inequality with the optimal…

Classical Analysis and ODEs · Mathematics 2015-07-14 Po-Lam Yung