lapmt(3)
π¦ lapmt(3) β the LAPACK library-functions-manual page you didn't know you needed π¦
okay so bestie, quick vibe check: this is lapmt from the LAPACK Library Functions Manual, and she's not one function, she's a whole girl group β four subroutines that do the exact same glow-up on four different data types. think of them as the same main character in four different outfits. π
no cap.
β¨ NAME β¨
lapmt β lapmt: permute cols
that's it, that's the whole name section. short, iconic, to the point. π
πΈ SYNOPSIS πΈ
π Functions π
subroutine clapmt (forwrd, m, n, x, ldx, k)β CLAPMT performs a forward or backward permutation of the columns of a matrix.subroutine dlapmt (forwrd, m, n, x, ldx, k)β DLAPMT performs a forward or backward permutation of the columns of a matrix.subroutine slapmt (forwrd, m, n, x, ldx, k)β SLAPMT performs a forward or backward permutation of the columns of a matrix.subroutine zlapmt (forwrd, m, n, x, ldx, k)β ZLAPMT performs a forward or backward permutation of the columns of a matrix.
like, the way they all have the exact same energy but different letters in front? that's the LAPACK naming convention doing its thing and honestly it ate. π«Ά
π¦ Detailed Description π¦
ok so this heading exists and then it justβ¦ hands you straight over to the function docs. no extra lore, no secret chapter. it's giving "table of contents with commitment issues." π the real content lives in the next section, so let's go. π
π Function Documentation π
π subroutine clapmt
subroutine clapmt (logical forwrd, integer m, integer n, complex, dimension(
ldx, * ) x, integer ldx, integer, dimension( * ) k)
CLAPMT performs a forward or backward permutation of the columns of a matrix.
β¨ Purpose β¨
the whole personality of this one, straight up: 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 = .TRUE., that's a forward permutation:
X(*,K(J)) is moved X(*,J) for J = 1,2,...,N.
if FORWRD = .FALSE., that's a backward permutation:
X(*,J) is moved to X(*,K(J)) for J = 1,2,...,N.
π Parameters π
FORWRDβFORWRDisLOGICAL. set it to.TRUE.for a forward permutation, or.FALSE.for a backward permutation. that's the whole mood switch right there, bestie. π₯MβMisINTEGER, and it's the number of rows of the matrix X. constraint:M >= 0. (zero rows is valid, she's just empty and thriving. π«Ά)NβNisINTEGER, the number of columns of the matrix X. constraint:N >= 0.XβXisCOMPLEXarray, dimension(LDX,N). on entry it's the M by N matrix X; on exit, X contains the permuted matrix X. glow-up complete. β¨LDXβLDXisINTEGER, the leading dimension of the array X. constraint:LDX >= MAX(1,M). don't skip this one, it's load-bearing. πKβKisINTEGERarray, dimension(N). on entry,Kcontains the permutation vector. heads up:Kis used as internal workspace, but it gets reset to its original value on output β so she goes in looking a mess and comes out flawless, no permanent changes. π
πΈ Author πΈ
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
Definition at line 103 of file clapmt.f.
π subroutine dlapmt
subroutine dlapmt (logical forwrd, integer m, integer n, double precision,
dimension( ldx, * ) x, integer ldx, integer, dimension( * ) k)
DLAPMT performs a forward or backward permutation of the columns of a matrix.
β¨ Purpose β¨
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 = .TRUE., forward permutation:
X(*,K(J)) is moved X(*,J) for J = 1,2,...,N.
if FORWRD = .FALSE., backward permutation:
X(*,J) is moved to X(*,K(J)) for J = 1,2,...,N.
π Parameters π
FORWRDβFORWRDisLOGICAL..TRUE.= forward permutation,.FALSE.= backward permutation. same deal as her sister. π«MβMisINTEGER, the number of rows of the matrix X.M >= 0.NβNisINTEGER, the number of columns of the matrix X.N >= 0.XβXisDOUBLE PRECISIONarray, dimension(LDX,N). on entry, the M by N matrix X; on exit, X contains the permuted matrix X. yup, double the precision, double the slay. π₯LDXβLDXisINTEGER, the leading dimension of the array X, withLDX >= MAX(1,M).KβKisINTEGERarray, dimension(N). on entry it holds the permutation vector; it's used as internal workspace, but reset to its original value on output. no trauma left behind. π«Ά
πΈ Author πΈ
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
Definition at line 103 of file dlapmt.f.
π subroutine slapmt
subroutine slapmt (logical forwrd, integer m, integer n, real, dimension(
ldx, * ) x, integer ldx, integer, dimension( * ) k)
SLAPMT performs a forward or backward permutation of the columns of a matrix.
β¨ Purpose β¨
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 = .TRUE., forward permutation:
X(*,K(J)) is moved X(*,J) for J = 1,2,...,N.
if FORWRD = .FALSE., backward permutation:
X(*,J) is moved to X(*,K(J)) for J = 1,2,...,N.
π Parameters π
FORWRDβFORWRDisLOGICAL..TRUE.means forward permutation,.FALSE.means backward permutation. pick your fighter. πMβMisINTEGER, the number of rows of the matrix X.M >= 0.NβNisINTEGER, the number of columns of the matrix X.N >= 0.XβXisREALarray, dimension(LDX,N). on entry, the M by N matrix X; on exit, X contains the permuted matrix X. keepin' it real, literally. β¨LDXβLDXisINTEGER, the leading dimension of the array X, andLDX >= MAX(1,M).KβKisINTEGERarray, dimension(N). on entry, it's your permutation vector; it gets used as internal workspace but is reset to its original value on output. very "borrow your hoodie and return it washed" of her. π§
πΈ Author πΈ
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
Definition at line 103 of file slapmt.f.
β subroutine zlapmt
subroutine zlapmt (logical forwrd, integer m, integer n, complex*16,
dimension( ldx, * ) x, integer ldx, integer, dimension( * ) k)
ZLAPMT performs a forward or backward permutation of the columns of a matrix.
β¨ Purpose β¨
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 = .TRUE., forward permutation:
X(*,K(J)) is moved X(*,J) for J = 1,2,...,N.
if FORWRD = .FALSE., backward permutation:
X(*,J) is moved to X(*,K(J)) for J = 1,2,...,N.
π Parameters π
FORWRDβFORWRDisLOGICAL..TRUE.= forward permutation,.FALSE.= backward permutation. she's flexible, we love that. π«MβMisINTEGER, the number of rows of the matrix X.M >= 0.NβNisINTEGER, the number of columns of the matrix X.N >= 0.XβXisCOMPLEX*16array, dimension(LDX,N). on entry, the M by N matrix X; on exit, X contains the permuted matrix X. complex and double precision? she's overachieving and honestly we stan. πLDXβLDXisINTEGER, the leading dimension of the array X,LDX >= MAX(1,M).KβKisINTEGERarray, dimension(N). on entry,Kcontains the permutation vector; it's used as internal workspace, but reset to its original value on output. β¨
πΈ Author πΈ
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
Definition at line 103 of file zlapmt.f.
π Author π
Generated automatically by Doxygen for LAPACK from the source code.
so yeah, she wasn't hand-written by a person, a robot did her makeup. respect. π€π
and that's the whole page, bestie!! four subroutines, one job, zero notes. this was LAPACK, Version 3.12.0, and the page is dated the same β lapmt(3) saying goodbye from the Library Functions Manual. mwah π ππ¦π
π¦ where this page comes from
- arch rolling: lapack-doc 3.12.1-2 Β· custom
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms