The globalization of Durand-Kerner algorithm

DOI10.1007/BF00132798MaRDI QIDQ1387545zbMATH OpenOpenAlexFDO

Authors Deren Wang, Fengguang Zhao

Publication date 9 February 1999

Published in Applied Mathematics and Mechanics. (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00132798

zbMATH Keywords

continuous homotopyDurand-Kerner algorithmsglobal convergencepath tracingpoint estimationsteplength selection

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) 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)

Review text

The construction of a regularly homotopic curve with probability one, based on homotopy theory and the relation between a symmetric polynomial and a polynomial in one variable, is proposed. The discrete tracing along this homotopic curve leads to a class of Durand-Kerner algorithms with stepsizes as parameters. The convergence of this class of algorithms is known, which solves the conjecture about the global property of the Durand-Kerner algorithm. The problem for steplength selection is also discussed. For the verification of the proposed theory a numerical example is given.

Recommendations

• scientific article; zbMATH DE number 3858307
• Global convergence of the Durand-Kerner method applied to the equation \(z^ 3 = 0\)
• On the determination of the safe initial approximation for the Durand- Kerner algorithm
• Two observations on Durand-Kerner's root-finding method

Cites work

• Complexity analysis of a process for simultaneously obtaining all zeros of polynomials
• Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
• Finding all solutions to polynomial systems and other systems of equations
• Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
• Homotopy method for generalized eigenvalue problems \(Ax=\lambda Bx\)
• scientific article; zbMATH DE number 3880013 (Why is no real title available?)
• scientific article; zbMATH DE number 47206 (Why is no real title available?)
• scientific article; zbMATH DE number 930560 (Why is no real title available?)
• Numerical Solution of a Class of Deficient Polynomial Systems
• On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
• Solving Eigenvalue Problems of Real Nonsymmetric Matrices with Real Homotopies
• Some modifications of the parallel Halley iteration method and their convergence
• The Cheater’s Homotopy: An Efficient Procedure for Solving Systems of Polynomial Equations
• The theory of Smale's point estimation and its applications

Cited in

(2)

• Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
• On a family of Weierstrass-type root-finding methods with accelerated convergence

This page was built for publication: The globalization of Durand-Kerner algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1387545)