English
Related papers

Related papers: Upper and Lower Error Bounds for a Compact Fourth-…

200 papers

We initiate the study of nonsmooth optimization problems under bounded local subgradient variation, which postulates bounded difference between (sub)gradients in small local regions around points, in either average or maximum sense. The…

Optimization and Control · Mathematics 2024-11-05 Jelena Diakonikolas , Cristóbal Guzmán

We introduce a new non-resonant low-regularity integrator for the cubic nonlinear Schr\"odinger equation (NLSE) allowing for long-time error estimates which are optimal in the sense of the underlying PDE. The main idea thereby lies in…

Numerical Analysis · Mathematics 2023-02-02 Yue Feng , Georg Maierhofer , Katharina Schratz

The purpose of this paper is the numerical analysis of a first order fractional-step time-scheme, using decomposition of theviscosity, and "inf-sup" stable finite element space-approximations for the Primitive Equations of the Ocean. The…

Numerical Analysis · Mathematics 2014-11-21 F. Guillén-González , M. V. Redondo-Neble

We prove density of smooth functions in subspaces of Sobolev- and higher order $BV$-spaces of kind $W^{m,p}(\Omega)\cap L^q(\Omega-D)$ and $BV^m(\Omega)\cap L^q(\Omega-D)$, respectively, where $\Omega\subset\mathbb{R}^n$ ($n\in\mathbb{N}$)…

Analysis of PDEs · Mathematics 2018-03-28 Jan Mueller

Uniform deviation bounds limit the difference between a model's expected loss and its loss on an empirical sample uniformly for all models in a learning problem. As such, they are a critical component to empirical risk minimization. In this…

Machine Learning · Statistics 2017-02-28 Olivier Bachem , Mario Lucic , S. Hamed Hassani , Andreas Krause

Numerical solutions of differential equations are usually not smooth functions. However, they should resemble the smoothness of the corresponding real solutions in one way or another. In two of our recent papers, a kind of spacial…

Numerical Analysis · Mathematics 2012-07-13 Tong Sun

An adaptive regularization algorithm using inexact function and derivatives evaluations is proposed for the solution of composite nonsmooth nonconvex optimization. It is shown that this algorithm needs at most…

Optimization and Control · Mathematics 2019-02-28 S. Gratton , E. Simon , Ph. L. Toint

Explicit pointwise error bounds for the interpolation of a smooth function by piecewise exponential splines of order four are given. Estimates known for cubic splines are extended to a natural class of piecewise exponential splines which…

Numerical Analysis · Mathematics 2020-10-08 Ognyan Kounchev , Hermann Render

This paper presents compact, symmetric, and high-order finite difference methods (FDMs) for the variable Poisson equation on a $d$-dimensional hypercube. Our scheme produces a symmetric linear system: an important property that does not…

Numerical Analysis · Mathematics 2025-11-14 Qiwei Feng , Bin Han , Michelle Michelle , Jiwoon Sim

This paper analyzes the well-known L1 scheme for fractional wave equations with nonsmooth data. A new stability estimate is obtained, and the temporal accuracy $ \mathcal O(\tau^{3-\alpha}) $ is derived for the nonsmooth initial data. In…

Numerical Analysis · Mathematics 2019-12-30 Binjie Li , Tao Wang , Xiaoping Xie

Assume that $V_h$ is a space of piecewise polynomials of degree less than $r\geq 1$ on a family of quasi-uniform triangulation of size $h$. Then the following well-known upper bound holds for a sufficiently smooth function $u$ and $p\in [1,…

Numerical Analysis · Mathematics 2011-06-23 Qun Lin , Hehu Xie , Jinchao Xu

We derive an online learning algorithm with improved regret guarantees for `easy' loss sequences. We consider two types of `easiness': (a) stochastic loss sequences and (b) adversarial loss sequences with small effective range of the…

Machine Learning · Computer Science 2019-08-28 Tobias Sommer Thune , Yevgeny Seldin

We consider a class of stochastic gradient optimization schemes. Assuming that the objective function is strongly convex, we prove weak error estimates which are uniform in time for the error between the solution of the numerical scheme,…

Numerical Analysis · Mathematics 2026-01-27 Charles-Edouard Bréhier , Marc Dambrine , Nassim En-Nebbazi

Higher-order tensor methods were recently proposed for minimizing smooth convex and nonconvex functions. Higher-order algorithms accelerate the convergence of the classical first-order methods thanks to the higher-order derivatives used in…

Optimization and Control · Mathematics 2024-01-11 Ion Necoara

We prove small data scattering for the fourth-order Schr\"odinger equation with quadratic nonlinearity \begin{equation*} i\partial_t u+\Delta^2 u+\alpha u^2 + \beta \bar{u}^2=0\qquad\text{in }\mathbb{R}^5 \end{equation*} for $\alpha, \beta…

Analysis of PDEs · Mathematics 2025-04-23 Ebru Toprak , Mengyi Xie

We present a novel approach for high-order accurate numerical differentiation on unstructured meshes of quadrilateral elements. To differentiate a given function, an auxiliary function with greater smoothness properties is defined which…

Numerical Analysis · Mathematics 2022-05-11 Yulong Pan , Per-Olof Persson

Error bounds and complexity bounds in numerical analysis and information-based complexity are often proved for functions that are defined on very simple domains, such as a cube, a torus, or a sphere. We study optimal error bounds for the…

Numerical Analysis · Mathematics 2020-01-15 Erich Novak

Many numerical methods for recovering ODE solutions from data rely on approximating the solutions using basis functions or kernel functions under a least square criterion. The accuracy of this approach hinges on the smoothness of the…

Statistics Theory · Mathematics 2021-03-19 Ying Zhu , Mozhgan Mirzaei

This work is concerned with the optimal control problems governed by a 1D wave equation with variable coefficients and the control spaces $\mathcal M_T$ of either measure-valued functions $L_{w^*}^2(I,\mathcal M(\Omega))$ or vector measures…

Numerical Analysis · Mathematics 2026-01-05 Philip Trautmann , Boris Vexler , Alexander Zlotnik

We propose a first order algorithm, a modified version of FISTA, to solve an optimization problem with an objective function that is a sum of a possibly nonconvex function, with Lipschitz continuous gradient, and a convex function which can…

Optimization and Control · Mathematics 2025-08-20 Chee-Khian Sim