Skip to main content
Log in

Sorting-Based Calculation of Zeroes and Extrema of Functions as Applied to Search and Recognition. I

  • Published:
Cybernetics and Systems Analysis Aims and scope

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. Ya. E. Romm, “Parallel merge sort using comparison matrices. 1,” Kibern. Sist. Analiz, No. 5, 3–23 (1994).

  2. Ya. E. Romm, “Parallel merge sort using comparison matrices. 2,” Kibern. Sist. Analiz, No. 4, 13–7 (1995).

  3. D. E. Knuth, The Art of Computer Programming [Russian translation], Vol. 3, Sorting and Search, Mir, Moscow (1978).

    Google Scholar 

  4. D. K. Faddeev, Lectures on Algebra [in Russian], Nauka, Moscow (1984).

    Google Scholar 

  5. Ya. E. Romm, Parallel Merge Sort. Application to Calculation of Zeroes, Extrema of Functions, and Pattern Recognition [in Russian], Izd. TGPI, Taganrog (1998).

    Google Scholar 

  6. 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).

    Google Scholar 

  7. A. I. Markushevich andL. A. Markushevich, Introduction to Theory of Analytical Functions [in Russian], Prosveshchenie, Moscow (1997).

    Google Scholar 

  8. 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).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1012789906865

Navigation