Univariate polynomials
From MaRDI portal
Publication:2958942
DOI10.1145/384101.384136zbMath1356.65125OpenAlexW2049417271MaRDI QIDQ2958942
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.384136
computational complexityPadé approximationunivariate polynomialsrootfindingnumerical polynomial factorizationgeometry of polynomial zerosGraeffe's lifting
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (11)
Parametrization of approximate algebraic curves by lines ⋮ Fast Cauchy sum algorithms for polynomial zeros and matrix eigenvalues ⋮ Rigid continuation paths II. structured polynomial systems ⋮ Efficient polynomial root-refiners: a survey and new record efficiency estimates ⋮ Approximate parametrization of plane algebraic curves by linear systems of curves ⋮ Inverse power and Durand-Kerner iterations for univariate polynomial root-finding ⋮ Root-finding by expansion with independent constraints ⋮ An adaptive subdivision method for root finding of univariate polynomials ⋮ Distance bounds of \(\varepsilon\)-points on hypersurfaces ⋮ Parametrization of approximate algebraic surfaces by lines ⋮ Real polynomial root-finding by means of matrix and polynomial iterations
This page was built for publication: Univariate polynomials
