Complex Root Finding Algorithm Based on Delaunay Triangulation

DOI10.1145/2699457zbMath1347.65095OpenAlexW2218667301WikidataQ113310269 ScholiaQ113310269MaRDI QIDQ2828142

Piotr Kowalczyk

Publication date: 24 October 2016

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2699457

zbMATH Keywords

Delaunay triangulationcomplex root findingglobal algorithm

Mathematics Subject Classification ID

Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) 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) Numerical computation of roots of polynomial equations (65H04)

Related Items (4)

On root finding algorithms for complex functions with branch cuts ⋮ Robust location of optical fiber modes via the argument principle method ⋮ CCOMP: an efficient algorithm for complex roots computation of determinantal equations ⋮ Learned Infinite Elements

Cites Work

• On the convergence of multipoint iterations
• An Exact Method for Finding the Roots of a Complex Polynomial
• Beating the spread
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complex Root Finding Algorithm Based on Delaunay Triangulation