Polynomial root finding using iterated Eigenvalue computation
From MaRDI portal
Publication:2958922
DOI10.1145/384101.384119zbMath1356.65121OpenAlexW2055757595MaRDI QIDQ2958922
Publication date: 3 February 2017
Published in: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/384101.384119
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of roots of polynomial equations (65H04)
Related Items
Parametrization of approximate algebraic curves by lines, A method for finding the zeros of polynomials using a companion matrix., Efficient isolation of polynomial's real roots., Inverse power and Durand-Kerner iterations for univariate polynomial root-finding, Intersection of a ruled surface with a free-form surface, An iterated eigenvalue algorithm for approximating roots of univariate polynomials, Relations between roots and coefficients, interpolation and application to system solving, Improved algorithms for computing determinants and resultants, Distance bounds of \(\varepsilon\)-points on hypersurfaces, Method for finding multiple roots of polynomials, Motivations for an arbitrary precision interval arithmetic and the MPFI library, Parametrization of approximate algebraic surfaces by lines
