Bidiagonal matrix: Difference between revisions
Content deleted Content added
No edit summary |
m Add references section and/or general fixes. |
||
| Line 11: | Line 11: | ||
==Useful identities== |
==Useful identities== |
||
==References== |
==References== |
||
{{Reflist}} |
|||
[[Category:Matrices]] |
[[Category:Matrices]] |
||
[[Category:Linear algebra]] |
[[Category:Linear algebra]] |
||
Revision as of 16:37, 30 August 2008
A bidiagonal matrix is a symmetric tridiagonal matrix, a special type of matrix representation from the LAPACK Fortran package.
In physics, a special type of bidiagonal matrix shows up within the path-integral treatment of the Hamiltonian of a non-interacting system[1].
A symmetric tridiagonal or bidiagonal matrix is stored in two one-dimensional arrays, one of length n containing the diagonal elements, and one of length n-1 containing the off-diagonal elements. (EISPACK routines store the off-diagonal elements in elements 2:n of a vector of length n.)
External links
- http://www.netlib.org/lapack/lug/node125.html Source of this information
- http://www.nag.co.uk/numeric/fl/manual/html/indexes/kwic/bidiagonal.html For further information on bidiagonal matrices.
Useful identities
References
- ^ Negele & Orland, Quantum Many particle systems
 | This 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. |