An extension of the Krylov method for calculating the coefficients of the minimal polynomial

The concept of a $k$-minimal polynomial of an operator is introduced, and a method for approximate calculation of the coefficients of this polynomial is proposed. The method uses the calculated values of certain functionals on iterations of the operator. Special features emerging when the algorithm is used in combination with the Monte-Carlo method are discussed, and numerical results are given.