A Globally Convergent Method for Simultaneously Finding Polynomial Roots
From MaRDI portal
Publication:3680171
DOI10.2307/2007798zbMath0565.65026OpenAlexW4233970610MaRDI QIDQ3680171
Donato Trigiante, Lionello Pasquini
Publication date: 1985
Full work available at URL: https://doi.org/10.2307/2007798
quadratic convergencemultiple rootszeros of polynomialsimultaneous computation of all rootsset of starting points
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) Real polynomials: location of zeros (26C10)
Related Items
Some remarks on Dvorcuk's root-finding method, On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials, The Durand-Kerner method for trigonometric and exponential polynomials, Polynomial roots: The ultimate answer?, The Durand-Kerner polynomials roots-finding method in case of multiple roots, Modified Newton method in circular interval arithmetic, Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros, Numerical factorization of multivariate complex polynomials, Numerical computation of polynomial zeros by means of Aberth's method, Computing singular solutions to polynomial systems, Durand-Kerner method for the real roots, Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)], The Weierstrass iterative method as a Petrov-Galerkin method for solving eigenvalue problem, Construction of iteration functions for the simultaneous computation of the solutions of equations and algebraic systems
