Paper
6 December 2002 Iterative refinement techniques for the spectral factorization of polynomials
A. Bacciardi, Luca Gemignani
Author Affiliations +
Abstract
In this paper we propose a superfast implementation of Wilson's method for the spectral factorization of Laurent polynomials based on a preconditioned conjugate gradient algorithm. The new computational scheme follows by exploiting several recently established connections between the considered factorization problem and the solution of certain discrete-time Lyapunov matrix equations whose coefficients are in controllable canonical form. The results of many numerical experiments even involving polynomials of very high degree are reported and discussed by showing that our preconditioning strategy is quite effective just when starting the iterative phase with a roughly approximation of the sought factor. Thus, our approach provides an efficient refinement procedure which is particularly suited to be combined with linearly convergent factorization algorithms when suffering from a very slow convergence due to the occurrence of roots close to the unit circle.
© (2002) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
A. Bacciardi and Luca Gemignani "Iterative refinement techniques for the spectral factorization of polynomials", Proc. SPIE 4791, Advanced Signal Processing Algorithms, Architectures, and Implementations XII, (6 December 2002); https://doi.org/10.1117/12.452468
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Matrices

Algorithm development

Numerical analysis

Composites

Computing systems

Astatine

Signal processing

RELATED CONTENT

Old And New Algorithms For Toeplitz Systems
Proceedings of SPIE (February 23 1988)
Implementation Of Cellular Arrays
Proceedings of SPIE (July 30 1982)

Back to Top