On root finding algorithms for complex functions with branch cuts
From MaRDI portal
Publication:345951
DOI10.1016/J.CAM.2016.10.015zbMATH Open1372.65087OpenAlexW2543595653MaRDI QIDQ345951FDOQ345951
Authors: P. 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
Recommendations
- Complex root finding algorithm based on Delaunay triangulation
- A novel cubically convergent iterative method for computing complex roots of nonlinear equations
- Polynomial root finding by means of continuation
- Polynomial Root-Finding Algorithms and Branched Covers
- A note on finding roots of monotonic branching functions
General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of solutions to single equations (65H05)
Cites Work
Cited In (10)
- A filled function method for minimizing control variation in constrained discrete-time optimal control problems
- Complex root finding algorithm based on Delaunay triangulation
- General approach to constructing optimal multipoint families of iterative methods using Hermite's rational interpolation
- 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
- On K nig's root-finding algorithms*
- A note on finding roots of monotonic branching functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Polynomial Root-Finding Algorithms and Branched Covers
This page was built for publication: On root finding algorithms for complex functions with branch cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q345951)
