Pages that link to "Item:Q2572348"
From MaRDI portal
The following pages link to Improved Halley-like methods for the inclusion of polynomial zeros (Q2572348):
Displaying 15 items.
- On an efficient inclusion method for finding polynomial zeros (Q492088) (← links)
- Efficient methods for the inclusion of polynomial zeros (Q544062) (← links)
- On some improvements of square root iteration for polynomial complex zeros (Q579848) (← links)
- New higher-order methods for the simultaneous inclusion of polynomial zeros (Q639989) (← links)
- Hybrid inclusion algorithms for polynomial multiple complex zeros in rectangular arithmetic (Q758126) (← links)
- On the convergence of Halley's method for simultaneous computation of polynomial zeros (Q898923) (← links)
- Some interval iterations for finding a zero of a polynomial with error bounds (Q1096334) (← links)
- An algorithm for the simultaneous inclusion of real polynomial zeros (Q1098562) (← links)
- Halley-like method with corrections for the inclusion of polynomial zeros (Q1293461) (← links)
- Iterative methods for simultaneous inclusion of polynomial zeros (Q1801245) (← links)
- Laguerre-like inclusion method for polynomial zeros (Q1872969) (← links)
- Some improved inclusion methods for polynomial roots with Weierstrass' corrections (Q2365928) (← links)
- Efficient Halley-like methods for the inclusion of multiple zeros of polynomials (Q2442047) (← links)
- High order Euler-like method for the inclusion of polynomial zeros (Q2479144) (← links)
- A Halley‐Like Hybrid Method for Solving Polynomial Equations (Q5966749) (← links)
