|
This article is cited in 5 scientific papers (total in 5 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.
Received October 5, 2020, published November 25, 2020
Citation:
Yu. S. Volkov, “Efficient computation of Favard constants and their connection to Euler polynomials and numbers”, Sib. Èlektron. Mat. Izv., 17 (2020), 1921–1942
Linking options:
https://www.mathnet.ru/eng/semr1323 https://www.mathnet.ru/eng/semr/v17/p1921
|
Statistics & downloads: |
Abstract page: | 201 | Full-text PDF : | 76 | References: | 17 |
|