We consider three different ways of algorithmization of the Janashia-Lagvilava spectral factorization method. The first algorithm is faster than the second one, however, it is only suitable for matrices of low dimension. The second algorithm, on the other hand, can be applied to matrices of substantially larger dimension. The third algorithm is a superfast implementation of the method, but only works in the polynomial case under the additional restriction that the zeros of the determinant are not too close to the boundary. All three algorithms fully utilize the advantage of the method which carries out spectral factorization of leading principal submatrices step-by-step. The corresponding results of numerical simulations are reported in order to describe the characteristic features of each algorithm and compare them to other existing algorithms.
24 June 2020 in Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
As it is known, the existence of the Wiener–Hopf factorization for a given matrix is a well-studied problem. Severe difficulties arise, however, when one needs to compute the factors approximately and obtain the partial indices. This problem is very important in various engineering applications and, therefore, remains to be subject of intensive investigations. In the present paper, we approximate a given matrix function and then explicitly factorize the approximation regardless of whether it has stable partial indices. For this reason, a technique developed in the Janashia–Lagvilava matrix spectral factorization method is applied. Numerical simulations illustrate our ideas in simple situations that demonstrate the potential of the method.
22 July 2019 in Journal of the London Mathematical Society
A key ingredient of Janashia–Lagvilava matrix spectral factorization method, which is a theorem from complex function theory, is generalized to pure algebraic form.
4 May 2022 in Journal of Mathematical Analysis and Applications
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.