Elementary bidiagonal factorizations (Q1124871)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1371374
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Elementary bidiagonal factorizations |
scientific article; zbMATH DE number 1371374 |
Statements
Elementary bidiagonal factorizations (English)
0 references
29 November 1999
0 references
An elementary bidiagonal matrix is a square matrix such that every entry in the diagonal is \(1,\) exactly one entry either on the sub- or superdiagonal is nonzero, and all other entries are zero. The authors show that every \(n\times n\) matrix is a product of elementary bidiagonal matrices. For special cases, e.g., for \(2\times 2\) and \(3\times 3\) matrices they also determine the minimal number of factors needed in any elementary bidiagonal factorization.
0 references
elementary bidiagonal matrix
0 references
factorization
0 references
triangular matrix
0 references
product
0 references
0.8250332474708557
0 references
0.7693816423416138
0 references
0.7437179684638977
0 references
