Pages that link to "Item:Q796253"
From MaRDI portal
The following pages link to The numerical stability of the generalised root iterations for polynomial zeros (Q796253):
Displaying 7 items.
- On an efficient inclusion method for finding polynomial zeros (Q492088) (← links)
- The root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial. II: Round-off error analysis by use of interval arithmetic (Q640522) (← links)
- A hybrid method for polynomial complex zero (Q758127) (← links)
- On the efficiency of some combined methods for polynomial complex zeros (Q911229) (← links)
- Revisiting the stability of computing the roots of a quadratic polynomial (Q2341381) (← links)
- Numerical stability of barycentric Hermite root-finding (Q2819629) (← links)
- On the Location of Zeroes of Polynomials from the Stability Analysis of Novel Strong-Form Meshless Random Differential Quadrature Method (Q3112812) (← links)