This article is cited in 8 papers

Real, complex and functional analysis

Efficient computation of Favard constants and their connection to Euler polynomials and numbers

Yu. S. Volkov

Sobolev Institute of Mathematics, 4, Koptyuga ave., Novosibirsk, 630090, Russia

Abstract: We discuss problems of calculating the Favard constants, which are often used in approximation theory and their connection to Euler numbers and polynomials. Simple effective recurrence formulas for computation of the Favard constants are found. The application of the results to one problem of extremal functional interpolation allowing the solution to be expressed in an explicit form is demonstrated.

Keywords: Favard constants, Euler numbers, Euler polynomials, recurrence formulas, approximation theory.

UDC: 517.589

MSC: 11B68

Received October 5, 2020, published November 25, 2020

Language: English

DOI: 10.33048/semi.2020.17.129

Bibliographic databases:

•