Area, IvanDimitrov, Dimitar K. [UNESP]Godoy, EduardoPaschoa, Vanessa2015-10-212015-10-212015-07-01Numerical Algorithms, v. 69, n. 3, p. 611-624, 2015.1017-1398http://hdl.handle.net/11449/128868Sharp bounds for the zeros of symmetric Kravchuk polynomials K (n) (x;M) are obtained. The results provide a precise quantitative meaning of the fact that Kravchuk polynomials converge uniformly to Hermite polynomials, as M tends to infinity. They show also how close the corresponding zeros of two polynomials from these sequences of classical orthogonal polynomials are.611-624engOrthogonal polynomials of a discrete variableSymmetric Kravchuk polynomialsHermite polynomialsLimit relationZerosArtigo10.1007/s11075-014-9916-yWOS:000356823700010Acesso restrito