Pages that link to "Item:Q4109199"
From MaRDI portal
The following pages link to An Exact Method for Finding the Roots of a Complex Polynomial (Q4109199):
Displaying 16 items.
- Continuous amortization and extensions: with applications to bisection-based root isolation (Q277222) (← links)
- On root finding algorithms for complex functions with branch cuts (Q345951) (← links)
- Root isolation of zero-dimensional polynomial systems with linear univariate representation (Q420751) (← links)
- Decompositions of algebras over \(\mathbb{R}\) and \(\mathbb{C}\) (Q685711) (← links)
- Occurrence of zero in a linear recursive sequence (Q1077447) (← links)
- Some parallel methods for polynomial root-finding (Q1091080) (← links)
- Computer algebra: Past and future (Q1098287) (← links)
- A parallel Wilf algorithm for complex zeros of a polynomial (Q1156457) (← links)
- Computational complexity of real functions (Q1171056) (← links)
- An algebraic algorithm to isolate complex polynomial zeros using Sturm sequences (Q1570128) (← links)
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (Q1680157) (← links)
- Computing the irreducible real factors and components of an algebraic curve (Q1814128) (← links)
- On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond (Q2051775) (← links)
- (Q2787257) (← links)
- Complex Root Finding Algorithm Based on Delaunay Triangulation (Q2828142) (← links)
- Some higher-order methods for the simultaneous approximation of multiple polynomial zeros (Q4728106) (← links)