Pages that link to "Item:Q1377268"
From MaRDI portal
The following pages link to Polynomial root finding by means of continuation (Q1377268):
Displaying 11 items.
- On root finding algorithms for complex functions with branch cuts (Q345951) (← links)
- A quasi-shrinking rectangle algorithm for complex zeros of a function (Q870141) (← links)
- Polynomial root finding by means of continuation (Q1377268) (← links)
- The derivation method to calculate the zeros of polynomials (Q1627759) (← links)
- Choosing roots of polynomials smoothly. II (Q1885592) (← links)
- Polynomial roots: The ultimate answer? (Q1899387) (← links)
- The polynomial pivots as initial values for a new root-finding iterative method (Q2336929) (← links)
- The Exact Root Algorithm for Computing the Real Roots of an Nth Degree Polynomial (Q3064805) (← links)
- Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra (Q4918038) (← links)
- Continuity of the Roots of a Polynomial (Q4960443) (← links)
- (Q5699555) (← links)