Pages that link to "Item:Q1893153"
From MaRDI portal
The following pages link to An algorithm for locating all zeros of a real polynomial (Q1893153):
Displaying 11 items.
- A polynomial-time algorithm for finding zero-sums. (Q1043611) (← links)
- Locating multiple zeros interactively (Q1067359) (← links)
- An algebraic algorithm to isolate complex polynomial zeros using Sturm sequences (Q1570128) (← links)
- The derivation method to calculate the zeros of polynomials (Q1627759) (← links)
- On zeros of a complex polynomial (Q1891444) (← links)
- Parameter estimation and signal reconstruction (Q2230559) (← links)
- Sorting-based localization and stable computation of zeros of a polynomial. I. (Q2458118) (← links)
- Comment on ``Nonlinear differential algorithm to compute all the zeros of a generic polynomial'' [J. Math. Phys. 57, 083508 (2016)] (Q2832737) (← links)
- AN ALGORITHM FOR FINDING ALL ZEROS OF VECTOR FUNCTIONS (Q3533767) (← links)
- (Q4708423) (← links)
- A stability test for complex polynomials (Q4852686) (← links)