SRC/stfttr.f(3)
β¨ NAME β¨
SRC/stfttr.f β that's the file, bestie, and this whole page is about the stfttr subroutine. No cap, it's the glow-up from RFP to full format. π
π¦ SYNOPSIS π¦
Functions/Subroutines:
subroutine stfttr (transr, uplo, n, arf, a, lda, info)β STFTTR copies a triangular matrix from the rectangular full packed format (TF) to the standard full format (TR).
subroutine stfttr (transr, uplo, n, arf, a, lda, info)
STFTTR copies a triangular matrix from the rectangular full packed
format (TF) to the standard full format (TR).
π Function/Subroutine Documentation π
π subroutine stfttr
subroutine stfttr (character transr, character uplo, integer n, real,
dimension( 0: * ) arf, real, dimension( 0: lda-1, 0: * ) a, integer lda,
integer info)
STFTTR copies a triangular matrix from the rectangular full packed format (TF) to the standard full format (TR). It's giving conversion era, and honestly it ate. π«Ά
π Purpose
!>
!> STFTTR copies a triangular matrix A from rectangular full packed
!> format (TF) to standard full format (TR).
!>
So yeah, bestie: triangular matrix A, packed format in, full format out. Main character energy for a subroutine, tbh. β¨
π Parameters
TRANSR
!> TRANSR is CHARACTER*1
!> = 'N': ARF is in Normal format;
!> = 'T': ARF is in Transpose format.
!>
TRANSRβCHARACTER*1= 'N': ARF is in Normal format;= 'T': ARF is in Transpose format.
UPLO
!> UPLO is CHARACTER*1
!> = 'U': A is upper triangular;
!> = 'L': A is lower triangular.
!>
UPLOβCHARACTER*1= 'U': A is upper triangular;= 'L': A is lower triangular.
N
!> N is INTEGER
!> The order of the matrices ARF and A. N >= 0.
!>
NβINTEGER- The order of the matrices
ARFandA.N >= 0.
- The order of the matrices
ARF
!> ARF is REAL array, dimension (N*(N+1)/2).
!> On entry, the upper (if UPLO = 'U') or lower (if UPLO = 'L')
!> matrix A in RFP format. See the below for more
!> details.
!>
ARFβREAL array, dimension (N*(N+1)/2).- On entry, the upper (if
UPLO = 'U') or lower (ifUPLO = 'L') matrixAin RFP format. See the below for more details.
- On entry, the upper (if
A
!> A is REAL array, dimension (LDA,N)
!> On exit, the triangular matrix A. If UPLO = 'U', the
!> leading N-by-N upper triangular part of the array A contains
!> the upper triangular matrix, and the strictly lower
!> triangular part of A is not referenced. If UPLO = 'L', the
!> leading N-by-N lower triangular part of the array A contains
!> the lower triangular matrix, and the strictly upper
!> triangular part of A is not referenced.
!>
AβREAL array, dimension (LDA,N)- On exit, the triangular matrix
A. IfUPLO = 'U', the leadingN-by-Nupper triangular part of the arrayAcontains the upper triangular matrix, and the strictly lower triangular part ofAis not referenced. IfUPLO = 'L', the leadingN-by-Nlower triangular part of the arrayAcontains the lower triangular matrix, and the strictly upper triangular part ofAis not referenced.
- On exit, the triangular matrix
LDA
!> LDA is INTEGER
!> The leading dimension of the array A. LDA >= max(1,N).
!>
LDAβINTEGER- The leading dimension of the array
A.LDA >= max(1,N).
- The leading dimension of the array
INFO
!> INFO is INTEGER
!> = 0: successful exit
!> < 0: if INFO = -i, the i-th argument had an illegal value
!>
INFOβINTEGER= 0: successful exit< 0: if INFO = -i, the i-th argument had an illegal value
π Author
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
π§ Further Details
!>
!> 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
Definition at line 195 of file stfttr.f.
π Author
Generated automatically by Doxygen for LAPACK from the source code.
That's the whole page, bestie π βLAPACKVersion 3.12.0, pageSRC/stfttr.f(3). Byeee π«Ά
π¦ 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