arXiv subjects

Konstantin Usevich

Publications and source records attributed to Konstantin Usevich.

40 records · Page 3Linked to original sources

arXiv2014

Factorization approach to structured low-rank approximation with applications

We consider the problem of approximating an affinely structured matrix, for example a Hankel matrix, by a low-rank matrix with the same structure. This problem occurs in system identification, signal processing and computer algebra, among others. We impose the low-rank by modeling the approximation as a product of two factors with reduced dimension. The structure of the low-rank model is enforced by introducing a penalty term in the objective function. The proposed local optimization algorithm is able to solve the weighted structured low-rank approximation problem, as well as to deal with the cases of missing or fixed elements. In contrast to approaches based on kernel representations (in linear algebraic sense), the proposed algorithm is designed to address the case of small targeted rank. We compare it to existing approaches on numerical examples of system identification, approximate greatest common divisor problem, and symmetric tensor decomposition and demonstrate its consistently good performance.

math.NA↗

arXiv2014

On certain multivariate Vandermonde determinants whose variables separate

We prove that for almost square tensor product grids and certain sets of bivariate polynomials the Vandermonde determinant can be factored into a product of univariate Vandermonde determinants. This result generalizes the conjecture [Lemma 1, L. Bos et al. (2009), Dolomites Research Notes on Approximation, 2:1-15]. As a special case, we apply the result to Padua and Padua-like points.

math.NA↗

arXiv2013

Variable projection for affinely structured low-rank approximation in weighted 2-norms

The structured low-rank approximation problem for general affine structures, weighted 2-norms and fixed elements is considered. The variable projection principle is used to reduce the dimensionality of the optimization problem. Algorithms for evaluation of the cost function, the gradient and an approximation of the Hessian are developed. For $m \times n$ mosaic Hankel matrices the algorithms have complexity $O(m^2 n)$.

math.OC↗

arXiv2010

On signal and extraneous roots in Singular Spectrum Analysis

In the present paper we study properties of roots of characteristic polynomials for the linear recurrent formulae (LRF) that govern time series. We also investigate how the values of these roots affect Singular Spectrum Analysis implications, in what concerns separation of components, SSA forecasting and related signal parameter estimation methods. The roots of the characteristic polynomial for an LRF comprise the signal roots, which determine the structure of the time series, and extraneous roots. We show how the separability of two time series can be characterized in terms of their signal roots. All possible cases of exact separability are enumerated. We also examine properties of extraneous roots of the LRF used in SSA forecasting algorithms, which is equivalent to the Min-Norm vector in subspace-based estimation methods. We apply recent theoretical results for orthogonal polynomials on the unit circle, which enable us to precisely describe the asymptotic distribution of extraneous roots relative to the position of the signal roots.

stat.ME↗