Exponential Speedup of the Janashia-Lagvilava Matrix Spectral Factorization Algorithm
Preprint
Abstract
Spectral factorization is a powerful mathematical tool with diverse applications in signal processing and beyond. The Janashia-Lagvilava method has emerged as a leading approach for matrix spectral factorization. In this paper, we extend a central equation of the method to the non-commutative case, enabling polynomial coefficients to be represented in block matrix form while preserving the equation's fundamental structure. This generalization results in an exponential speedup for high-dimensional matrices. Our approach addresses challenges in factorizing massive-dimensional matrices encountered in neural data analysis and other practical applications.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Determination of effective brain connectivity from activity correlationsPhysical Review E, 2019
- On the Algorithmization of Janashia-Lagvilava Matrix Spectral Factorization MethodIEEE Transactions on Information Theory, 2017
- A New Method of Matrix Spectral FactorizationIEEE Transactions on Information Theory, 2011
- A survey of spectral factorization methodsNumerical Linear Algebra with Applications, 2001
- The prediction theory of multivariate stochastic processes: I. The regularity conditionActa Mathematica, 1957
- Extrapolation, Interpolation, and Smoothing of Stationary Time Series1949