Matrix Bruhat decompositions with a remark on the QR(GR) algorithm
From MaRDI portal
DOI10.1016/0024-3795(95)00453-XzbMATH Open0870.65022MaRDI QIDQ5961578FDOQ5961578
Publication date: 28 July 1997
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On some algorithms for the solution of the complete eigenvalue problem
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- Convergence of algorithms of decomposition type for the eigenvalue problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The calculation of Lame polynomials
Cited In (11)
- A fast numerical method for the Cauchy problem for the Smoluchowski equation
- Fast generalized Bruhat decomposition
- Fast computation of the rank profile matrix and the generalized Bruhat decomposition
- Bruhat canonical form for linear systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Asymptotic properties of delayed matrix exponential functions via Lambert function
- Some Combinatorially Defined Matrix Classes
- Using the Cauchy-Binet formula in the convergence proof of the tridiagonal QR algorithm with shifts
- Time and space efficient generators for quasiseparable matrices
- Systematic maximum sum rank codes
This page was built for publication: Matrix Bruhat decompositions with a remark on the QR(GR) algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961578)
