Matrix Bruhat decompositions with a remark on the QR(GR) algorithm (Q5961578): Difference between revisions

The author shows that the matrix counterpart of the so-called Bruhat decompositions that figure in group theory, can be introduced in an elementary manner. Then in a simple and systematic way he presents two kinds of matrix Bruhat decompositions. He proves that such decompositions govern the eigenvalued disorders in the QR algorithm. The author concludes with the comment that this paper can be considered as a commentary on a previous observation about the QR algorithm made by \textit{J. H. Wilkinson} [Computer J. 8, 77-84 (1965; Zbl 0135.37602)].