On the complexity of a PL homotopy algorithm for zeros of polynomials

DOI10.1007/BF02007437zbMath0790.65037OpenAlexW2376888628MaRDI QIDQ1314945

Tang'an Gao, Ze-Ke Wang

Publication date: 7 March 1994

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

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

zbMATH Keywords

complexityzeros of polynomialsPL homotopy algorithm

Mathematics Subject Classification ID

Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

Polynomial root finding by means of continuation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A geometrical interpretation of the without-exception feasibility of PL homotopy methods
• A constructive approach to zero distribution of a class of continuous functions
• On the cost of computing roots of polynomials
• On the cost of approximating all roots of a complex polynomial
• The fundamental theorem of algebra and complexity theory
• A PL homotopy for finding all the roots of a polynomial

This page was built for publication: On the complexity of a PL homotopy algorithm for zeros of polynomials