Complex root finding algorithm based on Delaunay triangulation

DOI10.1145/2699457zbMATH Open1347.65095OpenAlexW2218667301WikidataQ113310269 ScholiaQ113310269MaRDI QIDQ2828142FDOQ2828142

P. 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

General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Numerical computation of roots of polynomial equations (65H04)

Cites Work

• An Exact Method for Finding the Roots of a Complex Polynomial
• On the convergence of multipoint iterations
• Beating the spread
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• A simplicial mapping method for locating the zeros of a function
• Revivals, or the Talbot effect, for the Airy equation
• CCOMP: an efficient algorithm for complex roots computation of determinantal equations
• Learned Infinite Elements
• On root finding algorithms for complex functions with branch cuts
• Robust location of optical fiber modes via the argument principle method

This page was built for publication: Complex root finding algorithm based on Delaunay triangulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828142)