Fast orthogonal decomposition of rank deficient Toeplitz matrices (Q1208061): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: QR factorization of Toeplitz matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rang revealing QR factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Look-Ahead Levinson Algorithm for Indefinite Toeplitz Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Orthogonalization Technique with Applications to Time Series Analysis and Signal Processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The numerical stability of the lattice algorithm for least squares linear prediction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Toeplitz Orthogonalization Using Inner Products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Extensions of an Algorithm for Sparse Linear Least Squares Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Toeplitz orthogonalization / rank
 
Normal rank

Latest revision as of 15:09, 17 May 2024

scientific article
Language Label Description Also known as
English
Fast orthogonal decomposition of rank deficient Toeplitz matrices
scientific article

    Statements

    Fast orthogonal decomposition of rank deficient Toeplitz matrices (English)
    0 references
    0 references
    0 references
    16 May 1993
    0 references
    The fast QR factorization of a Toeplitz matrix developed by \textit{G. Cybenko} [SIAM J. Sci. Stat. Comput. 8, No. 5, 734-740 (1987; Zbl 0689.65022)] is modified to handle rank deficient cases. It uses a block form in a spirit similar to the look ahead Lanczos method.
    0 references
    fast orthogonal decomposition
    0 references
    fast QR factorization
    0 references
    Toeplitz matrix
    0 references
    rank deficient
    0 references
    look ahead Lanczos method
    0 references
    0 references

    Identifiers