Matrix Bruhat decompositions with a remark on the QR(GR) algorithm

DOI10.1016/0024-3795(95)00453-XzbMath0870.65022MaRDI QIDQ5961578

Evgenij E. Tyrtyshnikov

Publication date: 28 July 1997

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

QR algorithmmatrix Bruhat decompositions

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (8)

Fast computation of the rank profile matrix and the generalized Bruhat decomposition ⋮ Bruhat canonical form for linear systems ⋮ Some Combinatorially Defined Matrix Classes ⋮ Time and space efficient generators for quasiseparable matrices ⋮ Asymptotic properties of delayed matrix exponential functions via Lambert function ⋮ Systematic maximum sum rank codes ⋮ Using the Cauchy-Binet formula in the convergence proof of the tridiagonal QR algorithm with shifts ⋮ A fast numerical method for the Cauchy problem for the Smoluchowski equation

Cites Work

• Convergence of algorithms of decomposition type for the eigenvalue problem
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
• On some algorithms for the solution of the complete eigenvalue problem
• The calculation of Lame polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Matrix Bruhat decompositions with a remark on the QR(GR) algorithm