Abstract
Conceptual and numerical issues related to the spectral factorization of polynomials and polynomial matrices with complex coefficients are studied in this report. Such investigation is motivated by the demand for reliable algorithms and CAD tools capable of solving latest signal processing problems involving complex polynomials (Ahlen and Sternad, 1993). Basic concepts of the real polynomial spectral facorization theory are inspected first, and their generalization and necessary modification for complex polynomials then follows. Efficient numerical methods which are known to work in the real case are then revisited and their applicability for complex coefficients is considered. As an immediate result of this research, the powerful algorithms proposed in this paper have given rise to several routines implemented in the Polynomial Toolbox for Matlab (Kwak ernaak and Sebek, 1999) and addressing the spectral factorization problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
