Pages that link to "Item:Q4336091"

The following pages link to Condition Number Analysis for Sparse Polynomial Systems (Q4336091):

Displayed 11 items.

• General local convergence theory for a class of iterative processes and its applications to Newton's method (Q998977) ‎ (← links)
• Some lower bounds for the complexity of continuation methods (Q1279910) ‎ (← links)
• Condition number bounds for problems with integer coefficients (Q1594828) ‎ (← links)
• Finding a cluster of zeros of univariate polynomials (Q1594831) ‎ (← links)
• Finding zeros of analytic functions: \(\alpha\)-theory for secant type methods (Q1974566) ‎ (← links)
• Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions (Q2576275) ‎ (← links)
• On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables (Q4517525) ‎ (← links)
• Multihomogeneous Newton methods (Q4955862) ‎ (← links)
• Newton's method for overdetermined systems of equations (Q4955863) ‎ (← links)
• Kronecker's and Newton's approaches to solving: a first comparison (Q5938585) ‎ (← links)
• On the geometry of Graeffe iteration (Q5949383) ‎ (← links)