Вычисление нулей и полюсов функций на основе устойчивой адресной сортировки с приложением к поиску и распознаванию

Abstract

The article is devoted to program method of application parallelizing internal sorting on a key for localization and the approximate computation of polynomials` zeroes with the appendix to search and recognition. The method defines multiplicity of zeroes, it is spreaded to calculation of functions` poles taking into account its order and it is applicable to determination of functions` extremes and extremal elements of numerical sequences. Search patterns and recognition of images to extreme attributes are under construction on this basis. Time complexity of consecutive and parallel realization of method is estimated. Stability of the offered patterns is proved and verified experimentally.