SLAED2(3)
πΈ SLAED2(3) β like, the slaed2.f page, bestie π
ok so real talk, this is the manual page for slaed2.f(3) β a LAPACK library function page, and honestly? she's doing a LOT. let's get into it β¨
β¨ NAME β¨
/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/slaed2.f
like yes that's literally the whole name, it's a whole path, she's got main character energy and a very long address π
π¦ SYNOPSIS π¦
Functions/Subroutines
subroutine SLAED2 (k, n, n1, d, q, ldq, indxq, rho, z, dlambda, w, q2,
indx, indxc, indxp, coltyp, info)
SLAED2 used by SSTEDC. Merges eigenvalues and deflates secular equation. Used when the original matrix is tridiagonal.
π Function/Subroutine Documentation π
subroutine SLAED2 (integer k, integer n, integer n1, real, dimension( * ) d,
real, dimension( ldq, * ) q, integer ldq, integer, dimension( * ) indxq,
real rho, real, dimension( * ) z, real, dimension( * ) dlambda, real,
dimension( * ) w, real, dimension( * ) q2, integer, dimension( * ) indx,
integer, dimension( * ) indxc, integer, dimension( * ) indxp, integer,
dimension( * ) coltyp, integer info)
SLAED2 used by SSTEDC. Merges eigenvalues and deflates secular equation. Used when the original matrix is tridiagonal.
π Purpose:
!>!> SLAED2 merges the two sets of eigenvalues together into a single!> sorted set. Then it tries to deflate the size of the problem.!> There are two ways in which deflation can occur: when two or more!> eigenvalues are close together or if there is a tiny entry in the!> Z vector. For each such occurrence the order of the related secular!> equation problem is reduced by one.!>
so basically she's out here merging two eigenvalue sets into one sorted set, then trying to shrink the problem β deflation can happen two ways: two or more eigenvalues being close together, or a tiny entry in the Z vector. every time that happens, the order of the related secular equation problem goes down by one. slay π₯
π Parameters π
Kβ!> K is INTEGER/!> The number of non-deflated eigenvalues, and the order of the/!> related secular equation. 0 <= K <=N./!>β so like, how many eigenvalues survived the deflation, and the order of the secular equation she's working with. bounds:0 <= K <=N. π«ΆNβ!> N is INTEGER/!> The dimension of the symmetric tridiagonal matrix. N >= 0./!>β the dimension of the symmetric tridiagonal matrix,N >= 0. β¨N1β!> N1 is INTEGER/!> The location of the last eigenvalue in the leading sub-matrix./!> min(1,N) <= N1 <= N/2./!>β where the last eigenvalue sits in the leading sub-matrix. bounds:min(1,N) <= N1 <= N/2. πDβ!> D is REAL array, dimension (N)/!> On entry, D contains the eigenvalues of the two submatrices to/!> be combined./!> On exit, D contains the trailing (N-K) updated eigenvalues/!> (those which were deflated) sorted into increasing order./!>βREALarray, dimension(N). on the way in she's holding the eigenvalues of the two submatrices getting combined; on the way out she's holding the trailing(N-K)updated eigenvalues (the deflated ones, bestie) sorted into increasing order. πΈQβ!> Q is REAL array, dimension (LDQ, N)/!> On entry, Q contains the eigenvectors of two submatrices in/!> the two square blocks with corners at (1,1), (N1,N1)/!> and (N1+1, N1+1), (N,N)./!> On exit, Q contains the trailing (N-K) updated eigenvectors/!> (those which were deflated) in its last N-K columns./!>βREALarray, dimension(LDQ, N). entry: eigenvectors of two submatrices in the two square blocks with corners at(1,1),(N1,N1)and(N1+1, N1+1),(N,N). exit: the trailing(N-K)updated eigenvectors (the deflated ones) live in her lastN-Kcolumns. πLDQβ!> LDQ is INTEGER/!> The leading dimension of the array Q. LDQ >= max(1,N)./!>βINTEGER, the leading dimension of the arrayQ. must beLDQ >= max(1,N). π¦INDXQβ!> INDXQ is INTEGER array, dimension (N)/!> The permutation which separately sorts the two sub-problems/!> in D into ascending order. Note that elements in the second/!> half of this permutation must first have N1 added to their/!> values. Destroyed on exit./!>βINTEGERarray, dimension(N). the permutation that separately sorts the two sub-problems inDinto ascending order. β οΈ important note: elements in the second half of this permutation must first haveN1added to their values. Destroyed on exit. πRHOβ!> RHO is REAL/!> On entry, the off-diagonal element associated with the rank-1/!> cut which originally split the two submatrices which are now/!> being recombined./!> On exit, RHO has been modified to the value required by/!> SLAED3./!>βREAL. entry: the off-diagonal element associated with the rank-1 cut that originally split the two submatrices now being recombined. exit:RHOhas been modified to the value required bySLAED3. π₯Zβ!> Z is REAL array, dimension (N)/!> On entry, Z contains the updating vector (the last/!> row of the first sub-eigenvector matrix and the first row of/!> the second sub-eigenvector matrix)./!> On exit, the contents of Z have been destroyed by the updating/!> process./!>βREALarray, dimension(N). entry: the updating vector (last row of the first sub-eigenvector matrix + first row of the second sub-eigenvector matrix). exit: the contents ofZhave been destroyed by the updating process π she does not survive the vibe check.DLAMBDAβ!> DLAMBDA is REAL array, dimension (N)/!> A copy of the first K eigenvalues which will be used by/!> SLAED3 to form the secular equation./!>βREALarray, dimension(N). a copy of the firstKeigenvalues, whichSLAED3will use to form the secular equation. πWβ!> W is REAL array, dimension (N)/!> The first k values of the final deflation-altered z-vector/!> which will be passed to SLAED3./!>βREALarray, dimension(N). the firstkvalues of the final deflation-altered z-vector, which gets passed toSLAED3. π§Q2β!> Q2 is REAL array, dimension (N1**2+(N-N1)**2)/!> A copy of the first K eigenvectors which will be used by/!> SLAED3 in a matrix multiply (SGEMM) to solve for the new/!> eigenvectors./!>βREALarray, dimension(N1**2+(N-N1)**2). a copy of the firstKeigenvectors thatSLAED3will use in a matrix multiply (SGEMM) to solve for the new eigenvectors. β¨INDXβ!> INDX is INTEGER array, dimension (N)/!> The permutation used to sort the contents of DLAMBDA into/!> ascending order./!>βINTEGERarray, dimension(N). the permutation used to sort the contents ofDLAMBDAinto ascending order. πINDXCβ!> INDXC is INTEGER array, dimension (N)/!> The permutation used to arrange the columns of the deflated/!> Q matrix into three groups: the first group contains non-zero/!> elements only at and above N1, the second contains/!> non-zero elements only below N1, and the third is dense./!>βINTEGERarray, dimension(N). the permutation that arranges the columns of the deflatedQmatrix into three groups: group one has non-zero elements only at and aboveN1, group two has non-zero elements only belowN1, and group three is dense. πINDXPβ!> INDXP is INTEGER array, dimension (N)/!> The permutation used to place deflated values of D at the end/!> of the array. INDXP(1:K) points to the nondeflated D-values/!> and INDXP(K+1:N) points to the deflated eigenvalues./!>βINTEGERarray, dimension(N). the permutation used to place deflated values ofDat the end of the array.INDXP(1:K)points to the nondeflated D-values, andINDXP(K+1:N)points to the deflated eigenvalues. πCOLTYPβ!> COLTYP is INTEGER array, dimension (N)/!> During execution, a label which will indicate which of the/!> following types a column in the Q2 matrix is:/!> 1 : non-zero in the upper half only;/!> 2 : dense;/!> 3 : non-zero in the lower half only;/!> 4 : deflated./!> On exit, COLTYP(i) is the number of columns of type i,/!> for i=1 to 4 only./!>βINTEGERarray, dimension(N). during execution it's a label telling you which type a column in theQ2matrix is:1= non-zero in the upper half only,2= dense,3= non-zero in the lower half only,4= deflated. on exit,COLTYP(i)is the number of columns of typei, fori=1to4only. π₯INFOβ!> INFO is INTEGER/!> = 0: successful exit./!> < 0: if INFO = -i, the i-th argument had an illegal value./!>βINTEGER.= 0: successful exit, we love a win π.< 0: ifINFO = -i, the i-th argument had an illegal value. π
π Author π
Univ. of Tennessee
Univ. of California Berkeley
Univ. of Colorado Denver
NAG Ltd.
πΈ Contributors: πΈ
Jeff Rutter, Computer Science Division, University of California at Berkeley, USA
Modified by Francoise Tisseur, University of Tennessee
β Definition β
Definition at line 210 of file slaed2.f.
π« Author π«
Generated automatically by Doxygen for LAPACK from the source code.
ok that's the whole page, no cap π«Ά and for the cute sign-off: this is LAPACK, Version 3.12.0, dated /home/abui...RC/slaed2.f(3) β periodt, go merge some eigenvalues bestie π
β¨
π¦ 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