QR factorization of Toeplitz matrices (Q1063382)

From MaRDI portal
Revision as of 00:52, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
QR factorization of Toeplitz matrices
scientific article

    Statements

    QR factorization of Toeplitz matrices (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1986
    0 references
    This paper presents a new algorithm for computing the QR factorization of an \(m\times n\) Toeplitz matrix in O(mn) operations. The algorithm exploits the procedure for the rank-1 modification and the fact that both principal (m-1)\(\times (n-1)\) submatrices of the Toeplitz matrix are identical.
    0 references
    0 references
    Toeplitz matrix
    0 references
    orthogonal factorization
    0 references
    QR factorization
    0 references
    rank-1 modification
    0 references
    computational complexity
    0 references
    numerical stability
    0 references
    least squares
    0 references
    Cholesky factorization
    0 references
    Sweet's algorithm
    0 references