Total positivity and the QR algorithm (Q1379096)

From MaRDI portal
Revision as of 08:09, 10 February 2024 by RedirectionBot (talk | contribs) (‎Removed claims)
scientific article
Language Label Description Also known as
English
Total positivity and the QR algorithm
scientific article

    Statements

    Total positivity and the QR algorithm (English)
    0 references
    30 June 1998
    0 references
    A matrix \(A\) is TP (totally positive) if all its minors are nonnegative. It is NTP if it is nonsingular and TP. If all its minors are strictly positive it is called STP. A TP matrix \(A\) is called O (oscillatory) if there is a positive integer \(m\) such that \(A^m\) is STP. Assume \(A\) is real and symmetric and \(\mu\in{\mathbb{R}}\) is not an eigenvalue of \(A\), then the QR algorithm computes \(A-\mu I=QR\) and by reversing the order \(A'\) is obtained from \(A'-\mu I=RQ\). It is proved in this paper that if \(A\) is symmetric and has one of the properties NTP, O, or STP, then \(A'\) will have the same properties.
    0 references
    eigenvalues
    0 references
    QR algorithm
    0 references
    similarity transform
    0 references
    oscillatory matrices
    0 references
    totally positive matrices
    0 references

    Identifiers