laswlq#

Functions

void slaswlq(
    const INT           m,
    const INT           n,
    const INT           mb,
    const INT           nb,
          f32* restrict A,
    const INT           lda,
          f32* restrict T,
    const INT           ldt,
          f32* restrict work,
    const INT           lwork,
          INT*          info
);
void slaswlq(const INT m, const INT n, const INT mb, const INT nb, f32 *restrict A, const INT lda, f32 *restrict T, const INT ldt, f32 *restrict work, const INT lwork, INT *info)#

SLASWLQ computes a blocked Short-Wide LQ factorization of a real M-by-N matrix A for M <= N:

A = ( L 0 ) * Q,

where:

Q is a n-by-N orthogonal matrix, stored on exit in an implicit form in the elements above the diagonal of the array A and in the elements of the array T; L is a lower-triangular M-by-M matrix stored on exit in the elements on and below the diagonal of the array A. 0 is a M-by-(N-M) zero matrix, if M < N, and is not stored.

Parameters

in
m

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

in
n

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

in
mb

The row block size to be used in the blocked LQ. m >= mb >= 1.

in
nb

The column block size to be used in the blocked LQ. nb > 0.

inout
A

Double precision array, dimension (lda, n). On entry, the M-by-N matrix A. On exit, the elements on and below the diagonal contain the M-by-M lower triangular matrix L; the elements above the diagonal represent Q by the rows of blocked V.

in
lda

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

out
T

Double precision array, dimension (ldt, n * Number_of_row_blocks) where Number_of_row_blocks = CEIL((N-M)/(NB-M)). The blocked upper triangular block reflectors stored in compact form as a sequence of upper triangular blocks.

in
ldt

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

out
work

Double precision workspace array, dimension (max(1, lwork)). On exit, if info = 0, work[0] returns the minimal lwork.

in
lwork

The dimension of the array work. lwork >= 1, if min(m, n) = 0, and lwork >= mb*m, otherwise. 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 dlaswlq(
    const INT           m,
    const INT           n,
    const INT           mb,
    const INT           nb,
          f64* restrict A,
    const INT           lda,
          f64* restrict T,
    const INT           ldt,
          f64* restrict work,
    const INT           lwork,
          INT*          info
);
void dlaswlq(const INT m, const INT n, const INT mb, const INT nb, f64 *restrict A, const INT lda, f64 *restrict T, const INT ldt, f64 *restrict work, const INT lwork, INT *info)#

DLASWLQ computes a blocked Short-Wide LQ factorization of a real M-by-N matrix A for M <= N:

A = ( L 0 ) * Q,

where:

Q is a n-by-N orthogonal matrix, stored on exit in an implicit form in the elements above the diagonal of the array A and in the elements of the array T; L is a lower-triangular M-by-M matrix stored on exit in the elements on and below the diagonal of the array A. 0 is a M-by-(N-M) zero matrix, if M < N, and is not stored.

Parameters

in
m

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

in
n

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

in
mb

The row block size to be used in the blocked LQ. m >= mb >= 1.

in
nb

The column block size to be used in the blocked LQ. nb > 0.

inout
A

Double precision array, dimension (lda, n). On entry, the M-by-N matrix A. On exit, the elements on and below the diagonal contain the M-by-M lower triangular matrix L; the elements above the diagonal represent Q by the rows of blocked V.

in
lda

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

out
T

Double precision array, dimension (ldt, n * Number_of_row_blocks) where Number_of_row_blocks = CEIL((N-M)/(NB-M)). The blocked upper triangular block reflectors stored in compact form as a sequence of upper triangular blocks.

in
ldt

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

out
work

Double precision workspace array, dimension (max(1, lwork)). On exit, if info = 0, work[0] returns the minimal lwork.

in
lwork

The dimension of the array work. lwork >= 1, if min(m, n) = 0, and lwork >= mb*m, otherwise. 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 claswlq(
    const INT           m,
    const INT           n,
    const INT           mb,
    const INT           nb,
          c64* restrict A,
    const INT           lda,
          c64* restrict T,
    const INT           ldt,
          c64* restrict work,
    const INT           lwork,
          INT*          info
);
void claswlq(const INT m, const INT n, const INT mb, const INT nb, c64 *restrict A, const INT lda, c64 *restrict T, const INT ldt, c64 *restrict work, const INT lwork, INT *info)#

CLASWLQ computes a blocked Short-Wide LQ factorization of a complex M-by-N matrix A for M <= N:

A = ( L 0 ) * Q,

where:

Q is a n-by-N orthogonal matrix, stored on exit in an implicit form in the elements above the diagonal of the array A and in the elements of the array T; L is a lower-triangular M-by-M matrix stored on exit in the elements on and below the diagonal of the array A. 0 is a M-by-(N-M) zero matrix, if M < N, and is not stored.

Parameters

in
m

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

in
n

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

in
mb

The row block size to be used in the blocked LQ. m >= mb >= 1.

in
nb

The column block size to be used in the blocked LQ. nb > 0.

inout
A

Single complex array, dimension (lda, n). On entry, the M-by-N matrix A. On exit, the elements on and below the diagonal contain the M-by-M lower triangular matrix L; the elements above the diagonal represent Q by the rows of blocked V.

in
lda

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

out
T

Single complex array, dimension (ldt, n * Number_of_row_blocks) where Number_of_row_blocks = CEIL((N-M)/(NB-M)). The blocked upper triangular block reflectors stored in compact form as a sequence of upper triangular blocks.

in
ldt

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

out
work

Single complex workspace array, dimension (max(1, lwork)). On exit, if info = 0, work[0] returns the minimal lwork.

in
lwork

The dimension of the array work. lwork >= 1, if min(m, n) = 0, and lwork >= mb*m, otherwise. 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 zlaswlq(
    const INT            m,
    const INT            n,
    const INT            mb,
    const INT            nb,
          c128* restrict A,
    const INT            lda,
          c128* restrict T,
    const INT            ldt,
          c128* restrict work,
    const INT            lwork,
          INT*           info
);
void zlaswlq(const INT m, const INT n, const INT mb, const INT nb, c128 *restrict A, const INT lda, c128 *restrict T, const INT ldt, c128 *restrict work, const INT lwork, INT *info)#

ZLASWLQ computes a blocked Short-Wide LQ factorization of a complex M-by-N matrix A for M <= N:

A = ( L 0 ) * Q,

where:

Q is a n-by-N orthogonal matrix, stored on exit in an implicit form in the elements above the diagonal of the array A and in the elements of the array T; L is a lower-triangular M-by-M matrix stored on exit in the elements on and below the diagonal of the array A. 0 is a M-by-(N-M) zero matrix, if M < N, and is not stored.

Parameters

in
m

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

in
n

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

in
mb

The row block size to be used in the blocked LQ. m >= mb >= 1.

in
nb

The column block size to be used in the blocked LQ. nb > 0.

inout
A

Double complex array, dimension (lda, n). On entry, the M-by-N matrix A. On exit, the elements on and below the diagonal contain the M-by-M lower triangular matrix L; the elements above the diagonal represent Q by the rows of blocked V.

in
lda

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

out
T

Double complex array, dimension (ldt, n * Number_of_row_blocks) where Number_of_row_blocks = CEIL((N-M)/(NB-M)). The blocked upper triangular block reflectors stored in compact form as a sequence of upper triangular blocks.

in
ldt

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

out
work

Double complex workspace array, dimension (max(1, lwork)). On exit, if info = 0, work[0] returns the minimal lwork.

in
lwork

The dimension of the array work. lwork >= 1, if min(m, n) = 0, and lwork >= mb*m, otherwise. 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.