Sorting-based calculation of zeroes and extrema of functions as applied to search and recognition. I

DOI10.1023/A:1012789906865MaRDI QIDQ1407170zbMATH OpenOpenAlexFDO

Authors Ya. E. Romm

Publication date 9 September 2003

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

Full work available at URL https://doi.org/10.1023/a:1012789906865

zbMATH Keywords

address sortingcomputational parallelismsearch and recognitionzeroes and extrema of functions

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Sorting-based calculation of zeros and extrema of functions as applied to search and recognition. II
• Finding polynomial roots: A fast algorithm convergent on the complex plane
• Sorting-based localization and stable computation of zeros of a polynomial. I.
• Sorting-based localization and stable computation of zeros of a polynomial. II.
• Calculating polynomial zeros on a local memory parallel computer

Cited in

(5)

• Sorting-based calculation of zeros and extrema of functions as applied to search and recognition. II
• Coupled bisection for root ordering
• Sorting-based localization and stable computation of zeros of a polynomial. I.
• Identification of the domain, ranges, and values of complex roots of a polynomial with complex coefficients based on stable address sorting
• Numerical sorting-based optimization as applied to general differential and nonlinear equations

This page was built for publication: Sorting-based calculation of zeroes and extrema of functions as applied to search and recognition. I

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1407170)