Stochastic algorithms for solving structured low-rank approximation problems

Gillard, J. W. ORCID: https://orcid.org/0000-0001-9166-298X and Zhigljavsky, A. A. ORCID: https://orcid.org/0000-0003-0630-8279 2015. Stochastic algorithms for solving structured low-rank approximation problems. Communications in Nonlinear Science and Numerical Simulation 21 (1-3) , pp. 70-88. 10.1016/j.cnsns.2014.08.023

Preview

PDF - Submitted Pre-Print Version Download (315kB) | Preview

Abstract

In this paper, we investigate the complexity of the numerical construction of the Hankel structured low-rank approximation (HSLRA) problem, and develop a family of algorithms to solve this problem. Briefly, HSLRA is the problem of finding the closest (in some pre-defined norm) rank r approximation of a given Hankel matrix, which is also of Hankel structure. We demonstrate that finding optimal solutions of this problem is very hard. For example, we argue that if HSLRA is considered as a problem of estimating parameters of damped sinusoids, then the associated optimization problem is basically unsolvable. We discuss what is known as the orthogonality condition, which solutions to the HSLRA problem should satisfy, and describe how any approximation may be corrected to achieve this orthogonality. Unlike many other methods described in the literature the family of algorithms we propose has the property of guaranteed convergence.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Mathematics
Subjects:	Q Science > QA Mathematics
Uncontrolled Keywords:	Structured low rank approximation; Hankel matrix; Global optimization
Publisher:	Elsevier
ISSN:	1007-5704
Last Modified:	23 Nov 2024 03:45
URI:	https://orca.cardiff.ac.uk/id/eprint/71431

Citation Data

Cited 18 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item