Displacement structure for Hankel, Vandermonde, and related (derived) matrices (Q803726): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claims
Property / author
 
Property / author: Joohwan Chun / rank
Normal rank
 
Property / author
 
Property / author: Thomas Kailath / rank
Normal rank
 

Revision as of 12:56, 20 February 2024

scientific article
Language Label Description Also known as
English
Displacement structure for Hankel, Vandermonde, and related (derived) matrices
scientific article

    Statements

    Displacement structure for Hankel, Vandermonde, and related (derived) matrices (English)
    0 references
    1991
    0 references
    The Toeplitz displacement rank of a matrix A with respect to \(\{F^ f,F^ b\}\) is the rank of \(A-F^ fAF^{bT}.\) This generalizes the more restricted notion for square matrices \(F^ f=F^ b=Z_ n\), the \(n\times n\) lower shift matrix with ones on the first subdiagonal and zeros everywhere else, which has been studied by the second author [Proc. Symp. Appl. Math. 37, 71-109 (1987; Zbl 0644.94005)]. A matrix is ``close-to-Toeplitz'' if it has a displacement rank (with respect to some \(\{F^ f,F^ b\})\) which is independent of its size. ``Close-to-Hankel'' matrices are defined along similar lines. Both types are referred to as ``structured matrices'', a property which is preserved under inversion multiplication and Schur complementation. The Hankel displacement of A is \(\Delta_{(F^ f,F^ b)}A=F^ fA- AF^{bT}\). This notion may be used in the triangularization of A. For the case that A is Vandermonde matrix, the authors obtain a fast triangular factorization algorithm. Algorithms are also obtained for triangular factorization of Vandermonde inverses, ``close-to-Hankel'' matrices and their inverses. For similar results for close-to-Toeplitz matrices and Toeplitz displacements the reader is referred to the authors [Numerical linear algebra, digital signal processing and parallel algorithms, Proc. NATO ASI, Leuven/Belg. 1988, NATO ASI Ser. Ser. F70, 215-236 (1991)]. No discussion on the numerical stability properties of the resulting algorithms is offered.
    0 references
    0 references
    Toeplitz displacement rank
    0 references
    close-to-Toeplitz
    0 references
    Close-to-Hankel
    0 references
    structured matrices
    0 references
    inversion multiplication
    0 references
    Schur complementation
    0 references
    Hankel displacement
    0 references
    Vandermonde matrix
    0 references
    fast triangular factorization algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references