getsqrhrt#

Functions

void sgetsqrhrt(
    const INT           m,
    const INT           n,
    const INT           mb1,
    const INT           nb1,
    const INT           nb2,
          f32* restrict A,
    const INT           lda,
          f32* restrict T,
    const INT           ldt,
          f32* restrict work,
    const INT           lwork,
          INT*          info
);
void sgetsqrhrt(const INT m, const INT n, const INT mb1, const INT nb1, const INT nb2, f32 *restrict A, const INT lda, f32 *restrict T, const INT ldt, f32 *restrict work, const INT lwork, INT *info)#

SGETSQRHRT computes a NB2-sized column blocked QR-factorization of a real M-by-N matrix A with M >= N,.

A = Q * R.

The routine uses internally a NB1-sized column blocked and MB1-sized row blocked TSQR-factorization and performs the reconstruction of the Householder vectors from the TSQR output.

Parameters

in
m

The number of rows of the matrix A. m >= 0.

in
n

The number of columns of the matrix A. m >= n >= 0.

in
mb1

The row block size to be used in the blocked TSQR. mb1 > n.

in
nb1

The column block size to be used in the blocked TSQR. n >= nb1 >= 1.

in
nb2

The block size to be used in the blocked QR output. nb2 >= 1.

inout
A

Double precision array, dimension (lda, n). On entry, the M-by-N matrix A. On exit, the upper triangular R factor and the Householder vectors V below the diagonal (compact WY representation).

in
lda

The leading dimension of the array A. lda >= max(1, m).

out
T

Double precision array, dimension (ldt, n). The upper triangular block reflectors.

in
ldt

The leading dimension of the array T. ldt >= nb2.

out
work

Double precision workspace of size (max(1, lwork)). On exit, work[0] returns the optimal lwork.

in
lwork

The dimension of the array work. If lwork = -1, then a workspace query is assumed.

out
info

  • = 0: successful exit

  • < 0: if info = -i, the i-th argument had an illegal value

Functions

void dgetsqrhrt(
    const INT           m,
    const INT           n,
    const INT           mb1,
    const INT           nb1,
    const INT           nb2,
          f64* restrict A,
    const INT           lda,
          f64* restrict T,
    const INT           ldt,
          f64* restrict work,
    const INT           lwork,
          INT*          info
);
void dgetsqrhrt(const INT m, const INT n, const INT mb1, const INT nb1, const INT nb2, f64 *restrict A, const INT lda, f64 *restrict T, const INT ldt, f64 *restrict work, const INT lwork, INT *info)#

DGETSQRHRT computes a NB2-sized column blocked QR-factorization of a real M-by-N matrix A with M >= N,.

A = Q * R.

The routine uses internally a NB1-sized column blocked and MB1-sized row blocked TSQR-factorization and performs the reconstruction of the Householder vectors from the TSQR output.

Parameters

in
m

The number of rows of the matrix A. m >= 0.

in
n

The number of columns of the matrix A. m >= n >= 0.

in
mb1

The row block size to be used in the blocked TSQR. mb1 > n.

in
nb1

The column block size to be used in the blocked TSQR. n >= nb1 >= 1.

in
nb2

The block size to be used in the blocked QR output. nb2 >= 1.

inout
A

Double precision array, dimension (lda, n). On entry, the M-by-N matrix A. On exit, the upper triangular R factor and the Householder vectors V below the diagonal (compact WY representation).

in
lda

The leading dimension of the array A. lda >= max(1, m).

out
T

Double precision array, dimension (ldt, n). The upper triangular block reflectors.

in
ldt

The leading dimension of the array T. ldt >= nb2.

out
work

Double precision workspace of size (max(1, lwork)). On exit, work[0] returns the optimal lwork.

in
lwork

The dimension of the array work. If lwork = -1, then a workspace query is assumed.

out
info

  • = 0: successful exit

  • < 0: if info = -i, the i-th argument had an illegal value

Functions

void cgetsqrhrt(
    const INT           m,
    const INT           n,
    const INT           mb1,
    const INT           nb1,
    const INT           nb2,
          c64* restrict A,
    const INT           lda,
          c64* restrict T,
    const INT           ldt,
          c64* restrict work,
    const INT           lwork,
          INT*          info
);
void cgetsqrhrt(const INT m, const INT n, const INT mb1, const INT nb1, const INT nb2, c64 *restrict A, const INT lda, c64 *restrict T, const INT ldt, c64 *restrict work, const INT lwork, INT *info)#

CGETSQRHRT computes a NB2-sized column blocked QR-factorization of a complex M-by-N matrix A with M >= N,.

A = Q * R.

The routine uses internally a NB1-sized column blocked and MB1-sized row blocked TSQR-factorization and performs the reconstruction of the Householder vectors from the TSQR output.

Parameters

in
m

The number of rows of the matrix A. m >= 0.

in
n

The number of columns of the matrix A. m >= n >= 0.

in
mb1

The row block size to be used in the blocked TSQR. mb1 > n.

in
nb1

The column block size to be used in the blocked TSQR. n >= nb1 >= 1.

in
nb2

The block size to be used in the blocked QR output. nb2 >= 1.

inout
A

Single complex array, dimension (lda, n). On entry, the M-by-N matrix A. On exit, the upper triangular R factor and the Householder vectors V below the diagonal (compact WY representation).

in
lda

The leading dimension of the array A. lda >= max(1, m).

out
T

Single complex array, dimension (ldt, n). The upper triangular block reflectors.

in
ldt

The leading dimension of the array T. ldt >= nb2.

out
work

Single complex workspace of size (max(1, lwork)). On exit, work[0] returns the optimal lwork.

in
lwork

The dimension of the array work. If lwork = -1, then a workspace query is assumed.

out
info

  • = 0: successful exit

  • < 0: if info = -i, the i-th argument had an illegal value

Functions

void zgetsqrhrt(
    const INT            m,
    const INT            n,
    const INT            mb1,
    const INT            nb1,
    const INT            nb2,
          c128* restrict A,
    const INT            lda,
          c128* restrict T,
    const INT            ldt,
          c128* restrict work,
    const INT            lwork,
          INT*           info
);
void zgetsqrhrt(const INT m, const INT n, const INT mb1, const INT nb1, const INT nb2, c128 *restrict A, const INT lda, c128 *restrict T, const INT ldt, c128 *restrict work, const INT lwork, INT *info)#

ZGETSQRHRT computes a NB2-sized column blocked QR-factorization of a complex M-by-N matrix A with M >= N,.

A = Q * R.

The routine uses internally a NB1-sized column blocked and MB1-sized row blocked TSQR-factorization and performs the reconstruction of the Householder vectors from the TSQR output.

Parameters

in
m

The number of rows of the matrix A. m >= 0.

in
n

The number of columns of the matrix A. m >= n >= 0.

in
mb1

The row block size to be used in the blocked TSQR. mb1 > n.

in
nb1

The column block size to be used in the blocked TSQR. n >= nb1 >= 1.

in
nb2

The block size to be used in the blocked QR output. nb2 >= 1.

inout
A

Double complex array, dimension (lda, n). On entry, the M-by-N matrix A. On exit, the upper triangular R factor and the Householder vectors V below the diagonal (compact WY representation).

in
lda

The leading dimension of the array A. lda >= max(1, m).

out
T

Double complex array, dimension (ldt, n). The upper triangular block reflectors.

in
ldt

The leading dimension of the array T. ldt >= nb2.

out
work

Double complex workspace of size (max(1, lwork)). On exit, work[0] returns the optimal lwork.

in
lwork

The dimension of the array work. If lwork = -1, then a workspace query is assumed.

out
info

  • = 0: successful exit

  • < 0: if info = -i, the i-th argument had an illegal value