Abstract
A stable address sorting is used for approximate calculation of zeroes and extrema of functions of one variable and two variables. In particular, the paper gives a new method for localization and approximate calculation of all the roots of a polynomial with arbitrary power. The method includes poorly separated roots, and its distinctive features are the computational stability and the maximum parallelism.
Similar content being viewed by others
REFERENCES
Ya. E. Romm, “Parallel merge sort using comparison matrices. 1,” Kibern. Sist. Analiz, No. 5, 3–23 (1994).
Ya. E. Romm, “Parallel merge sort using comparison matrices. 2,” Kibern. Sist. Analiz, No. 4, 13–7 (1995).
D. E. Knuth, The Art of Computer Programming [Russian translation], Vol. 3, Sorting and Search, Mir, Moscow (1978).
D. K. Faddeev, Lectures on Algebra [in Russian], Nauka, Moscow (1984).
Ya. E. Romm, Parallel Merge Sort. Application to Calculation of Zeroes, Extrema of Functions, and Pattern Recognition [in Russian], Izd. TGPI, Taganrog (1998).
Ya. E. Romm, Non-Conflict and Stable Methods of Determinate Parallel Processing [in Russian], Ph. D. Thesis, VNTI Tsentr No. 05.990.001006, TRTU, Taganrog (1998).
A. I. Markushevich andL. A. Markushevich, Introduction to Theory of Analytical Functions [in Russian], Prosveshchenie, Moscow (1997).
Ya. E. Romm andO. V. Teslenko, On Separation and Calculation of Complex Roots of Polynomials Using Multisequences Sorting [in Russian], Deposited in VINITI 04.19.96, No. 1279–V96, TGPI, Taganrog (1996).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Romm, Y.E. Sorting-Based Calculation of Zeroes and Extrema of Functions as Applied to Search and Recognition. I. Cybernetics and Systems Analysis 37, 581–595 (2001). https://doi.org/10.1023/A:1012789906865
Issue Date:
DOI: https://doi.org/10.1023/A:1012789906865