On the Algorithmic Solvability of Spectral Factorization and Applications

DOI10.1109/TIT.2020.2968028MaRDI QIDQ5124449zbMATH OpenOpenAlexWikidataFDO

Authors Holger Boche, Volker Pohl

Publication date 29 September 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Classical models of computation (Turing machines, etc.) (68Q04) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• The analytic computation of inner-outer and spectral factorization problems
• Algorithms for multidimensional spectral factorization and sum of squares
• On spectral factorization in multidimensions
• Spectral factorizations and sums of squares representations via semidefinite programming
• scientific article; zbMATH DE number 2246575
• On approximate spectral factorization of matrix functions
• New algorithms for polynomial \(J\)-spectral factorization
• Effective fast algorithms for polynomial spectral factorization
• On non-optimal spectral factorizations
• Spectrally arbitrary factorization: the nonderogatory case

Cited in

(6)

• Fast separable factorization and applications
• Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness
• Recent progress in computability for prediction and Wiener filter theory
• New Characterization of the Factor Refinement Algorithm with Applications
• Mathematical algorithm design for deep learning under societal and judicial constraints: the algorithmic transparency requirement
• Calculating the spectral factorization and outer functions by sampling-based approximations -- fundamental limitations

This page was built for publication: On the Algorithmic Solvability of Spectral Factorization and Applications

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