|
Fundamentalnaya i Prikladnaya Matematika, 2016, Volume 21, Issue 4, Pages 151–174
(Mi fpm1752)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
Computer analysis of the attractors of zeros for classical Bernstein polynomials
I. V. Tikhonova, D. G. Tsvetkovichb, V. B. Sherstyukovc a Moscow State University, Moscow, Russia
b Moscow State Pedagogical University, Moscow, Russia
c National Research Nuclear University, Moscow, Russia
Abstract:
The paper is concerned with special questions on the behavior of zeros of sequences of Bernstein polynomials. For a piecewise linear generating function, computer mathematics machinery was used to find the rules controlling the limit behavior of zeros as the number of the Bernstein polynomial unboundedly increases. New problems for theoretical investigations are formulated.
Citation:
I. V. Tikhonov, D. G. Tsvetkovich, V. B. Sherstyukov, “Computer analysis of the attractors of zeros for classical Bernstein polynomials”, Fundam. Prikl. Mat., 21:4 (2016), 151–174; J. Math. Sci., 245:2 (2020), 217–233
Linking options:
https://www.mathnet.ru/eng/fpm1752 https://www.mathnet.ru/eng/fpm/v21/i4/p151
|
Statistics & downloads: |
Abstract page: | 401 | Full-text PDF : | 181 | References: | 42 |
|