scientific article; zbMATH DE number 2151196

MaRDI QIDQ4660663zbMATH OpenFDO

Authors Erich L. Kaltofen, John P. May

Publication date 4 April 2005

zbMATH Keywords

absolute irreducibilityapproximate factorizationeffective Noether irreducibility formsmultivariate polynomial factorizationradius of irreducibilitysymbolic/numeric hybrid method

Mathematics Subject Classification ID

Polynomials, factorization in commutative rings (13P05) Numerical computation of solutions to single equations (65H05) Symbolic computation and algebraic computation (68W30)

Recommendations

• Computer Algebra in Scientific Computing
• Effective Noether irreducibility forms and applications
• Absolute irreducibility of bivariate polynomials via polytope method
• Towards more accurate separation bounds of empirical polynomials
• scientific article; zbMATH DE number 2151235

Cited in

(14)

• Nearest multivariate system with given root multiplicities
• Approximate factorization of multivariate polynomials and absolute irreducibility testing
• Effective Noether irreducibility forms and applications
• From an approximate to an exact absolute polynomial factorization
• Approximate factorization of multivariate polynomials using singular value decomposition
• scientific article; zbMATH DE number 5809457 (Why is no real title available?)
• Regularization and matrix computation in numerical polynomial algebra
• scientific article; zbMATH DE number 2151235 (Why is no real title available?)
• Geometry of the phase retrieval problem
• The numerical factorization of polynomials
• Computational experiences on the distances of polynomials to irreducible polynomials
• Towards more accurate separation bounds of empirical polynomials
• Multivariate subresultants in roots
• Indecomposability of polynomials via Jacobian matrix

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4660663)