Bidiagonalization

Quality 0.50 · 1 view · Updated 2 months ago

title: "Bidiagonalization" type: doc version: 1 created: 2026-02-28 author: "Wikipedia contributors" status: active scope: public tags: ["matrix-theory", "numerical-linear-algebra"] topic_path: "science/mathematics" source: "https://en.wikipedia.org/wiki/Bidiagonalization" license: "CC BY-SA 4.0" wikipedia_page_id: 0 wikipedia_revision_id: 0

Bidiagonalization is one of unitary (orthogonal) matrix decompositions such that U* A V = B, where U and V are unitary (orthogonal) matrices; * denotes Hermitian transpose; and B is upper bidiagonal. A is allowed to be rectangular.

For dense matrices, the left and right unitary matrices are obtained by a series of Householder reflections alternately applied from the left and right. This is known as Golub-Kahan bidiagonalization. For large matrices, they are calculated iteratively by using Lanczos method, referred to as Golub-Kahan-Lanczos method.

Bidiagonalization has a very similar structure to the singular value decomposition (SVD). However, it is computed within finite operations, while SVD requires iterative schemes to find singular values. The latter is because the squared singular values are the roots of characteristic polynomials of A* A, where A is assumed to be tall.

References

. ::callout[type=info title="Wikipedia Source"] This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page. ::