geqrf#

Functions

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

SGEQRF computes a QR factorization of a real m by n matrix A: A = Q * R.

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, the elements on and above the diagonal contain the min(m,n)-by-n upper trapezoidal matrix R; the elements below the diagonal, 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, n). For optimal performance, lwork >= n*nb. If lwork == -1, workspace query only.

out
info

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

Functions

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

DGEQRF computes a QR factorization of a real m by n matrix A: A = Q * R.

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, the elements on and above the diagonal contain the min(m,n)-by-n upper trapezoidal matrix R; the elements below the diagonal, 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, n). For optimal performance, lwork >= n*nb. If lwork == -1, workspace query only.

out
info

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

Functions

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

CGEQRF computes a QR factorization of a complex m by n matrix A: A = Q * R.

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, the elements on and above the diagonal contain the min(m,n)-by-n upper trapezoidal matrix R; the elements below the diagonal, 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, n). For optimal performance, lwork >= n*nb. If lwork == -1, workspace query only.

out
info

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

Functions

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

ZGEQRF computes a QR factorization of a complex m by n matrix A: A = Q * R.

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, the elements on and above the diagonal contain the min(m,n)-by-n upper trapezoidal matrix R; the elements below the diagonal, 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, n). For optimal performance, lwork >= n*nb. If lwork == -1, workspace query only.

out
info

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

On this page

This Page