Pages that link to "Item:Q3698168"

The following pages link to On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials (Q3698168):

Displaying 9 items.

• Rational cubic clipping with linear complexity for computing roots of polynomials (Q668578) (← links)
• On the complexity of computing the logarithm and square root functions on a complex domain (Q870336) (← links)
• Optimal solution of nonlinear equations (Q1086985) (← links)
• Rudiments of an average case complexity theory for piecewise-linear path following algorithms (Q1111475) (← links)
• Some computational methods for systems of nonlinear equations and systems of polynomial equations (Q1201902) (← links)
• Accelerated approximation of the complex roots of a univariate polynomial (Q2819725) (← links)
• Complexity Analysis of Root Clustering for a Complex Polynomial (Q2985810) (← links)
• On the efficiency of algorithms of analysis (Q3721699) (← links)
• The Complexity of Approximating the Matching Polynomial in the Complex Plane (Q5065635) (← links)