Page 1 Next

Displaying 1 – 20 of 82

Showing per page

A sharp bound for a sine polynomial

Horst Alzer, Stamatis Koumandos (2003)

Colloquium Mathematicae

We prove that | k = 1 n s i n ( ( 2 k - 1 ) x ) / k | < S i ( π ) = 1 . 8519 . . . for all integers n ≥ 1 and real numbers x. The upper bound Si(π) is best possible. This result refines inequalities due to Fejér (1910) and Lenz (1951).

An inequality for the coefficients of a cosine polynomial

Horst Alzer (1995)

Commentationes Mathematicae Universitatis Carolinae

We prove: If 1 2 + k = 1 n a k ( n ) cos ( k x ) 0 for all x [ 0 , 2 π ) , then 1 - a k ( n ) 1 2 k 2 n 2 for k = 1 , , n . The constant 1 / 2 is the best possible.

An observation on the Turán-Nazarov inequality

Omer Friedland, Yosef Yomdin (2013)

Studia Mathematica

The main observation of this note is that the Lebesgue measure μ in the Turán-Nazarov inequality for exponential polynomials can be replaced with a certain geometric invariant ω ≥ μ, which can be effectively estimated in terms of the metric entropy of a set, and may be nonzero for discrete and even finite sets. While the frequencies (the imaginary parts of the exponents) do not enter the original Turán-Nazarov inequality, they necessarily enter the definition of ω.

Bounds for sine and cosine via eigenvalue estimation

Pentti Haukkanen, Mika Mattila, Jorma K. Merikoski, Alexander Kovacec (2014)

Special Matrices

Define n × n tridiagonal matrices T and S as follows: All entries of the main diagonal of T are zero and those of the first super- and subdiagonal are one. The entries of the main diagonal of S are two except the (n, n) entry one, and those of the first super- and subdiagonal are minus one. Then, denoting by λ(·) the largest eigenvalue, [...] Using certain lower bounds for the largest eigenvalue, we provide lower bounds for these expressions and, further, lower bounds for sin x and cos x on certain...

Currently displaying 1 – 20 of 82

Page 1 Next