DTRTTF(3)
π DTRTTF(3) β the LAPACK manual page, but make it make sense
okay so real talk: this is a page out of the LAPACK library manual, bestie. The whole thing technically lives at a path so long it needs its own zip code, and yes we're keeping it in the NAME section because that's just how these pages roll. Buckle up π
β¨ NAME β¨
/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/dtrttf.f
like, that's the whole name. it's giving "my file path is my personality." no cap. π«Ά
πΈ SYNOPSIS πΈ
Functions/Subroutines
subroutine DTRTTF (transr, uplo, n, a, lda, arf, info)
DTRTTF copies a triangular matrix from the standard full format (TR) to the rectangular full packed format (TF). that's the whole vibe. TR β‘οΈ TF. glow-up complete. β¨
π¦ Function/Subroutine Documentation π¦
subroutine DTRTTF (character transr, character uplo, integer n, double
precision, dimension( 0: lda-1, 0: * ) a, integer lda, double precision,
dimension( 0: * ) arf, integer info)
DTRTTF copies a triangular matrix from the standard full format (TR) to the rectangular full packed format (TF). yes, it's a repackaging situation. the matrix is the same girl, she's just wearing a different outfit now π
π Purpose π
!>
!> DTRTTF copies a triangular matrix A from standard full format (TR)
!> to rectangular full packed format (TF) .
!>
π Parameters π
TRANSRβTRANSR is CHARACTER*1. the format check, iykyk:= 'N':ARF in Normal form is wanted;= 'T':ARF in Transpose form is wanted.
UPLOβUPLO is CHARACTER*1, aka which triangle are we even talking about:= 'U':Upper triangle of A is stored;= 'L':Lower triangle of A is stored.
NβN is INTEGER. the order of the matrixA.N >= 0. zero is literally valid, no drama. π₯AβA is DOUBLE PRECISION array, dimension (LDA,N). On entry, the triangular matrixA. here's the tea:- If
UPLO = 'U', the leadingN-by-Nupper triangular part of the arrayAcontains the upper triangular matrix, and the strictly lower triangular part ofAis not referenced. - If
UPLO = 'L', the leadingN-by-Nlower triangular part of the arrayAcontains the lower triangular matrix, and the strictly upper triangular part ofAis not referenced.
- If
so like, half of it is main character and the other half is literally not even invited π«Ά
LDAβLDA is INTEGER. the leading dimension of the matrixA.LDA >= max(1,N). respect the minimum, bestie. πARFβARF is DOUBLE PRECISION array, dimension (NT).NT=N*(N+1)/2. On exit, the triangular matrixAin RFP format. this is the glow-up destination β¨INFOβINFO is INTEGER:= 0:successful exitβ slay, we ate π< 0:if INFO = -i, the i-th argument had an illegal valueβ bestie, check your inputs π
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
the whole squad really showed up for this one π«Ά
π Further Details: π
heads up, the rest of this is straight up ASCII art of triangular matrices. it's iconic, it's giving graph paper realness, and honestly it's the best part. read it slow. π
!>
!> We first consider Rectangular Full Packed (RFP) Format when N is
!> even. We give an example where N = 6.
!>
!> AP is Upper AP is Lower
!>
!> 00 01 02 03 04 05 00
!> 11 12 13 14 15 10 11
!> 22 23 24 25 20 21 22
!> 33 34 35 30 31 32 33
!> 44 45 40 41 42 43 44
!> 55 50 51 52 53 54 55
!>
!>
!> Let TRANSR = 'N'. RFP holds AP as follows:
!> For UPLO = 'U' the upper trapezoid A(0:5,0:2) consists of the last
!> three columns of AP upper. The lower triangle A(4:6,0:2) consists of
!> the transpose of the first three columns of AP upper.
!> For UPLO = 'L' the lower trapezoid A(1:6,0:2) consists of the first
!> three columns of AP lower. The upper triangle A(0:2,0:2) consists of
!> the transpose of the last three columns of AP lower.
!> This covers the case N even and TRANSR = 'N'.
!>
!> RFP A RFP A
!>
!> 03 04 05 33 43 53
!> 13 14 15 00 44 54
!> 23 24 25 10 11 55
!> 33 34 35 20 21 22
!> 00 44 45 30 31 32
!> 01 11 55 40 41 42
!> 02 12 22 50 51 52
!>
!> Now let TRANSR = 'T'. RFP A in both UPLO cases is just the
!> transpose of RFP A above. One therefore gets:
!>
!>
!> RFP A RFP A
!>
!> 03 13 23 33 00 01 02 33 00 10 20 30 40 50
!> 04 14 24 34 44 11 12 43 44 11 21 31 41 51
!> 05 15 25 35 45 55 22 53 54 55 22 32 42 52
!>
!>
!> We then consider Rectangular Full Packed (RFP) Format when N is
!> odd. We give an example where N = 5.
!>
!> AP is Upper AP is Lower
!>
!> 00 01 02 03 04 00
!> 11 12 13 14 10 11
!> 22 23 24 20 21 22
!> 33 34 30 31 32 33
!> 44 40 41 42 43 44
!>
!>
!> Let TRANSR = 'N'. RFP holds AP as follows:
!> For UPLO = 'U' the upper trapezoid A(0:4,0:2) consists of the last
!> three columns of AP upper. The lower triangle A(3:4,0:1) consists of
!> the transpose of the first two columns of AP upper.
!> For UPLO = 'L' the lower trapezoid A(0:4,0:2) consists of the first
!> three columns of AP lower. The upper triangle A(0:1,1:2) consists of
!> the transpose of the last two columns of AP lower.
!> This covers the case N odd and TRANSR = 'N'.
!>
!> RFP A RFP A
!>
!> 02 03 04 00 33 43
!> 12 13 14 10 11 44
!> 22 23 24 20 21 22
!> 00 33 34 30 31 32
!> 01 11 44 40 41 42
!>
!> Now let TRANSR = 'T'. RFP A in both UPLO cases is just the
!> transpose of RFP A above. One therefore gets:
!>
!> RFP A RFP A
!>
!> 02 12 22 00 01 00 10 20 30 40 50
!> 03 13 23 33 11 33 11 21 31 41 51
!> 04 14 24 34 44 43 44 22 32 42 52
!>
Definition at line 193 of file dtrttf.f. β yes, line 193, we counted, we're obsessed π€
β Author β
Generated automatically by Doxygen for LAPACK from the source code. (a bot wrote this section and honestly? it ate. π€π )
okay and that's the whole page, bestie π«Ά one last thing for the sign-off: this is LAPACK, Version 3.12.0, and the whole thing is documented out of that dtrttf.f(3) file path up top that we are absolutely not retyping. go repack some triangles. periodt. πβ¨π
π¦ where this page comes from
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms