A Hybrid Approach for Normal Factorization of Polynomials

DOI10.1007/11758525_54MaRDI QIDQ3545103zbMATH OpenOpenAlexFDO

Authors D. S. Triantafyllou, Nicos Karcanias, Marilena Mitrouli

Publication date 9 December 2008

Published in Computational Science – ICCS 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11758525_54

zbMATH Keywords

factorizationpolynomialsgreatest common divisorapproximate computations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• Normal factorisation of polynomials and computational issues.
• scientific article; zbMATH DE number 2151340
• A general factorization method for multivariable polynomials
• scientific article; zbMATH DE number 1253993
• A new polynomial factorization algorithm and its implementation
• A unified method for multivariate polynomial factorizations
• Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases
• A generalization of Lin's method for polynomial factorization
• scientific article; zbMATH DE number 4149459
• The numerical factorization of polynomials

Cited in

(2)

• A hybrid method for computing the intersection and tangency points of plane curves
• Normal factorisation of polynomials and computational issues.

This page was built for publication: A Hybrid Approach for Normal Factorization of Polynomials

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