Polynomial factorization and the Q-D algorithm
نویسندگان
چکیده
منابع مشابه
A Fast Algorithm for Polynomial Factorization over Q
We present an algorithm that returns a proper factor of a polynomial Φ(x) over the p-adic integers Zp (if Φ(x) is reducible over Qp) or returns a power basis of the ring of integers of Qp[x]/Φ(x)Qp[x] (if Φ(x) is irreducible over Qp). Our algorithm is based on the Round Four maximal order algorithm. Experimental results show that the new algorithm is considerably faster than the Round Four algo...
متن کاملA New Polynomial Factorization Algorithm and its Implementation
We consider the problem of factoring univariate polynomials over a nite eld. We demonstrate that the new baby step/giant step factoring method, recently developed by Kaltofen & Shoup, can be made into a very practical algorithm. We describe an implementation of this algorithm, and present the results of empirical tests comparing this new algorithm with others. When factoring polynomials modulo ...
متن کاملThe Complete Analysis of a Polynomial Factorization Algorithm over Nite Elds the Complete Analysis of a Polynomial Factorization Algorithm over Nite Elds the Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields
A uniied treatment of parameters relevant to factoring polynomials over nite elds is given. The framework is based on generating functions for describing parameters of interest and on singularity analysis for extracting asymptotic values. An outcome is a complete analysis of the standard polynomial factorization chain that is based on elimination of repeated factors, distinct degree factorizati...
متن کاملA New Multichannel Spectral Factorization Algorithm for Parahermitian Polynomial Matrices
Abstract—A novel multichannel spectral factorization algorithm is illustrated in this paper. This new algorithm is based on an iterative method for polynomial eigenvalue decomposition (PEVD) called the second order sequential best rotation (SBR2) algorithm [1]. By using the SBR2 algorithm, multichannel spectral factorization problems are simply broken down to a set of single channel problems wh...
متن کاملNew algorithm for polynomial spectral factorization with quadratic convergence. II
It is known that two cases of the polynomial spectral factorization are used in applications: the polynomial "discrete" spectral factorization (s) cp( — s) and all roots of the polynomial cp(s) have nonpositive real parts. It is suppos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1968
ISSN: 0024-3795
DOI: 10.1016/0024-3795(68)90019-0