scientific article; zbMATH DE number 3880013

MaRDI QIDQ3345694zbMATH OpenFDO

Authors Zeke Wang, Senlin Xu

Publication date 1984

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)

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

Cited in

(14)

• The globalization of Durand-Kerner algorithm
• scientific article; zbMATH DE number 4037051 (Why is no real title available?)
• Complexity bounds for zero-test algorithms
• Computational complexity. On the geometry of polynomials and a theory of cost. I
• scientific article; zbMATH DE number 710644 (Why is no real title available?)
• On the complexity of computing with zero-dimensional triangular sets
• Towards a proof of the Kuzmak-Kogelman-Keller algorithm
• scientific article; zbMATH DE number 4129891 (Why is no real title available?)
• On the complexity of a PL homotopy algorithm for zeros of polynomials
• On the complexity of failed zero forcing
• scientific article; zbMATH DE number 99023 (Why is no real title available?)
• scientific article; zbMATH DE number 3898128 (Why is no real title available?)
• scientific article; zbMATH DE number 3976214 (Why is no real title available?)
• 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)