Skip to main content
SpringerLink
Log in

Sorting-based localization and stable computation of zeros of a polynomial. II

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The stability of a sorting-based scheme for identifying polynomial zeros under coefficient perturbation is discussed. A method is proposed for simultaneous reconstruction (with a logarithmic estimate of time complexity) of the coefficients of an arbitrary polynomial from the values of its zeros. The method of identification of polynomial zeros is based on the operator of localization of extremal elements of a numerical sequence after its preliminary sorting. The method is extended to pattern recognition.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ya. E. Romm, “Sorting-based localization and stable computation of zeros of a polynomial. I,” Cybernetics and Systems Analysis, No. 1, 165–182 (2007).

  2. J. H. Wilkinson, The Algebraic Eigenvalue Problem [Russian translation], Nauka, Moscow (1970).

    MATH  Google Scholar 

  3. G. Forsythe, M. Malcolm, and C. Moler, Computer methods for mathematical computations [Russian translation], Mir, Moscow (1980).

    MATH  Google Scholar 

  4. Ya. E. Romm, “Sorting-based calculation of zeros and extrema of functions as applied to search and recognition. II,” Cybernetics and Systems Analysis, No. 5, 81–101 (2001).

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

    MATH  Google Scholar 

  6. Ya. E. Romm and S. S. Belokonova, “Searching scheme based on sorting and localization of extremal elements,” Dep. in VINITI, No. 436-B2003 (2003).

  7. V. V. Vinogradskii and Ya. E. Romm, “Transformation of sorting routines into stable schemes with the properties of direct and reverse addressing,” Dep. in VINITI, No. 2130-B2003 (2003).

  8. Yu. I. Zhuravlev and I. B. Gurevich, “Pattern recognition and image recognition,” in: Recognition, Classification, and Prediction: Mathematical Methods and Their Application, No. 2, Nauka, Moscow (1989), pp. 5–72.

    Google Scholar 

  9. Duncan A. Rowland and David I. Perrett, “Manipulating facial appearance trough shape and color,” IEEE Comput. Graph. and Appl., 15, No. 5, 70–76 (1995).

    Article  Google Scholar 

  10. I. S. Berezin and N. P. Zhidkov, Computing methods [in Russian], Vol. 1, Nauka, Moscow (1966).

    Google Scholar 

  11. Ya. E. Romm, “Conflict-free and stable methods of deterministic parallel processing,” Abstract of Doctoral Dissertation in Technical Sciences, TRTU, Taganrog (1998).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Taganrog State Pedagogical Institute, Taganrog, Russian

    Ya. E. Romm

Authors
  1. Ya. E. Romm
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Part I of this article is published in No. 1 (2007).

__________

Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 161–174, March–April 2007.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Romm, Y.E. Sorting-based localization and stable computation of zeros of a polynomial. II. Cybern Syst Anal 43, 291–302 (2007). https://doi.org/10.1007/s10559-007-0048-4

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-007-0048-4

Keywords

Search

Navigation