scientific article
From MaRDI portal
Publication:3128885
zbMath0867.65021MaRDI QIDQ3128885
Publication date: 13 July 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexityalgorithmsconvergencepolynomial zerosgeometric constructionNewton's iterationisolated clusters of zeros
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)
Related Items (6)
Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant ⋮ Optimal and nearly optimal algorithms for approximating polynomial zeros ⋮ Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. ⋮ Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra ⋮ Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications ⋮ Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)]
This page was built for publication:
