Gruss Type Discrete Inequalities in Normed Linear Spaces, Revisited
Sever Silvestru Dragomir
TL;DR
The paper revisits Grüss-type inequalities for sequences in real or complex normed spaces under boundedness constraints, deriving sharp constants and unifying several variants. It then applies these bounds to discrete transforms and polynomials, producing explicit error terms for the discrete Fourier transform, the discrete Mellin transform, and vector-valued polynomials. The results provide a cohesive framework with optimal constants (notably $1$ and $\tfrac{1}{2}$) and yield practical, sharp bounds for transform approximations and polynomial evaluations in numerical analysis. These contributions have potential impact on error estimation in signal processing and vector-valued numerical methods where weighted sums, transforms, and polynomial evaluations arise.
Abstract
Some sharp inequalities of Gruss type for sequences of vectors in real or complex normed linear spaces are obtained. Applications for the discrete Fourier and Mellin transform are given. Estimates for polynomials with coefficients in normed spaces are provided as well.
