The approximate irreducible factorization of a univariate polynomial
From MaRDI portal
Publication:2883841
DOI10.1145/1576702.1576752zbMath1237.65048OpenAlexW1978606110MaRDI QIDQ2883841
Publication date: 13 May 2012
Published in: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1576702.1576752
Symbolic computation and algebraic computation (68W30) Polynomials in general fields (irreducibility, etc.) (12E05) Numerical computation of roots of polynomial equations (65H04)
Related Items (3)
Sensitivity and Computation of a Defective Eigenvalue ⋮ A Newton’s iteration converges quadratically to nonisolated solutions too ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra
Uses Software
This page was built for publication: The approximate irreducible factorization of a univariate polynomial
