Pages that link to "Item:Q582813"
From MaRDI portal
The following pages link to Calculating polynomial zeros on a local memory parallel computer (Q582813):
Displaying 9 items.
- On the convergence of the sequences of Gerschgorin-like disks (Q857652) (← links)
- On Euler-like methods for the simultaneous approximation of polynomial zeros (Q1128293) (← links)
- Local minima of the trust region problem (Q1321448) (← links)
- Family of simultaneous methods of Hansen--Patrick's type (Q1878394) (← links)
- Finding roots of a real polynomial simultaneously by means of Bairstow's method (Q1914869) (← links)
- Tchebychef-like method for the simultaneous finding zeros of analytic functions (Q1921210) (← links)
- A posteriori error bound methods for the inclusion of polynomial zeros (Q2381619) (← links)
- Computational efficiency of some combined methods for polynomial equations (Q2518679) (← links)
- Börsch-supan-like methods: point estimation and parallel implementation (Q4384045) (← links)