On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems

DOI10.1016/0898-1221(85)90094-XzbMath0622.65035OpenAlexW2038395603MaRDI QIDQ1091081

Pan, Victor Y.

Publication date: 1985

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(85)90094-x

zbMATH Keywords

computational complexityeigenvaluesequential algorithmalgebraic algorithmsroots of a polynomial

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Parallel numerical computation (65Y05) Real polynomials: location of zeros (26C10)

Related Items

Algebraic complexity of computing polynomial zeros, Certified approximate univariate GCDs, A fast and stable algorithm for splitting polynomials

Cites Work

• Fast algorithms for the characteristic polynomial
• Factoring polynomials with rational coefficients
• Exact algorithms for polynomial real root approximation using continued fractions
• Parallel Solution of Certain Toeplitz Linear Systems
• The fundamental theorem of algebra and complexity theory
• Fast parallel algorithms for polynomial division over an arbitrary field of constants
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item