A circular splitting search algorithm for systems of complex equations
From MaRDI portal
Publication:2564286
DOI10.1016/S0377-0427(96)00069-6zbMath0871.65043MaRDI QIDQ2564286
Publication date: 26 August 1997
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-0427(96)00069-6
iterative methods; interval arithmetic; circular splitting search algorithm; safe starting regions; systems of complex equations
65H10: Numerical computation of solutions to systems of equations
65G30: Interval and finite arithmetic
65E05: General theory of numerical methods in complex analysis (potential theory, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Die zentrische Form in der Intervallarithmetik, ihre quadratische Konvergenz und ihre Inklusionsisotonie
- On an iterative method for simultaneous inclusion of polynomial complex zeros
- Circular centered forms for rational functions in several complex variables
- On the simultaneous determination of the zeros of an analytic function inside a simple smooth closed contour in the complex plane
- Fehlerabschätzung reeller Eigenwerte und Eigenvektoren von Matrizen
- Circular arithmetic and the determination of polynomial zeros
- The Representation of Complex Circular Functions Using Taylor Series
- Safe Starting Regions for Iterative Methods