Pages that link to "Item:Q1594831"

The following pages link to Finding a cluster of zeros of univariate polynomials (Q1594831):

Displaying 15 items.

• Computing real roots of real polynomials (Q491245) (← links)
• Numerical factorization of multivariate complex polynomials (Q598228) (← links)
• Relations between roots and coefficients, interpolation and application to system solving (Q697492) (← links)
• General local convergence theory for a class of iterative processes and its applications to Newton's method (Q998977) (← links)
• Nearest multivariate system with given root multiplicities (Q1015156) (← links)
• A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (Q1680157) (← links)
• A general approach to the study of the convergence of Picard iteration with an application to Halley's method for multiple zeros of analytic functions (Q2134441) (← links)
• Improved two-step Newton's method for computing simple multiple zeros of polynomial systems (Q2163445) (← links)
• From approximate factorization to root isolation with application to cylindrical algebraic decomposition (Q2252120) (← links)
• A higher order family for the simultaneous inclusion of multiple zeros of polynomials (Q2501236) (← links)
• Sigmoid-like functions and root finding methods (Q2518658) (← links)
• Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions (Q2576275) (← links)
• A certified iterative method for isolated singular roots (Q2674007) (← links)
• On isolation of simple multiple zeros and clusters of zeros of polynomial systems (Q5207445) (← links)
• General convergence theorems for iterative processes and applications to the Weierstrass root-finding method (Q5963455) (← links)