Computer analysis of the attractors of zeros for classical Bernstein polynomials

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.