The rectangular matrix *A* could be represented as *A=Q·B·P ^{ T}*, where

Like other algorithms of orthogonal factorization (for example, QR and LQ decomposition algorithms), this algorithm uses a sequence of elementary reflections to transform the matrix *A*. The matrix is transformed from the left and from the right. The transformations gradually remove off-diagonal elements until all elements will be nulled except those located on 2 diagonals. If the number of rows in the matrix *A* is no less than the number of columns, we'll get an upper bidiagonal matrix. Otherwise, we'll get a lower bidiagonal matrix.

As a result of subroutine **RMatrixBD**, the matrix *A* is replaced by the bidiagonal matrix *B* and a sequence of reflection transformations stored in compact form. The form in which the transformations are stored and the subroutine parameters are described in more details in the subroutine comments.

The method is similar to QR decomposition which uses the lower part of matrix *R* to store matrix *Q*, but here two matrices are stored: matrix *Q* is stored in the lower part of matrix *B*, and matrix *P* is stored in the upper part.

As with QR decomposition, the subroutines for "unpacking" matrices *Q* and *P* are presented: **RMatrixBDUnpackQ** and **RMatrixBDUnpackPT**. The first subroutine allows to get matrix *Q* or some of its columns, the second subroutine allows to get matrix *P ^{ T}* or some of its rows. The subroutine

*This algorithm is transferred from the LAPACK library.*

*This article is licensed for personal use only.*

ALGLIB Project offers you two editions of ALGLIB:

**ALGLIB Free Edition**:

delivered for free

offers full set of numerical functionality

extensive algorithmic optimizations

no low level optimizations

non-commercial license

**ALGLIB Commercial Edition**:

flexible pricing

offers full set of numerical functionality

extensive algorithmic optimizations

high performance (SMP, SIMD)

commercial license with support plan

Links to download sections for Free and Commercial editions can be found below:

C++ library.

Delivered with sources.

Monolithic design.

Extreme portability.

Delivered with sources.

Monolithic design.

Extreme portability.

C# library with native kernels.

Delivered with sources.

VB.NET and IronPython wrappers.

Extreme portability.

Delivered with sources.

VB.NET and IronPython wrappers.

Extreme portability.

Delphi wrapper around C core.

Delivered as precompiled binary.

Compatible with FreePascal.

Delivered as precompiled binary.

Compatible with FreePascal.

CPython wrapper around C core.

Delivered as precompiled binary.

Delivered as precompiled binary.