Low-rank revealing UTV decompositions

    Research output: Contribution to journalJournal articleResearchpeer-review


    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
    Issue number1
    Pages (from-to)37-55
    Publication statusPublished - 1997

    Fingerprint Dive into the research topics of 'Low-rank revealing UTV decompositions'. Together they form a unique fingerprint.

    Cite this