Related papers: On multivariable matrix spectral factorization met…
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…
The problems of matrix spectral factorization and J-spectral factorization appear to be important for practical use in many MIMO control systems. We propose a numerical algorithm for J-spectral factorization which extends Janashia-Lagvilava…
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…
In this paper, the Janashia-Lagvilava matrix spectral factorization algorithm, which is designed for power spectral density functions defined on the unit circle, is extended to the real line. The proposed algorithm can be used directly for…
In the present paper, we estimate the convergence rate in the Janashia-Lagvilava spectral factorization algorithm (see Studia Mathematica, 137, 1999, 93-100) under the restriction on a spectral density matrix that its inverse is integrable.
A new method of matrix spectral factorization is proposed which reliably computes an approximate spectral factor of any matrix spectral density that admits spectral factorization
An analytic proof is proposed of Wiener's theorem on factorization of positive definite matrix-functions.
Multidimensional factorization method is formulated in arbitrary curvilinear coordinates. Particular cases of polar and spherical coordinates are considered and matrix potentials with separating variables are constructed. A new class of…
Para-Hermitian polynomial matrices obtained by matrix spectral factorization lead to functions useful in control theory systems, basis functions in numerical methods or multiscaling functions used in signal processing. We introduce a fast…
This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…
A spectral factorization theorem is proved for polynomial rank-deficient matrix-functions. The theorem is used to construct paraunitary matrix-functions with first rows given.
High-order methods gain more and more attention in computational fluid dynamics. However, the potential advantage of these methods depends critically on the availability of efficient elliptic solvers. With spectral-element methods, static…
A very simple and short proof of the polynomial matrix spectral factorization theorem (on the unit circle as well as on the real line) is presented, which relies on elementary complex analysis and linear algebra.
In this paper, we first describe a matricial Newton-type algorithm designed to solve the multivariable spectrum approximation problem. We then prove its global convergence. Finally, we apply this approximation procedure to multivariate…
Unmeasured or latent variables are often the cause of correlations between multivariate measurements, which are studied in a variety of fields such as psychology, ecology, and medicine. For Gaussian measurements, there are classical tools…
Factorization -- a simple form of standardization -- is concerned with reduction strategies, i.e. how a result is computed. We present a new technique for proving factorization theorems for compound rewriting systems in a modular way, which…
Matrix factorization is a powerful data analysis tool. It has been used in multivariate time series analysis, leading to the decomposition of the series in a small set of latent factors. However, little is known on the statistical…
Spectral inference provides fast algorithms and provable optimality for latent topic analysis. But for real data these algorithms require additional ad-hoc heuristics, and even then often produce unusable results. We explain this poor…
Multiresolution analysis and matrix factorization are foundational tools in computer vision. In this work, we study the interface between these two distinct topics and obtain techniques to uncover hierarchical block structure in symmetric…
We formulate a conjecture concerning spectral factorization of a class of trigonometric polynomials of two variables and prove it for special cases. Our method uses relations between the distribution of values of a polynomial of two…