scientific article; zbMATH DE number 3880013

zbMATH Open0552.65045MaRDI QIDQ3345694FDOQ3345694

Authors: Zeke Wang, Senlin Xu 

Publication date: 1984

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 3880014
• Publication:3031835
• scientific article; zbMATH DE number 3898128
• scientific article; zbMATH DE number 3976214
• On the cost of approximating all roots of a complex polynomial

zbMATH Keywords

Newton's methodpolynomialcost estimateKuhn's algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to single equations (65H05)

Cited In (14)

• The globalization of Durand-Kerner algorithm
• Title not available (Why is that?)
• Complexity bounds for zero-test algorithms
• Computational complexity. On the geometry of polynomials and a theory of cost. I
• Title not available (Why is that?)
• On the complexity of computing with zero-dimensional triangular sets
• Towards a proof of the Kuzmak-Kogelman-Keller algorithm
• Title not available (Why is that?)
• On the complexity of a PL homotopy algorithm for zeros of polynomials
• On the complexity of failed zero forcing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the cost of approximating all roots of a complex polynomial

This page was built for publication:

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