gerqf#

Functions

void sgerqf(
    const INT           m,
    const INT           n,
          f32* restrict A,
    const INT           lda,
          f32* restrict tau,
          f32* restrict work,
    const INT           lwork,
          INT*          info
);
void sgerqf(const INT m, const INT n, f32 *restrict A, const INT lda, f32 *restrict tau, f32 *restrict work, const INT lwork, INT *info)#

SGERQF computes an RQ factorization of a real m by n matrix A: A = R * Q.

This is the blocked Level 3 BLAS version of the algorithm.

Parameters

in
m

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

in
n

The number of columns of A. n >= 0.

inout
A

On entry, the m-by-n matrix A. On exit, if m <= n, the upper triangle of the subarray A(0:m-1, n-m:n-1) contains the m-by-m upper triangular matrix R; the remaining elements, with TAU, represent Q.

in
lda

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

out
tau

Array of dimension min(m, n).

out
work

Workspace, dimension (max(1, lwork)). On exit, work[0] contains the optimal lwork.

in
lwork

Dimension of work. lwork >= max(1, m). For optimal performance, lwork >= m*nb. If lwork == -1, workspace query only.

out
info

  • = 0: success; < 0: -i means i-th argument was illegal.

Functions

void dgerqf(
    const INT           m,
    const INT           n,
          f64* restrict A,
    const INT           lda,
          f64* restrict tau,
          f64* restrict work,
    const INT           lwork,
          INT*          info
);
void dgerqf(const INT m, const INT n, f64 *restrict A, const INT lda, f64 *restrict tau, f64 *restrict work, const INT lwork, INT *info)#

DGERQF computes an RQ factorization of a real m by n matrix A: A = R * Q.

This is the blocked Level 3 BLAS version of the algorithm.

Parameters

in
m

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

in
n

The number of columns of A. n >= 0.

inout
A

On entry, the m-by-n matrix A. On exit, if m <= n, the upper triangle of the subarray A(0:m-1, n-m:n-1) contains the m-by-m upper triangular matrix R; the remaining elements, with TAU, represent Q.

in
lda

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

out
tau

Array of dimension min(m, n).

out
work

Workspace, dimension (max(1, lwork)). On exit, work[0] contains the optimal lwork.

in
lwork

Dimension of work. lwork >= max(1, m). For optimal performance, lwork >= m*nb. If lwork == -1, workspace query only.

out
info

  • = 0: success; < 0: -i means i-th argument was illegal.

Functions

void cgerqf(
    const INT           m,
    const INT           n,
          c64* restrict A,
    const INT           lda,
          c64* restrict tau,
          c64* restrict work,
    const INT           lwork,
          INT*          info
);
void cgerqf(const INT m, const INT n, c64 *restrict A, const INT lda, c64 *restrict tau, c64 *restrict work, const INT lwork, INT *info)#

CGERQF computes an RQ factorization of a complex m by n matrix A: A = R * Q.

This is the blocked Level 3 BLAS version of the algorithm.

Parameters

in
m

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

in
n

The number of columns of A. n >= 0.

inout
A

On entry, the m-by-n matrix A. On exit, if m <= n, the upper triangle of the subarray A(0:m-1, n-m:n-1) contains the m-by-m upper triangular matrix R; the remaining elements, with TAU, represent Q.

in
lda

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

out
tau

Array of dimension min(m, n).

out
work

Workspace, dimension (max(1, lwork)). On exit, work[0] contains the optimal lwork.

in
lwork

Dimension of work. lwork >= max(1, m). For optimal performance, lwork >= m*nb. If lwork == -1, workspace query only.

out
info

  • = 0: success; < 0: -i means i-th argument was illegal.

Functions

void zgerqf(
    const INT            m,
    const INT            n,
          c128* restrict A,
    const INT            lda,
          c128* restrict tau,
          c128* restrict work,
    const INT            lwork,
          INT*           info
);
void zgerqf(const INT m, const INT n, c128 *restrict A, const INT lda, c128 *restrict tau, c128 *restrict work, const INT lwork, INT *info)#

ZGERQF computes an RQ factorization of a complex m by n matrix A: A = R * Q.

This is the blocked Level 3 BLAS version of the algorithm.

Parameters

in
m

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

in
n

The number of columns of A. n >= 0.

inout
A

On entry, the m-by-n matrix A. On exit, if m <= n, the upper triangle of the subarray A(0:m-1, n-m:n-1) contains the m-by-m upper triangular matrix R; the remaining elements, with TAU, represent Q.

in
lda

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

out
tau

Array of dimension min(m, n).

out
work

Workspace, dimension (max(1, lwork)). On exit, work[0] contains the optimal lwork.

in
lwork

Dimension of work. lwork >= max(1, m). For optimal performance, lwork >= m*nb. If lwork == -1, workspace query only.

out
info

  • = 0: success; < 0: -i means i-th argument was illegal.

On this page

This Page