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

DOI10.1007/s10559-007-0033-yzbMath1127.68024OpenAlexW4243045351MaRDI QIDQ2458118

Ya. E. Romm

Publication date: 31 October 2007

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-007-0033-y

zbMATH Keywords

sortingzeros of polynomialsparallel methodprogram localization

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (2)

Numerical sorting-based optimization as applied to general differential and nonlinear equations ⋮ Sorting-based localization and stable computation of zeros of a polynomial. II.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Estimation of maximal and minimal deviation of neighboring points in Chebyshev's alternant
• Resolution of \(\mathbb{C}^3/H_{168}\)
• Sorting-based calculation of zeroes and extrema of functions as applied to search and recognition. I
• Sorting-based calculation of zeros and extrema of functions as applied to search and recognition. II
• On value distribution of differential monomial of algebroid functions.
• On a modification of the Jacobi linear functional: Asymptotic properties and zeros of the corresponding orthogonal polynomials
• An algorithm for locating all zeros of a real polynomial
• Parallel merging sorting using comparison matrices. I
• Parallel merge sort using comparison matrices. II
• Determination of the number of roots of a polynomial lying in a given algebraic domain

This page was built for publication: Sorting-based localization and stable computation of zeros of a polynomial. I.