Lifting/descending processes for polynomial zeros.
From MaRDI portal
Publication:1977147
Recommendations
- Graeffe's, Chebyshev-like, and Cardinal's processes for splitting a polynomial into factors
- Geometry of polynomials and root-finding via path-lifting
- scientific article; zbMATH DE number 1859220
- Vergleich von Abstiegsverfahren zur Nullstellenbestimmung bei Polynomen. (Comparison of descent methods for the calculation of zeros of polynomials)
Cites work
- Fast evaluation and interpolation at the Chebyshev sets of points
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Graeffe's, Chebyshev-like, and Cardinal's processes for splitting a polynomial into factors
- scientific article; zbMATH DE number 1263253 (Why is no real title available?)
- scientific article; zbMATH DE number 691245 (Why is no real title available?)
- scientific article; zbMATH DE number 953013 (Why is no real title available?)
- scientific article; zbMATH DE number 3383473 (Why is no real title available?)
- New fast algorithms for polynomial interpolation and evaluation on the Chebyshev node set
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- Parametrization of Newton's iteration for computations with structured matrices and applications
- Solving a Polynomial Equation: Some History and Recent Progress
Cited in
(1)
This page was built for publication: Lifting/descending processes for polynomial zeros.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1977147)