Pages that link to "Item:Q1130393"

The following pages link to A family of simultaneous zero-finding methods (Q1130393):

Displaying 14 items.

• Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros (Q597271) (← links)
• Construction of zero-finding methods by Weierstrass functions (Q879490) (← links)
• On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial (Q1044413) (← links)
• Recursive algorithm without extra function evaluations for the Jacobian matrix of Viéta's polynomial system with applications (Q1765801) (← links)
• Point estimation of a family of simultaneous zero-finding methods (Q1806445) (← links)
• On zeros of polynomial and vector solutions of associated polynomial system from Viëta theorem (Q1861969) (← links)
• Family of simultaneous methods of Hansen--Patrick's type (Q1878394) (← links)
• On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros (Q1883562) (← links)
• Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros (Q2291994) (← links)
• An effective implementation of a modified Laguerre method for the roots of a polynomial (Q2334816) (← links)
• The polynomial pivots as initial values for a new root-finding iterative method (Q2336929) (← links)
• A convergence analysis of a fourth-order method for computing all zeros of a polynomial simultaneously (Q2357433) (← links)
• A posteriori error bound methods for the inclusion of polynomial zeros (Q2381619) (← links)
• Simultaneous roots for vectorial problems (Q6172867) (← links)