Sorting-based localization and stable computation of zeros of a polynomial. II.
DOI10.1007/S10559-007-0048-4zbMATH Open1142.68027OpenAlexW2012673037MaRDI QIDQ2458056FDOQ2458056
Authors: 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-0048-4
Recommendations
- Sorting-based localization and stable computation of zeros of a polynomial. I.
- scientific article; zbMATH DE number 1929302
- scientific article; zbMATH DE number 1904865
- scientific article; zbMATH DE number 2098030
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- Mapping Based Algorithm for Large-Scale Computation of Quasi-Polynomial Zeros
- Fast computation of zeros of polynomial systems with bounded degree under finite-precision
- Calculating polynomial zeros on a local memory parallel computer
- scientific article; zbMATH DE number 440790
- On an efficient simultaneous method for finding polynomial zeros
Pattern recognition, speech recognition (68T10) Searching and sorting (68P10) Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sorting-based localization and stable computation of zeros of a polynomial. I.
- Title not available (Why is that?)
- Sorting-based calculation of zeros and extrema of functions as applied to search and recognition. II
- Vertical processing of integer group-data streams. II: Application to binary arithmetic operations
Cited In (8)
- 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
- Numerical sorting-based optimization as applied to general differential and nonlinear equations
- Title not available (Why is that?)
- The computer method of variable piecewise polynomial approximation of functions and solutions of ordinary differential equations
- Identification of the domain, ranges, and values of complex roots of a polynomial with complex coefficients based on stable address sorting
- The varying piecewise interpolation solution of the Cauchy problem for ordinary differential equations with iterative refinement
- Sorting-based localization and stable computation of zeros of a polynomial. I.
This page was built for publication: Sorting-based localization and stable computation of zeros of a polynomial. II.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2458056)
