Polynomial root finding by means of continuation
From MaRDI portal
Publication:1377268
DOI10.1007/BF02684414zbMath0891.65051MaRDI QIDQ1377268
Publication date: 4 February 1998
Published in: Computing (Search for Journal in Brave)
complexityalgorithmconvergenceiterative methodspolynomial zeroscontinuationpolynomial root findinghomotopy path tracking
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Polynomial root finding by means of continuation ⋮ Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
Cites Work
- Unnamed Item
- On condition numbers and the distance to the nearest ill-posed problem
- Initial approximations in Durand-Kerner's root finding method
- Solving polynomial systems
- The random product homotopy and deficient polynomial systems
- A new start system for solving deficient polynomial systems using continuation
- On the complexity of a PL homotopy algorithm for zeros of polynomials
- Weierstrass formula and zero-finding methods
- Polynomial root finding by means of continuation
- On some iteration functions for the simultaneous computation of multiple complex polynomial zeros
- Simultaneous inclusion of the zeros of a polynomial
- Numerical Solution of a Class of Deficient Polynomial Systems
- Solving Deficient Polynomial Systems with Homotopies which Keep the Subschemes at Infinity Invariant
- On the Number of Solutions to Polynomial Systems of Equations
- Complexity of Bezout's Theorem I: Geometric Aspects
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
This page was built for publication: Polynomial root finding by means of continuation
