An Exact Method for Finding the Roots of a Complex Polynomial
From MaRDI portal
Cited in
(17)- Occurrence of zero in a linear recursive sequence
- Some parallel methods for polynomial root-finding
- Computer algebra: Past and future
- A parallel Wilf algorithm for complex zeros of a polynomial
- Computational complexity of real functions
- An algebraic algorithm to isolate complex polynomial zeros using Sturm sequences
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- Computing the irreducible real factors and components of an algebraic curve
- On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond
- Continuous amortization and extensions: with applications to bisection-based root isolation
- The number of complex roots of a univariate polynomial within a rectangle
- Complex root finding algorithm based on Delaunay triangulation
- On root finding algorithms for complex functions with branch cuts
- Root isolation of zero-dimensional polynomial systems with linear univariate representation
- Some higher-order methods for the simultaneous approximation of multiple polynomial zeros
- On the use of the root locus of polynomials with complex coefficients for estimating the basin of attraction for the continuous-time Newton and Householder methods
- Decompositions of algebras over \(\mathbb{R}\) and \(\mathbb{C}\)
This page was built for publication: An Exact Method for Finding the Roots of a Complex Polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4109199)
