Inmathematics, abidiagonal matrix is abanded matrix with non-zero entries along the main diagonal andeither the diagonal above or the diagonal below. This means there are exactly two non-zero diagonals in the matrix.
When the diagonal above the main diagonal has the non-zero entries the matrix isupper bidiagonal. When the diagonal below the main diagonal has the non-zero entries the matrix islower bidiagonal.
For example, the following matrix isupper bidiagonal:
and the following matrix islower bidiagonal:
The eigenvalues of a bidiagonal matrix (of either type) are given by the entries of the diagonal.
One variant of theQR algorithm starts with reducing a general matrix into a bidiagonal one,[1]and thesingular value decomposition (SVD) uses this method as well.
Bidiagonalization allows guaranteed accuracy when usingfloating-point arithmetic to compute singular values.[2]
This sectionneeds expansion. You can help byadding missing information.(January 2017) |
Thiscomputer-programming-related article is astub. You can help Wikipedia byadding missing information. |