Updating a generalized URV decomposition
By its motivation, the paper is centered around the signal processing and system identification problem of \textit{M. Mooner, B. De Moár, L. Vandenberghe}, and \textit{J. Vandervalle} [J. Int. Control 49, No. 1, 219-232 (1989; Zbl 0661.93072)] where a sequence of the vectors of signals (corrupted, possibly, by a moderate noise) is given and ``the best matrix recursion coefficients are sought. One proceeds in two steps, viz, through an estimate of a ``dummy sequence x (of a dimension n) and the subsequent least-squares determination of certain system matrices A, B, C and D. A key technicality lies in achieving the consistency of certain rank conditions (characterizing the information content and dealt with by a generalized URV algorithm). One can then solve the whole problem using QR decomposition. The crucial role is played by the updates of the input. An algorithm of updating URV decomposition is presented in the paper, in the context of the generalized singular value decomposition techniques of the quotient type. This means that the two matrices are being decomposed, simultaneously, in the rank deficient regime, and rows are being added, during the updates, to two rectangular (non-square) matrices. In combination, the ``interesting subspace of the intersection of the range space of the two matrices is being sought as containing the relevant information. The proposal itself grows from \textit{G.W. Stewart}'s ``subspace-tracking algorithm [An updating algorithm for subspace tracking, IEEE Trans. Signal Process. 40, 1535-1541 (1992)] and combines the growth of complexity (caused by the updates) with deflations (one has to get the three different ``full-rank subspaces in general). A sample code is provided in the appendix. It carries new information since, for the sake of brevity, the details of dealing with the degenerate cases (rank zero or one) were omitted from the text itself.
- An algorithm for rank estimation and subspace tracking
- Downdating the Rank-Revealing URV Decomposition
- Updating approximate principal components with applications to template tracking
- On the QR algorithm and updating the SVD and the URV decomposition in parallel
- scientific article; zbMATH DE number 1893759
- On the QR algorithm and updating the SVD and the URV decomposition in parallel
- Updating URV decompositions in parallel
- An algorithm and stability theory for downdating the ULV decomposition
- A locally optimal rank revealing product decomposition
- Rank decisions in matrix quotient decompositions
- scientific article; zbMATH DE number 554742 (Why is no real title available?)
- Downdating the Rank-Revealing URV Decomposition
- scientific article; zbMATH DE number 782070 (Why is no real title available?)
- An algorithm for rank estimation and subspace tracking
This page was built for publication: Updating a generalized URV decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2706269)