The algebraic eigenvalue problem
The algebraic eigenvalue problem
Algorithm 748: enclosing zeros of continuous functions
ACM Transactions on Mathematical Software (TOMS)
Neural, Parallel & Scientific Computations
Average-case optimality of a hybrid secant-bisection method
Mathematics of Computation
The zeros of Faber polynomials generated by an m-star
Mathematics of Computation
A novel method for parallel image processing applications
Journal of Systems Architecture: the EUROMICRO Journal - Special issue on parallel image proccesing (PIP)
Computer Methods for Mathematical Computations
Computer Methods for Mathematical Computations
Sorting-Based Calculation of Zeroes and Extrema of Functions as Applied to Search and Recognition. I
Cybernetics and Systems Analysis
On the Recognition and Location of Partially Occluded Objects
Journal of Intelligent and Robotic Systems
Sorting-based localization and stable computation of zeros of a polynomial. I
Cybernetics and Systems Analysis
Sorting-based localization and stable computation of zeros of a polynomial. II
Cybernetics and Systems Analysis
Hi-index | 0.00 |
A stable address sorting and an extrema localization condition based on it are applied for approximate calculation of complex roots of polynomials and zeros of derivatives of functions of one variable. This method is used to localize extrema in discrete numerical sequences, to identify chains of repeating figures, and, on the basis of all this, to search for and recognize patterns presented as numerical arrays.