Decomposition of an updated correlation matrix via hyperbolic transformation. (Q558537)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Decomposition of an updated correlation matrix via hyperbolic transformation.
scientific article

    Statements

    Decomposition of an updated correlation matrix via hyperbolic transformation. (English)
    0 references
    1 July 2005
    0 references
    Given a rectangular, in general complex, \(m\times n\) matrix \(X\), the problem is to compute singular values of \(X\) and of its update \(X^{\text{new}}\) obtained by omission of certain columns---\(m\times p\) matrix \(Y\)---and addition of new ones--- \(m\times k\)-matrix \(Z\). The classical way is to use the singular decomposition (SVD) algorithm based on the lower triangularization of \(X,\;Y\) and \(Z\). In the paper, another method is presented for computing singular values of \(X^{\text{new}}\), namely the hyperbolic SVD based on the hyperbolic Givens and Householder transformations matrices. Their properties have been proved in [\textit{D. Janovská} and \textit{G. Opfer}, Numer. Linear Algebra 8, 127--146 (2001; Zbl 1051.65045)] and are shortly reviewed here. Then the existence conditions of the hyperbolic SVD are recalled and an algorithm proposed using sequentially the Householder and Givens transformations. Finally, some applications of the algorithm are mentioned.
    0 references
    0 references
    0 references
    eigensystem of correlation matrix
    0 references
    hyperbolic transformations
    0 references
    hyperbolic Householder transformation
    0 references
    hyperbolic Gidens transformation
    0 references
    hyperbolic singular value decomposition
    0 references
    0 references