On root finding algorithms for complex functions with branch cuts
From MaRDI portal
Publication:345951
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
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 274399 (Why is no real title available?)
- An Exact Method for Finding the Roots of a Complex Polynomial
- Complex root finding algorithm based on Delaunay triangulation
Cited in
(10)- A note on finding roots of monotonic branching functions
- CCOMP: an efficient algorithm for complex roots computation of determinantal equations
- Polynomial Root-Finding Algorithms and Branched Covers
- On K nig's root-finding algorithms*
- General approach to constructing optimal multipoint families of iterative methods using Hermite's rational interpolation
- Complex root finding algorithm based on Delaunay triangulation
- On the computation of hybrid modes in planar layered waveguides with multiple anisotropic conductive sheets
- scientific article; zbMATH DE number 1086546 (Why is no real title available?)
- scientific article; zbMATH DE number 1984134 (Why is no real title available?)
- A filled function method for minimizing control variation in constrained discrete-time optimal control problems
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)