The globalization of Durand-Kerner algorithm
From MaRDI portal
Publication:1387545
DOI10.1007/BF00132798zbMath0905.65058OpenAlexW2037572348MaRDI QIDQ1387545
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
global convergencepoint estimationsteplength selectionpath tracingcontinuous homotopyDurand-Kerner algorithms
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
On a family of Weierstrass-type root-finding methods with accelerated convergence ⋮ Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
This page was built for publication: The globalization of Durand-Kerner algorithm
