Numerical factorization of polynomials via a fast transversal filter

DOI10.1109/82.899660zbMATH Open0987.93025OpenAlexW2107964074MaRDI QIDQ2732969FDOQ2732969

Authors: Mohammed A. Hasan 

Publication date: 2 December 2001

Published in: IEEE Transactions on Circuits and Systems. II: Analog and Digital Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/82.899660

Recommendations

• scientific article; zbMATH DE number 1262457
• A fast and stable algorithm for splitting polynomials
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
• On one method of factorization of polynomials
• Hankel matrices and their applications to the numerical factorization of polynomials

zbMATH Keywords

difference equationunivariate polynomialsnumerical factorizationfast transversal filter

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Analytic circuit theory (94C05)

Cited In (2)

• Numerical algorithms for polynomial plus/minus factorization
• Title not available (Why is that?)

This page was built for publication: Numerical factorization of polynomials via a fast transversal filter

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