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

  • Authors:
  • Ya. E. Romm

  • Affiliations:
  • Taganrog State Pedagogical Institute, Taganrog, Russian

  • Venue:
  • Cybernetics and Systems Analysis
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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.