Iterative algorithms for weighted and unweighted finite-rank time-series approximations
Not on the map. Why?
Abstract (arXiv)
The problem of time series approximation by series of finite rank is considered from the viewpoint of signal extraction. For signal estimation, a weighted least-squares method is applied to the trajectory matrix of the considered time series. Matrix weights are chosen to obtain equal or approximately equal weights in the equivalent problem of time-series least-squares approximation. Several new methods are suggested and examined together with the Cadzow's iterative method. The questions of convergence, computational complexity, and accuracy are considered for the proposed methods. The methods are compared on numeric examples.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 10 Jul 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1.
1 paper.