Singular value decomposition of a rectangular matrix A of size MxN is its representation in the form of product A = U W V ^T, where U is an orthogonal matrix of size MxM, W - diagonal matrix of size MxN with non-negative elements on the main diagonal (singular values) in descending order, V - orthogonal matrix of size NxN.

Note #1
The singular value decomposition has a number of useful properties which enable it to be used for matrix inversion and pseudoinversion, solving systems of linear equations and evaluating condition numbers, solving underdetermined and overdetermined systems and a number of other problems.

There are several algorithms for computing singular values of a bidiagonal matrix. Taking into account that there is an algorithm reduces rectangular matrix to bidiagonal in finite number of steps using two-sided orthogonal transformation, we can reduce the problem of singular value decomposition of a general matrix to a singular value decomposition of a bidiagonal matrix. This is done in algorithm of SVD decomposition of rectangular matrix.

Subroutine description

The subroutine RMatrixBDSVD performs the singular value decomposition of a bidiagonal matrix given by arrays D and E (main and secondary diagonals). Depending on the value of IsUpper the matrix is considered as an upper or lower bidiagonal matrix.

The algorithm saves the obtained singular values in array D (replacing the main diagonal). Transformation matrices U and V ^T are returned as follows. The algorithm gets a variable U and VT. The variable U contains a matrix with NRU rows N columns and is right-sided multiplied by the transformation matrix U. The variable VT contains a matrix with N rows NCVT columns and is left-sided multiplied by the transformation matrix V ^T.

Thus, if we know the singular vectors of a bidiagonal matrix, we can obtain the singular vectors of a general matrix (if the matrices which transform it into bidiagonal form are known). If singular vectors are not required, NRU and NCVT should be zeros.

The parameter IsFractionalAccuracyRequired controls the precision of finding singular values. If it is set to True, the singular values will be found to have the same relative error, otherwise they will be found to have the same absolute error. Usually, it is recommended to use a False value (this can speed an algorithm up), since in most applications there is no need in extended precision of small singular values.

Report a bug

C#

C# 1.0 source.
bdsvd.csharp.zip - Bidiagonal singular value decomposition

C++

C++ source.
bdsvd.cpp.zip - Bidiagonal singular value decomposition
ablas.zip - optimized basic linear algebra subroutines with SSE2 support (for C++ sources only)

C++, multiple precision arithmetic

C++ source. MPFR/GMP is used.
GMP source is available from gmplib.org. MPFR source is available from www.mpfr.org.
bdsvd.mpfr.zip - Bidiagonal singular value decomposition
mpfr.zip - precompiled Win32 MPFR/GMP binaries

Delphi

Delphi source.
Can be compiled under FPC (in Delphi compatibility mode).
bdsvd.delphi.zip - Bidiagonal singular value decomposition

Visual Basic 6

Visual Basic 6 source.
bdsvd.vb6.zip - Bidiagonal singular value decomposition

Zonnon ^beta

Zonnon source.
Zonnon is an experimental language developed at ETH Zurich.
See www.zonnon.ethz.ch for more information.
bdsvd.zonnon.zip - Bidiagonal singular value decomposition