Algorithms for adaptive factorization of polynomials

DOI10.1016/0165-1684(94)90192-9MaRDI QIDQ1314605zbMATH OpenOpenAlexFDO

Authors Ari Kangas

Publication date 24 February 1994

Published in Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0165-1684(94)90192-9

zbMATH Keywords

adaptive factorization of polynomialsparallel Newton algorithms

Mathematics Subject Classification ID

Adaptive control/observation systems (93C40)

Recommendations

• Numerical algorithms for polynomial plus/minus factorization
• On the acceleration of an algorithm for polynomial factorization
• On some iterative algorithms for polynomial factorization
• scientific article; zbMATH DE number 4149459
• scientific article; zbMATH DE number 1594303
• A new polynomial factorization algorithm and its implementation
• Polynomial factorization: Sharp bounds, efficient algorithms
• An efficient algorithm for factoring polynomials over algebraic extension field
• Univariate polynomials, nearly optimal algorithms for factorization and rootfinding
• An efficient algorithm for the multivariable Adomian polynomials

Cited in

(2)

• scientific article; zbMATH DE number 4006369 (Why is no real title available?)
• scientific article; zbMATH DE number 3947528 (Why is no real title available?)

This page was built for publication: Algorithms for adaptive factorization of polynomials

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