On Fiedler's characterization of tridiagonal matrices over arbitrary fields (Q1779413)

From MaRDI portal
Revision as of 14:37, 13 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
On Fiedler's characterization of tridiagonal matrices over arbitrary fields
scientific article

    Statements

    On Fiedler's characterization of tridiagonal matrices over arbitrary fields (English)
    0 references
    0 references
    0 references
    1 June 2005
    0 references
    An application of the general theorem, treated as Fiedler's characterization of tridiagonal matrices [\textit{M. Fiedler}, Linear Algebra Appl. 2, 191--197 (1969; Zbl 0194.06105)], to the case of tridiagonal \(5\times 5\)-matrices is considered. This theorem (Fiedler's property) is formulated in the paper as follows: ``Let \(A\) be an \(n\)-by-\(n\) real diagonal matrix. Then \(\text{rank}(A+ D)\geq n- 1\), for every \(n\)-by-\(n\) real diagonal matrix \(D\), if and only if \(A\) is permutational similar to an irreducible tridiagonal matrix''. As a result, some peculiarities, extensions and limitations, related to the basic relation \(A\to P^TTP\) in the case under consideration, where \(P\) is a permutation matrix and \(T\) an irreducible tridiagonal matrix, are presented. They are obtained and argued by making direct use of the explicit expressions for a wide set of the above mentioned \(5\times 5\)-matrices and the corresponding submatrices.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    tridiagonal \(5\times 5\)-matrices
    0 references
    rank
    0 references
    Fiedler property
    0 references
    similarity
    0 references
    finite fields
    0 references
    completion problem
    0 references