Polynomial root finding using iterated eigenvalue computation
From MaRDI portal
Recommendations
Cited in
(20)- Structured matrix methods for polynomial root-finding
- Distance bounds of \(\varepsilon\)-points on hypersurfaces
- Parametrization of approximate algebraic curves by lines
- Motivations for an arbitrary precision interval arithmetic and the MPFI library
- Real and complex polynomial root-finding by means of eigen-solving
- Intersection of a ruled surface with a free-form surface
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- Fast evaluation and root finding for polynomials with floating-point coefficients
- A method for finding the zeros of polynomials using a companion matrix.
- Root-finding with eigen-solving
- Improved algorithms for computing determinants and resultants
- Relations between roots and coefficients, interpolation and application to system solving
- Method for finding multiple roots of polynomials
- Parametrization of approximate algebraic surfaces by lines
- Real and complex polynomial root-finding with eigen-solving and preprocessing
- A new fast root-finder for black box polynomials
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials
- Efficient isolation of polynomial's real roots.
- The polynomial pivots as initial values for a new root-finding iterative method
- Coefficient-free adaptations of polynomial root-finders
This page was built for publication: Polynomial root finding using iterated eigenvalue computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958922)
