Sorting-based calculation of zeros and extrema of functions as applied to search and recognition. II
From MaRDI portal
Publication:1407299
DOI10.1023/A:1013806706462zbMATH Open1029.68047OpenAlexW4241907214MaRDI QIDQ1407299FDOQ1407299
Authors: Ya. E. Romm
Publication date: 16 September 2003
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1013806706462
Recommendations
- Sorting-based calculation of zeroes and extrema of functions as applied to search and recognition. I
- Sorting-based localization and stable computation of zeros of a polynomial. I.
- Sorting-based localization and stable computation of zeros of a polynomial. II.
- Locating and Computing All the Simple Roots and Extrema of a Function
- Numerical sorting-based optimization as applied to general differential and nonlinear equations
Cited In (5)
- Sorting-based calculation of zeroes and extrema of functions as applied to search and recognition. I
- Numerical sorting-based optimization as applied to general differential and nonlinear equations
- Polynomial pattern finding in scattered data
- Sorting-based localization and stable computation of zeros of a polynomial. II.
- Sorting-based localization and stable computation of zeros of a polynomial. I.
Uses Software
This page was built for publication: Sorting-based calculation of zeros and extrema of functions as applied to search and recognition. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1407299)