Low-rank revealing UTV decompositions

    Research output: Contribution to journalJournal articleResearchpeer-review

    Abstract

    A UTV decomposition of an m x n matrix is a product of an orthogonal matrix, a middle triangular matrix, and another orthogonal matrix. In this paper we present and analyze algorithms for computing updatable rank-revealing UTV decompositions that are efficient whenever the numerical rank of the matrix is much less than its dimensions.
    Original languageEnglish
    JournalNumerical Algorithms
    Volume15
    Issue number1
    Pages (from-to)37-55
    ISSN1017-1398
    DOIs
    Publication statusPublished - 1997

    Cite this

    Hansen, Per Christian ; Fierro, R.D. / Low-rank revealing UTV decompositions. In: Numerical Algorithms. 1997 ; Vol. 15, No. 1. pp. 37-55.
    @article{957c83967f81482da505bf1d5cc29884,
    title = "Low-rank revealing UTV decompositions",
    abstract = "A UTV decomposition of an m x n matrix is a product of an orthogonal matrix, a middle triangular matrix, and another orthogonal matrix. In this paper we present and analyze algorithms for computing updatable rank-revealing UTV decompositions that are efficient whenever the numerical rank of the matrix is much less than its dimensions.",
    author = "Hansen, {Per Christian} and R.D Fierro",
    year = "1997",
    doi = "10.1023/A:1019254318361",
    language = "English",
    volume = "15",
    pages = "37--55",
    journal = "Numerical Algorithms",
    issn = "1017-1398",
    publisher = "Springer New York",
    number = "1",

    }

    Low-rank revealing UTV decompositions. / Hansen, Per Christian; Fierro, R.D.

    In: Numerical Algorithms, Vol. 15, No. 1, 1997, p. 37-55.

    Research output: Contribution to journalJournal articleResearchpeer-review

    TY - JOUR

    T1 - Low-rank revealing UTV decompositions

    AU - Hansen, Per Christian

    AU - Fierro, R.D

    PY - 1997

    Y1 - 1997

    N2 - A UTV decomposition of an m x n matrix is a product of an orthogonal matrix, a middle triangular matrix, and another orthogonal matrix. In this paper we present and analyze algorithms for computing updatable rank-revealing UTV decompositions that are efficient whenever the numerical rank of the matrix is much less than its dimensions.

    AB - A UTV decomposition of an m x n matrix is a product of an orthogonal matrix, a middle triangular matrix, and another orthogonal matrix. In this paper we present and analyze algorithms for computing updatable rank-revealing UTV decompositions that are efficient whenever the numerical rank of the matrix is much less than its dimensions.

    U2 - 10.1023/A:1019254318361

    DO - 10.1023/A:1019254318361

    M3 - Journal article

    VL - 15

    SP - 37

    EP - 55

    JO - Numerical Algorithms

    JF - Numerical Algorithms

    SN - 1017-1398

    IS - 1

    ER -