Preorderings, monotone functions, and best rank \(r\) approximations with applications to classical MDS (Q1329694)

From MaRDI portal





scientific article; zbMATH DE number 605284
Language Label Description Also known as
English
Preorderings, monotone functions, and best rank \(r\) approximations with applications to classical MDS
scientific article; zbMATH DE number 605284

    Statements

    Preorderings, monotone functions, and best rank \(r\) approximations with applications to classical MDS (English)
    0 references
    0 references
    0 references
    16 March 1995
    0 references
    Let \(F_{n,k}\) denote the linear space of \(n\times k\)-matrices, \(1\leq k\leq n\), over the complex field. Based upon the singular-value theorem concerning the decomposition of a matrix \(A\) from \(F_{n,k}\), minimum norm rank \(r\), \(1\leq r<k\), approximations \(A_{(r)}\) satisfying \[ \psi(A- A_{(r)})\leq \psi(A- G) \qquad \text{for all } G\in F_{n,k} \] have been obtained in the past, first for \(\psi\) being the Euclidean norm and then for all unitarily invariant norms on the space \(F_{n,k}\). In the present paper, these results are extended to a class of monotone functions \(\psi\) with respect to a certain preordering on \(F_{n,k}\). In a second main part, the authors turn to approximating Hermitian matrices by elements of the cone of positive semidefinite matrices of rank less than or equal to \(r\) and its application in multidimensional scaling (MDS). Finally, universally optimal properties of the MDS solution are provided.
    0 references
    rank \(r\) approximating matrices
    0 references
    principal component analysis
    0 references
    linear space of matrices
    0 references
    singular-value theorem
    0 references
    class of monotone functions
    0 references
    preordering
    0 references
    cone of positive semidefinite matrices
    0 references
    multidimensional scaling
    0 references
    universally optimal properties
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references