In mathematics, a bidiagonal matrix is a banded matrix with non-zero entries along the main diagonal and either 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 is upper bidiagonal. When the diagonal below the main diagonal has the non-zero entries the matrix is lower bidiagonal.
For example, the following matrix is upper bidiagonal:
and the following matrix is lower bidiagonal:
|This section needs expansion. You can help by adding to it. (January 2017)|
- List of matrices
- Hessenberg form The Hessenberg form is similar, but has more non zero diagonal lines than 2.
- Stewart, G. W. (2001) Matrix Algorithms, Volume II: Eigensystems. Society for Industrial and Applied Mathematics. ISBN 0-89871-503-2.
- High performance algorithms for reduction to condensed (Hessenberg, tridiagonal, bidiagonal) form
|This linear algebra-related article is a stub. You can help Wikipedia by expanding it.|
|This computer-programming-related article is a stub. You can help Wikipedia by expanding it.|