Rutishauser’s LR algorithm and Bruhat iteration

DOI10.1080/03081087.2014.940345MaRDI QIDQ3455666zbMATH OpenOpenAlexFDO

Authors Mary Clair Thompson, Tin-Yau Tam

Publication date 11 December 2015

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03081087.2014.940345

zbMATH Keywords

Bruhat decompositionBruhat iterationcomplete multiplicative Jordan decompositionLR algorithmsemisimple Lie group

Mathematics Subject Classification ID

General properties and structure of real Lie groups (22E15) Semisimple Lie groups and their representations (22E46) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Cites work

• A Geometric Theory for the QR, LU and Power Iterations
• Asymptotic behavior of Iwasawa and Cholesky iterations
• Francis’s Algorithm
• From qd to LR, or, how were the qd and LR algorithms discovered?
• scientific article; zbMATH DE number 3705455 (Why is no real title available?)
• On the Gelfand–Naimark decomposition of a nonsingular matrix
• The QR algorithm: 50 years later its genesis by John Francis and Vera Kublanovskaya and subsequent developments
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1

This page was built for publication: Rutishauser’s LR algorithm and Bruhat iteration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3455666)