TESTING/MATGEN/slarot.f(3)
π NAME π
TESTING/MATGEN/slarot.f β that's the name, bestie. Short, cryptic, iconic. π
π¦ SYNOPSIS π¦
β¨ Functions/Subroutines β¨
subroutine slarot (lrows, lleft, lright, nl, c, s, a, lda, xleft,
xright)
SLAROT
β¨ Function/Subroutine Documentation β¨
Here's the full signature in all its glory:
subroutine slarot (logical lrows, logical lleft, logical lright, integer nl,
real c, real s, real, dimension( * ) a, integer lda, real xleft, real
xright)
SLAROT
π Purpose π
Okay so SLAROT applies a Givens rotation to two adjacent rows or columns. It's built for matrices stored in some format other than GE, so it can use or modify matrix elements for which no array element is provided β one element of the first and/or last column/row gets special handling. π
One example is a symmetric matrix in SB format (bandwidth=4), for which UPLO='L'. Two adjacent rows will have this format:
row j: C> C> C> C> C> . . . .
row j+1: C> C> C> C> C> . . . .
Quick legend, because this diagram is doing a lot: '*' indicates elements for which storage is provided, '.' indicates elements for which no storage is provided but are not necessarily zero β their values are determined by symmetry. ' ' indicates elements which are necessarily zero, and have no storage provided. π«Ά
Those columns which have two '*'s can be handled by SROT. Those columns which have no '*'s can be ignored, since as long as the Givens rotations are carefully applied to preserve symmetry, their values are determined. Those columns which have one '*' have to be handled separately, by using separate variables and :
row j: C> C> C> C> C> p . . .
row j+1: q C> C> C> C> C> . . . .
The element p would have to be set correctly, then that column is rotated, setting p to its new value. The next call to SLAROT would rotate columns j and j+1, using p, and restore symmetry. The element q would start out being zero, and be made non-zero by the rotation. Later, rotations would presumably be chosen to zero q out. π
Typical Calling Sequences: rotating the i-th and (i+1)-st rows. The original's little underline situation is ------- ------- ---------, and honestly? Slay.
General dense matrix:
CALL SLAROT(.TRUE.,.FALSE.,.FALSE., N, C,S,
A(i,1),LDA, DUMMY, DUMMY)
General banded matrix in GB format:
j = MAX(1, i-KL )
NL = MIN( N, i+KU+1 ) + 1-j
CALL SLAROT( .TRUE., i-KL.GE.1, i+KU.LT.N, NL, C,S,
A(KU+i+1-j,j),LDA-1, XLEFT, XRIGHT )
[ note that i+1-j is just MIN(i,KL+1) ]
Symmetric banded matrix in SY format, bandwidth K, lower triangle only:
j = MAX(1, i-K )
NL = MIN( K+1, i ) + 1
CALL SLAROT( .TRUE., i-K.GE.1, .TRUE., NL, C,S,
A(i,j), LDA, XLEFT, XRIGHT )
Same, but upper triangle only:
NL = MIN( K+1, N-i ) + 1
CALL SLAROT( .TRUE., .TRUE., i+K.LT.N, NL, C,S,
A(i,i), LDA, XLEFT, XRIGHT )
Symmetric banded matrix in SB format, bandwidth K, lower triangle only:
[ same as for SY, except:]
. . . .
A(i+1-j,j), LDA-1, XLEFT, XRIGHT )
[ note that i+1-j is just MIN(i,K+1) ]
Same, but upper triangle only:
. . .
A(K+1,i), LDA-1, XLEFT, XRIGHT )
Rotating columns is just the transpose of rotating rows, except for GB and SB: (rotating columns i and i+1)
GB:
j = MAX(1, i-KU )
NL = MIN( N, i+KL+1 ) + 1-j
CALL SLAROT( .TRUE., i-KU.GE.1, i+KL.LT.N, NL, C,S,
A(KU+j+1-i,i),LDA-1, XTOP, XBOTTM )
[note that KU+j+1-i is just MAX(1,KU+2-i)]
SB: (upper triangle)
. . . . . .
A(K+j+1-i,i),LDA-1, XTOP, XBOTTM )
SB: (lower triangle)
. . . . . .
A(1,i),LDA-1, XTOP, XBOTTM )
Now the args, bestie β every single one, no skipping:
LROWSβ LOGICAL. If.TRUE., thenSLAROTwill rotate two rows. If.FALSE., then it will rotate two columns. Not modified.LLEFTβ LOGICAL. If.TRUE., thenXLEFTwill be used instead of the corresponding element ofAfor the first element in the second row (ifLROWS=.FALSE.) or column (ifLROWS=.TRUE.). If.FALSE., then the corresponding element ofAwill be used. Not modified.LRIGHTβ LOGICAL. If.TRUE., thenXRIGHTwill be used instead of the corresponding element ofAfor the last element in the first row (ifLROWS=.FALSE.) or column (ifLROWS=.TRUE.). If.FALSE., then the corresponding element ofAwill be used. Not modified.NLβ INTEGER. The length of the rows (ifLROWS=.TRUE.) or columns (ifLROWS=.FALSE.) to be rotated. IfXLEFTand/orXRIGHTare used, the columns/rows they are in should be included inNL, e.g., ifLLEFT = LRIGHT = .TRUE., thenNLmust be at least 2. The number of rows/columns to be rotated exclusive of those involvingXLEFTand/orXRIGHTmay not be negative, i.e.,NLminus how many ofLLEFTandLRIGHTare.TRUE.must be at least zero; if not,XERBLAwill be called. Not modified.C,Sβ REAL. They specify the Givens rotation to be applied. IfLROWSis true, then the matrix:
( c s )
(-s c )
is applied from the left; if false, then the transpose thereof is applied from the right. For a Givens rotation, C**2 + S**2 should be 1, but this is not checked. Not modified.
Aβ REAL array. The array containing the rows/columns to be rotated. The first element ofAshould be the upper left element to be rotated. Read and modified.LDAβ INTEGER. The leading dimension ofA. IfAcontains a matrix stored in GE or SY format, then this is just the leading dimension ofAas dimensioned in the calling routine. IfAcontains a matrix stored in band (GB or SB) format, then this should be one less than the leading dimension used in the calling routine. Thus, ifAwere dimensionedA(LDA,*)inSLAROT, thenA(1,j)would be thej-th element in the first of the two rows to be rotated, andA(2,j)would be thej-th in the second, regardless of how the array may be stored in the calling routine.
bestie, important caveat: [A cannot, however, actually be dimensioned thus, since for band format, the row number may exceed LDA, which is not legal FORTRAN.]
If LROWS=.TRUE., then LDA must be at least 1, otherwise it must be at least NL minus the number of .TRUE. values in XLEFT and XRIGHT. Not modified.
XLEFTβ REAL. IfLLEFTis.TRUE., thenXLEFTwill be used and modified instead ofA(2,1)(ifLROWS=.TRUE.) orA(1,2)(ifLROWS=.FALSE.). Read and modified.XRIGHTβ REAL. IfLRIGHTis.TRUE., thenXRIGHTwill be used and modified instead ofA(1,NL)(ifLROWS=.TRUE.) orA(NL,1)(ifLROWS=.FALSE.). Read and modified.
π«Ά Author π«Ά
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
π Definition π
Definition at line 224 of file slarot.f.
π§ Author π§
Generated automatically by Doxygen for LAPACK from the source code.
Mwah π that's the page! It's LAPACK, Version 3.12.0, and TESTING/MATGEN/slarot.f(3) β the footer said so, and I would never lie to you. Periodt. πβ¨
π¦ 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