English
Related papers

Related papers: Error Bounds for the Numerical Integration of Func…

200 papers

We present a new error analysis for finite element methods for a linear-quadratic elliptic optimal control problem with Neumann boundary control and pointwise control constraints. It can be applied to standard finite element methods when…

Numerical Analysis · Mathematics 2024-11-05 Susanne C. Brenner , Li-yeng Sung

We study the effects of numerical quadrature rules on error convergence rates when solving Maxwell-type variational problems via the curl-conforming or edge finite element method. A complete {\em a priori} error analysis for the case of…

Numerical Analysis · Mathematics 2020-11-06 Rubén Aylwin , Carlos Jerez-Hanckes

We mainly study numerical integration of real valued functions defined on the $d$-dimensional unit cube with all partial derivatives up to some finite order $r\ge1$ bounded by one. It is well known that optimal algorithms that use $n$…

Numerical Analysis · Mathematics 2017-06-22 Aicke Hinrichs , Erich Novak , Mario Ullrich , Henryk Wozniakowski

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

We develop efficient numerical integration methods for computing an integral whose integrand is a product of a smooth function and the Gaussian function with a small standard deviation. Traditional numerical integration methods applied to…

Numerical Analysis · Mathematics 2018-04-12 Yunyun Ma , Yuesheng Xu

The softmax function is a ubiquitous component at the output of neural networks and increasingly in intermediate layers as well. This paper provides convex lower bounds and concave upper bounds on the softmax function, which are compatible…

Machine Learning · Computer Science 2023-03-06 Dennis Wei , Haoze Wu , Min Wu , Pin-Yu Chen , Clark Barrett , Eitan Farchi

A loss function measures the discrepancy between the true values and their estimated fits, for a given instance of data. In classification problems, a loss function is said to be proper if a minimizer of the expected loss is the true…

Information Theory · Computer Science 2020-01-03 Amichai Painsky , Gregory W. Wornell

We consider fluctuations of error terms $\Delta(x)$ appearing in the asymptotic formula for a summatory function of coefficients of the Dirichlet series. These are quantified via $\Omega$ and $\Omega_{\pm}$ estimates. We obtain $\Omega$…

Number Theory · Mathematics 2018-07-27 Kamalakshya Mahatab , Anirban Mukhopadhyay

We propose a unifying general framework of quantitative primal and dual sufficient and necessary error bound conditions covering linear and nonlinear, local and global settings. The function is not assumed to possess any particular…

Optimization and Control · Mathematics 2022-06-17 Nguyen Duy Cuong , Alexander Y. Kruger

We prove lower bounds for the error of optimal cubature formulae for $d$-variate functions from Besov spaces of mixed smoothness $B^{\alpha}_{p,\theta}({\mathbb G}^d)$ in the case $0 < p, \theta \le \infty$ and $\alpha > 1/p$, where…

Numerical Analysis · Mathematics 2014-01-30 Dinh Dũng , Tino Ullrich

A method of deriving quadrature rules has been developed which gives nodes and weights for a Gaussian-type rule which integrates functions of the form: f(x,y,t) = a(x,y,t)/((x-t)^2+y^2) + b(x,y,t)/([(x-t)^2+y^2]^{1/2}) +…

Numerical Analysis · Mathematics 2010-09-21 Michael Carley

We give a proof of the Donnelly-Fefferman growth bound of Laplace-Beltrami eigenfunctions which is probably the easiest and the most elementary one. Our proof also gives new quantitative geometric estimates in terms of curvature bounds…

Analysis of PDEs · Mathematics 2014-01-14 Dan Mangoubi

In this paper, we study the optimal general convergence rates for quadratures derived from Chebyshev points. By building on the aliasing errors on integration of Chebyshev polynomials, together with the asymptotic formulae on the…

Numerical Analysis · Mathematics 2014-07-29 Shuhuang Xiang

We consider a sequence of composite Bernstein operators and the quadrature formulae associated with them. Upper bounds for the approximation error of continuous functions and for the approximation of integrals of continuous functions are…

Classical Analysis and ODEs · Mathematics 2014-02-12 Heiner Gonska , Ioan Raşa

For the class of polynomial quadrature rules we show that conveniently chosen bases allow to compute both the weights and the theoretical error expression of a $n$-point rule via the undetermined coefficients method. As an illustration, the…

Numerical Analysis · Mathematics 2012-04-02 Mário M. Graça , M. Esmeralda Sousa-Dias

We construct a general framework for deriving error bounds for conic feasibility problems. In particular, our approach allows one to work with cones that fail to be amenable or even to have computable projections, two previously challenging…

Optimization and Control · Mathematics 2022-10-17 Scott B. Lindstrom , Bruno F. Lourenço , Ting Kei Pong

In this paper, we investigate the rate of convergence of Clenshaw-Curtis quadrature and its acceleration for functions with endpoint singularities in X^s, where X^s denotes the space of functions whose Chebyshev coefficients decay…

Numerical Analysis · Mathematics 2014-07-18 Haiyong Wang

This paper introduces a new functional expansion framework that extends classical ideas beyond the Taylor series. Unlike traditional Taylor expansions based on local polynomial approximations, the proposed approach arises from exact…

Numerical Analysis · Mathematics 2026-02-03 Junping Wang

In this note we study multivariate integration for permutation-invariant functions from a certain Banach space E_{d,\alpha} of Korobov type in the worst case setting. We present a lower error bound which particularly implies that in…

Numerical Analysis · Mathematics 2013-10-16 Markus Weimar

We consider the problems of \emph{learning} and \emph{testing} real-valued convex functions over Gaussian space. Despite the extensive study of function convexity across mathematics, statistics, and computer science, its learnability and…

Data Structures and Algorithms · Computer Science 2025-11-17 Renato Ferreira Pinto , Cassandra Marcussen , Elchanan Mossel , Shivam Nadimpalli
‹ Prev 1 3 4 5 6 7 10 Next ›