scientific article; zbMATH DE number 880382

MaRDI QIDQ4877914zbMATH OpenFDO

Authors Dario A. Bini

Publication date 23 June 1996

zbMATH Keywords

algorithmscomplexitydivide and conquer techniquepolynomial root-finding

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of solutions to single equations (65H05) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• A divide and conquer method for polynomial zeros
• Real and complex polynomial root-finding by means of eigen-solving
• An efficient algorithm for the complex roots problem
• On the parallel arithmetic complexity of the root-finding problem

Cited in

(5)

• Subdivision methods for solving polynomial equations
• Efficient parallel factorization and solution of structured and unstructured linear systems
• scientific article; zbMATH DE number 5356112 (Why is no real title available?)
• Polynomial Root-Finding Algorithms and Branched Covers
• A divide and conquer method for polynomial zeros

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 Q4877914)