On root finding algorithms for complex functions with branch cuts

DOI10.1016/J.CAM.2016.10.015zbMath1372.65087OpenAlexW2543595653MaRDI QIDQ345951

Piotr Kowalczyk

Publication date: 2 December 2016

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2016.10.015

zbMATH Keywords

branch pointsbranch cutscomplex root finding

Mathematics Subject Classification ID

General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of solutions to single equations (65H05)

Related Items (4)

CCOMP: an efficient algorithm for complex roots computation of determinantal equations ⋮ On the computation of hybrid modes in planar layered waveguides with multiple anisotropic conductive sheets ⋮ A filled function method for minimizing control variation in constrained discrete-time optimal control problems ⋮ General approach to constructing optimal multipoint families of iterative methods using Hermite's rational interpolation

Cites Work

• Complex Root Finding Algorithm Based on Delaunay Triangulation
• An Exact Method for Finding the Roots of a Complex Polynomial
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On root finding algorithms for complex functions with branch cuts