An Exact Method for Finding the Roots of a Complex Polynomial
From MaRDI portal
Publication:4109199
DOI10.1145/355705.355710zbMath0341.65036OpenAlexW2006479289MaRDI QIDQ4109199
Publication date: 1976
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/355705.355710
Related Items (16)
Occurrence of zero in a linear recursive sequence ⋮ Continuous amortization and extensions: with applications to bisection-based root isolation ⋮ Some parallel methods for polynomial root-finding ⋮ Computer algebra: Past and future ⋮ On root finding algorithms for complex functions with branch cuts ⋮ A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration ⋮ Root isolation of zero-dimensional polynomial systems with linear univariate representation ⋮ Unnamed Item ⋮ A parallel Wilf algorithm for complex zeros of a polynomial ⋮ Computational complexity of real functions ⋮ Decompositions of algebras over \(\mathbb{R}\) and \(\mathbb{C}\) ⋮ On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond ⋮ Computing the irreducible real factors and components of an algebraic curve ⋮ Complex Root Finding Algorithm Based on Delaunay Triangulation ⋮ Some higher-order methods for the simultaneous approximation of multiple polynomial zeros ⋮ An algebraic algorithm to isolate complex polynomial zeros using Sturm sequences
This page was built for publication: An Exact Method for Finding the Roots of a Complex Polynomial