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

DOI10.1007/s10559-007-0048-4zbMath1142.68027OpenAlexW2012673037MaRDI QIDQ2458056

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

zbMATH Keywords

sortingpattern recognitionpolynomial zerocomputational stabilityreconstruction of coefficients

Mathematics Subject Classification ID

Related Items (3)

The varying piecewise interpolation solution of the Cauchy problem for ordinary differential equations with iterative refinement ⋮ Numerical sorting-based optimization as applied to general differential and nonlinear equations ⋮ The computer method of variable piecewise polynomial approximation of functions and solutions of ordinary differential equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• 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.