Matrix Bruhat decompositions with a remark on the QR(GR) algorithm
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3898106 (Why is no real title available?)
- scientific article; zbMATH DE number 42572 (Why is no real title available?)
- scientific article; zbMATH DE number 3795355 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Convergence of algorithms of decomposition type for the eigenvalue problem
- On some algorithms for the solution of the complete eigenvalue problem
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- The calculation of Lame polynomials
Cited in
(11)- scientific article; zbMATH DE number 766236 (Why is no real title available?)
- A fast numerical method for the Cauchy problem for the Smoluchowski equation
- Some Combinatorially Defined Matrix Classes
- Fast computation of the rank profile matrix and the generalized Bruhat decomposition
- Asymptotic properties of delayed matrix exponential functions via Lambert function
- Systematic maximum sum rank codes
- Fast generalized Bruhat decomposition
- Bruhat canonical form for linear systems
- Using the Cauchy-Binet formula in the convergence proof of the tridiagonal QR algorithm with shifts
- Time and space efficient generators for quasiseparable matrices
- scientific article; zbMATH DE number 4179655 (Why is no real title available?)
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)