On the parallel arithmetic complexity of the root-finding problem

DOI10.1080/00207168708803583MaRDI QIDQ3804187zbMATH OpenOpenAlexFDO

Authors Karabi Datta

Publication date 1987

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168708803583

zbMATH Keywords

arithmetic complexityHankel matricesparallel complexityroot-finding

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the Complexity of Polynomial Zeros
• scientific article; zbMATH DE number 57957
• Specified precision polynomial root isolation is in NC
• An efficient algorithm for the complex roots problem
• Algebraic complexity of computing polynomial zeros

Cites work

• A highly concurrent algorithm and pipeleined architecture for solving Toeplitz systems
• A Parallel QR Algorithm for Symmetric Tridiagonal Matrices
• A parallel Wilf algorithm for complex zeros of a polynomial
• Application of Hankel matrices of Markov parameters to the solutions of the Routh-Hurwitz and the Schur-Cohn problems
• Asymptotically fast solution of Toeplitz and related systems of linear equations
• scientific article; zbMATH DE number 3138903 (Why is no real title available?)
• Inverses of Toeplitz Operators, Innovations, and Orthogonal Polynomials
• On Certain Parallel Toeplitz Linear System Solvers
• Parallel complexities and computations of cholesky's decomposition and QR factorization
• The Triangular Decomposition of Hankel Matrices

Cited in

(14)

• Fast parallel algorithms for Graeffe's root squaring technique
• Specified precision polynomial root isolation is in NC
• Finding roots of a real polynomial simultaneously by means of Bairstow's method
• On the Communication Complexity of Solving a Polynomial Equation
• A parallel root-finding algorithm
• scientific article; zbMATH DE number 4064369 (Why is no real title available?)
• On parallel complexity of analytic functions
• Efficient parallel rooting of complex polynomials on the unit circle
• On the Complexity of Polynomial Zeros
• scientific article; zbMATH DE number 880382 (Why is no real title available?)
• A parallel algorithm for finding roots of a complex polynomial
• Finding the roots of a polynomial on an MIMD multicomputer
• On invariance of degree for certain computations
• A numerical algorithm for zero counting. I: Complexity and accuracy

This page was built for publication: On the parallel arithmetic complexity of the root-finding problem

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