lapmt#
Functions
-
void slapmt(const INT forwrd, const INT m, const INT n, f32 *restrict X, const INT ldx, INT *restrict K)#
SLAPMT rearranges the columns of the M by N matrix X as specified by the permutation K(1),K(2),…,K(N) of the integers 1,…,N.
If FORWRD = 1 (true), forward permutation: X(*,K(J)) is moved to X(*,J) for J = 1,2,…,N.
If FORWRD = 0 (false), backward permutation: X(*,J) is moved to X(*,K(J)) for J = 1,2,…,N.
Parameters
inforwrd= 1: forward permutation. = 0: backward permutation.
inmNumber of rows of X. m >= 0.
innNumber of columns of X. n >= 0.
inoutXArray (ldx, n). On exit, the permuted matrix.
inldxLeading dimension of X. ldx >= max(1,m).
inoutKArray (n). Permutation indices (0-based in C). On exit, modified internally and then restored.
void slapmt(
const INT forwrd,
const INT m,
const INT n,
f32* restrict X,
const INT ldx,
INT* restrict K
);
Functions
-
void dlapmt(const INT forwrd, const INT m, const INT n, f64 *restrict X, const INT ldx, INT *restrict K)#
DLAPMT rearranges the columns of the M by N matrix X as specified by the permutation K(1),K(2),…,K(N) of the integers 1,…,N.
If FORWRD = 1 (true), forward permutation: X(*,K(J)) is moved to X(*,J) for J = 1,2,…,N.
If FORWRD = 0 (false), backward permutation: X(*,J) is moved to X(*,K(J)) for J = 1,2,…,N.
Parameters
inforwrd= 1: forward permutation. = 0: backward permutation.
inmNumber of rows of X. m >= 0.
innNumber of columns of X. n >= 0.
inoutXArray (ldx, n). On exit, the permuted matrix.
inldxLeading dimension of X. ldx >= max(1,m).
inoutKArray (n). Permutation indices (0-based in C). On exit, modified internally and then restored.
void dlapmt(
const INT forwrd,
const INT m,
const INT n,
f64* restrict X,
const INT ldx,
INT* restrict K
);
Functions
-
void clapmt(const INT forwrd, const INT m, const INT n, c64 *restrict X, const INT ldx, INT *restrict K)#
CLAPMT rearranges the columns of the M by N matrix X as specified by the permutation K(1),K(2),…,K(N) of the integers 1,…,N.
If FORWRD = 1 (true), forward permutation: X(*,K(J)) is moved to X(*,J) for J = 1,2,…,N.
If FORWRD = 0 (false), backward permutation: X(*,J) is moved to X(*,K(J)) for J = 1,2,…,N.
Parameters
inforwrd= 1: forward permutation. = 0: backward permutation.
inmNumber of rows of X. m >= 0.
innNumber of columns of X. n >= 0.
inoutXArray (ldx, n). On exit, the permuted matrix.
inldxLeading dimension of X. ldx >= max(1,m).
inoutKArray (n). Permutation indices (0-based in C). On exit, modified internally and then restored.
void clapmt(
const INT forwrd,
const INT m,
const INT n,
c64* restrict X,
const INT ldx,
INT* restrict K
);
Functions
-
void zlapmt(const INT forwrd, const INT m, const INT n, c128 *restrict X, const INT ldx, INT *restrict K)#
ZLAPMT rearranges the columns of the M by N matrix X as specified by the permutation K(1),K(2),…,K(N) of the integers 1,…,N.
If FORWRD = 1 (true), forward permutation: X(*,K(J)) is moved to X(*,J) for J = 1,2,…,N.
If FORWRD = 0 (false), backward permutation: X(*,J) is moved to X(*,K(J)) for J = 1,2,…,N.
Parameters
inforwrd= 1: forward permutation. = 0: backward permutation.
inmNumber of rows of X. m >= 0.
innNumber of columns of X. n >= 0.
inoutXArray (ldx, n). On exit, the permuted matrix.
inldxLeading dimension of X. ldx >= max(1,m).
inoutKArray (n). Permutation indices (0-based in C). On exit, modified internally and then restored.
void zlapmt(
const INT forwrd,
const INT m,
const INT n,
c128* restrict X,
const INT ldx,
INT* restrict K
);