New algorithms for exact and approximate polynomial decomposition

MaRDI QIDQ3447172zbMATH OpenFDO

Authors John P. May, Mark Giesbrecht

Publication date 28 June 2007

zbMATH Keywords

decompositiontame polynomialsunivariate polynomials

Mathematics Subject Classification ID

Polynomials in real and complex fields: factorization (12D05)

Recommendations

• Functional decomposition of polynomials: the tame case
• Decomposition of polynomials and approximate roots
• Multivariate polynomial decomposition
• scientific article; zbMATH DE number 4101330
• scientific article; zbMATH DE number 2125607

Cited in

(9)

• scientific article; zbMATH DE number 5957430 (Why is no real title available?)
• On Decomposition of Tame Polynomials and Rational Functions
• Decomposition of polynomials and approximate roots
• Universal decomposition algebra
• scientific article; zbMATH DE number 4101330 (Why is no real title available?)
• Novel algorithms for maximum DS decomposition
• Tame decompositions and collisions
• Novel algorithms for maximum DS decomposition
• An approximate decomposition of a multivariate polynomial and its application

This page was built for publication: New algorithms for exact and approximate polynomial decomposition

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