Complex root finding algorithm based on Delaunay triangulation

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

Authors 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)

Recommendations

• On root finding algorithms for complex functions with branch cuts
• Locating all the zeros of an analytic function in one complex variable
• A derivative-free algorithm for computing zeros of analytic functions
• scientific article; zbMATH DE number 1131781
• A quasi-shrinking rectangle algorithm for complex zeros of a function

Cites work

• scientific article; zbMATH DE number 3863589 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 1174400 (Why is no real title available?)
• scientific article; zbMATH DE number 274399 (Why is no real title available?)
• An Exact Method for Finding the Roots of a Complex Polynomial
• Beating the spread, time-optimal point meshing
• On the convergence of multipoint iterations

Cited in

(8)

• 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
• On root finding algorithms for complex functions with branch cuts
• A quasi-shrinking rectangle algorithm for complex zeros of a function
• Revivals, or the Talbot effect, for the Airy equation
• A simplicial mapping method for locating the zeros of a function
• A global argument-based algorithm for finding complex zeros and poles to investigate plasma kinetic instabilities

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)