Pages that link to "Item:Q1156457"
From MaRDI portal
The following pages link to A parallel Wilf algorithm for complex zeros of a polynomial (Q1156457):
Displaying 5 items.
- A parallel algorithm for finding roots of a complex polynomial (Q805233) (← links)
- Locating multiple zeros interactively (Q1067359) (← links)
- Some parallel methods for polynomial root-finding (Q1091080) (← links)
- Modified Newton method in circular interval arithmetic (Q1904962) (← links)
- On the parallel arithmetic complexity of the root-finding problem (Q3804187) (← links)
