Successively ordered elementary bidiagonal factorization (Q2706307)
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 1578931
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Successively ordered elementary bidiagonal factorization |
scientific article; zbMATH DE number 1578931 |
Statements
19 March 2001
0 references
bidiagonal matrix
0 references
elimination
0 references
factorization
0 references
rank
0 references
Successively ordered elementary bidiagonal factorization (English)
0 references
Let \(I\) be the identity matrix and \(E_{ij}\) the matrix with \((i,j)\)-entry \(1\) and zeros in all other positions. Define \(L_i(s)=I+sE_{i,i-1}\) and \(U_j(t)=I+tE_{j-1,j},\) where \(s,t\) are elements in a given field \(F.\) The matrices \(L_i(s)\) and \(U_j(t)\) are called elementary bidiagonal matrices. The authors give necessary and sufficient conditions for a matrix \(A\) to have a successively ordered elementary bidiagonal factorization, i.e., they determine when \(A\) can be written as a product of matrices \(L_i(s),\) a diagonal matrix \(D,\) and a product of matrices \(U_j(t),\) all in a given order.
0 references
0.8250332474708557
0 references
0.7165626287460327
0 references
0.7072141170501709
0 references
0.6882049441337585
0 references