The globalization of Durand-Kerner algorithm
From MaRDI portal
Publication:1387545
DOI10.1007/BF00132798zbMath0905.65058MaRDI QIDQ1387545
Publication date: 9 February 1999
Published in: Applied Mathematics and Mechanics. (English Edition) (Search for Journal in Brave)
global convergence; point estimation; steplength selection; path tracing; continuous homotopy; Durand-Kerner algorithms
30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)
65H05: Numerical computation of solutions to single equations
26C10: Real polynomials: location of zeros
Cites Work
- Some modifications of the parallel Halley iteration method and their convergence
- Homotopy method for generalized eigenvalue problems \(Ax=\lambda Bx\)
- Complexity analysis of a process for simultaneously obtaining all zeros of polynomials
- The theory of Smale's point estimation and its applications
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- Numerical Solution of a Class of Deficient Polynomial Systems
- The Cheater’s Homotopy: An Efficient Procedure for Solving Systems of Polynomial Equations
- Solving Eigenvalue Problems of Real Nonsymmetric Matrices with Real Homotopies
- Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
- Finding all solutions to polynomial systems and other systems of equations
- On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
- Unnamed Item
- Unnamed Item
- Unnamed Item