A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane
From MaRDI portal
Publication:4157394
DOI10.1145/322077.322084zbMath0378.30003OpenAlexW2024560865WikidataQ29013595 ScholiaQ29013595MaRDI QIDQ4157394
Publication date: 1978
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322077.322084
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Algorithms in computer science (68W99)
Related Items (24)
Continuous amortization and extensions: with applications to bisection-based root isolation ⋮ Some parallel methods for polynomial root-finding ⋮ Transport Map Accelerated Markov Chain Monte Carlo ⋮ The multivariate bisection algorithm ⋮ An algorithm for locating all zeros of a real polynomial ⋮ Modified Newton method in circular interval arithmetic ⋮ RESOLUTION OF MULTIPLE ROOTS OF NONLINEAR POLYNOMIAL SYSTEMS ⋮ Introducing phase jump tracking -- a fast method for eigenvalue evaluation of the direct Zakharov-Shabat problem ⋮ Optimal and nearly optimal algorithms for approximating polynomial zeros ⋮ A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration ⋮ Approximating the chromatic polynomial is as hard as computing it exactly ⋮ Root isolation of zero-dimensional polynomial systems with linear univariate representation ⋮ A geometric algorithm for winding number computation with complexity analysis ⋮ Unnamed Item ⋮ A parallel Wilf algorithm for complex zeros of a polynomial ⋮ Singular points of algebraic curves ⋮ Computational complexity of real functions ⋮ How to count the number of zeros that a polynomial has on the unit circle? ⋮ Global root bracketing method with adaptive mesh refinement ⋮ Evaluating winding numbers and counting complex roots through Cauchy indices in Isabelle/HOL ⋮ Computing the irreducible real factors and components of an algebraic curve ⋮ An algebraic algorithm to isolate complex polynomial zeros using Sturm sequences ⋮ Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions ⋮ Locating multiple zeros interactively
This page was built for publication: A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane
