Lifting/descending processes for polynomial zeros.

DOI10.1006/jcom.1999.0533zbMath1041.65042OpenAlexW2073715207MaRDI QIDQ1977147

Pan, Victor Y., Mourrain, Bernard

Publication date: 2000

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7a071418542a6e56e1fe21f82179816e7300c7c1

zbMATH Keywords

polynomial zeroslifting polynomial zerosnumerical splitting a polynomial into factors

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast evaluation and interpolation at the Chebyshev sets of points
• New fast algorithms for polynomial interpolation and evaluation on the Chebyshev node set
• Parametrization of Newton's iteration for computations with structured matrices and applications
• Optimal and nearly optimal algorithms for approximating polynomial zeros
• Graeffe's, Chebyshev-like, and Cardinal's processes for splitting a polynomial into factors
• Fast solution of toeplitz systems of equations and computation of Padé approximants
• Solving a Polynomial Equation: Some History and Recent Progress