A fitting algorithm for real coefficient polynomial rooting
From MaRDI portal
Recommendations
- Real and complex polynomial root-finding by means of eigen-solving
- Finding polynomial roots: A fast algorithm convergent on the complex plane
- A constructive algorithm for finding the exact roots of polynomials with computable real coefficients.
- Coefficient-free adaptations of polynomial root-finders
- Real polynomial root-finding by means of matrix and polynomial iterations
Cites work
- scientific article; zbMATH DE number 3852905 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Implicit double shift \(QR\)-algorithm for companion matrices
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- Linear prediction theory. A mathematical basis for adaptive systems
- Numerical computation of polynomial zeros by means of Aberth's method
- Solving a Polynomial Equation: Some History and Recent Progress
- Solving cubics by polynomial fitting
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
Cited in
(3)
This page was built for publication: A fitting algorithm for real coefficient polynomial rooting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q421833)