/home/abui...lasyf_rk.f(3)
π NAME π
okay bestie, this page is the /home/abui...lasyf_rk.f(3) page from the Library Functions Manual β and the NAME line is literally this source file:
/home/abuild/rpmbuild/BUILD/lapack-
static-3.12.0-build/lapack-3.12.0/SRC/clasyf_rk.f
β SYNOPSIS β
β¨ Functions/Subroutines β¨
subroutine CLASYF_RK (uplo, n, nb, kb, a, lda, e, ipiv, w, ldw, info)
CLASYF_RK computes a partial factorization of a complex symmetric indefinite matrix using bounded Bunch-Kaufman (rook) diagonal pivoting method. slay β¨
π Function/Subroutine Documentation π
subroutine CLASYF_RK (character uplo, integer n, integer nb, integer kb,
complex, dimension( lda, * ) a, integer lda, complex, dimension( * ) e,
integer, dimension( * ) ipiv, complex, dimension( ldw, * ) w, integer
ldw, integer info)
CLASYF_RK computes a partial factorization of a complex symmetric indefinite matrix using bounded Bunch-Kaufman (rook) diagonal pivoting method. itβs giving βbackend helper with main character energyβ π
π Purpose π
okay so hereβs the tea: CLASYF_RK computes a partial factorization of a complex symmetric matrix A using the bounded Bunch-Kaufman (rook) diagonal pivoting method. The partial factorization has the form:
A = ( I U12 ) ( A11 0 ) ( I 0 ) if UPLO = 'U', or:
( 0 U22 ) ( 0 D ) ( U12**T U22**T )
A = ( L11 0 ) ( D 0 ) ( L11**T L21**T ) if UPLO = 'L',
( L21 I ) ( 0 A22 ) ( 0 I )
where the order of D is at most NB. The actual order is returned in the argument KB, and is either NB or NB-1, or N if N <= NB.
CLASYF_RK is an auxiliary routine called by CSYTRF_RK. It uses blocked code (calling Level 3 BLAS) to update the submatrix A11 (if UPLO = 'U') or A22 (if UPLO = 'L'). blocked code? we love a structured queen π§
π§ Parameters π§
UPLOβUPLOisCHARACTER*1. Specifies whether the upper or lower triangular part of the symmetric matrix A is stored:= 'U': Upper triangular= 'L': Lower triangular
NβNisINTEGER. The order of the matrix A.N >= 0.NBβNBisINTEGER. The maximum number of columns of the matrix A that should be factored.NBshould be at least2to allow for 2-by-2 pivot blocks. two-by-two pivot blocks said βgive me spaceβ πKBβKBisINTEGER. The number of columns of A that were actually factored.KBis eitherNB-1orNB, orNifN <= NB.AβAisCOMPLEXarray, dimension(LDA,N). On entry, the symmetric matrix A.- If
UPLO = 'U': the leadingN-by-Nupper triangular part of A contains the upper triangular part of the matrix A, and the strictly lower triangular part of A is not referenced. - If
UPLO = 'L': the leadingN-by-Nlower triangular part of A contains the lower triangular part of the matrix A, and the strictly upper triangular part of A is not referenced.
- If
On exit, contains:
- a) ONLY diagonal elements of the symmetric block diagonal matrix D on the diagonal of A, i.e.
D(k,k) = A(k,k); (superdiagonal (or subdiagonal) elements of D are stored on exit in array E), and - b) If
UPLO = 'U': factor U in the superdiagonal part of A. IfUPLO = 'L': factor L in the subdiagonal part of A.
LDAβLDAisINTEGER. The leading dimension of the array A.LDA >= max(1,N).EβEisCOMPLEXarray, dimension(N). On exit, contains the superdiagonal (or subdiagonal) elements of the symmetric block diagonal matrix D with 1-by-1 or 2-by-2 diagonal blocks, where- If
UPLO = 'U':E(i) = D(i-1,i),i=2:N,E(1)is set to0; - If
UPLO = 'L':E(i) = D(i+1,i),i=1:N-1,E(N)is set to0.
- If
NOTE: For 1-by-1 diagonal blockD(k), where1 <= k <= N, the elementE(k)is set to0in bothUPLO = 'U'orUPLO = 'L'cases.
IPIVβIPIVisINTEGERarray, dimension(N).IPIVdescribes the permutation matrix P in the factorization of matrix A as follows. The absolute value ofIPIV(k)represents the index of row and column that were interchanged with the k-th row and column. The value ofUPLOdescribes the order in which the interchanges were applied. Also, the sign ofIPIVrepresents the block structure of the symmetric block diagonal matrix D with 1-by-1 or 2-by-2 diagonal blocks which correspond to 1 or 2 interchanges at each factorization step.
If UPLO = 'U' (in factorization order, k decreases from N to 1):
- a) A single positive entry
IPIV(k) > 0means:D(k,k)is a 1-by-1 diagonal block.- If
IPIV(k) != k, rows and columnskandIPIV(k)were interchanged in the submatrixA(1:N,N-KB+1:N); - If
IPIV(k) = k, no interchange occurred.
- b) A pair of consecutive negative entries
IPIV(k) < 0andIPIV(k-1) < 0means:D(k-1:k,k-1:k)is a 2-by-2 diagonal block.- (NOTE: negative entries in
IPIVappear ONLY in pairs). - 1) If
-IPIV(k) != k, rows and columnskand-IPIV(k)were interchanged in the matrixA(1:N,N-KB+1:N).- If
-IPIV(k) = k, no interchange occurred.
- If
- 2) If
-IPIV(k-1) != k-1, rows and columnsk-1and-IPIV(k-1)were interchanged in the submatrixA(1:N,N-KB+1:N).- If
-IPIV(k-1) = k-1, no interchange occurred.
- If
- c) In both cases a) and b) is always
ABS( IPIV(k) ) <= k. - d) NOTE: Any entry
IPIV(k)is always NONZERO on output.
If UPLO = 'L' (in factorization order, k increases from 1 to N):
- a) A single positive entry
IPIV(k) > 0means:D(k,k)is a 1-by-1 diagonal block.- If
IPIV(k) != k, rows and columnskandIPIV(k)were interchanged in the submatrixA(1:N,1:KB). - If
IPIV(k) = k, no interchange occurred.
- b) A pair of consecutive negative entries
IPIV(k) < 0andIPIV(k+1) < 0means:D(k:k+1,k:k+1)is a 2-by-2 diagonal block.- (NOTE: negative entries in
IPIVappear ONLY in pairs). - 1) If
-IPIV(k) != k, rows and columnskand-IPIV(k)were interchanged in the submatrixA(1:N,1:KB).- If
-IPIV(k) = k, no interchange occurred.
- If
- 2) If
-IPIV(k+1) != k+1, rows and columnsk-1and-IPIV(k-1)were interchanged in the submatrixA(1:N,1:KB).- If
-IPIV(k+1) = k+1, no interchange occurred.
- If
- c) In both cases a) and b) is always
ABS( IPIV(k) ) >= k. - d) NOTE: Any entry
IPIV(k)is always NONZERO on output.
WβWisCOMPLEXarray, dimension(LDW,NB).LDWβLDWisINTEGER. The leading dimension of the array W.LDW >= max(1,N).INFOβINFOisINTEGER.= 0: successful exit< 0: IfINFO = -k, the k-th argument had an illegal value> 0: IfINFO = k, the matrix A is singular, because:- If
UPLO = 'U': column k in the upper triangular part of A contains all zeros. - If
UPLO = 'L': column k in the lower triangular part of A contains all zeros.
- If
Therefore D(k,k) is exactly zero, and superdiagonal elements of column k of U (or subdiagonal elements of column k of L ) are all zeros. The factorization has been completed, but the block diagonal matrix D is exactly singular, and division by zero will occur if it is used to solve a system of equations.
NOTE:INFOonly stores the first occurrence of a singularity, any subsequent occurrence of singularity is not stored inINFOeven though the factorization always completes.
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
πΈ Contributors: πΈ
- December 2016, Igor Kozachenko, Computer Science Division, University of California, Berkeley
- September 2007, Sven Hammarling, Nicholas J. Higham, Craig Lucas, School of Mathematics, University of Manchester
Definition at line 260 of file clasyf_rk.f.
π Author π
Generated automatically by Doxygen for LAPACK from the source code.
π thatβs the whole page, bestie! this is LAPACK Version 3.12.0, page /home/abui...lasyf_rk.f(3), with contributor dates December 2016 and September 2007 β bye bestie, go slay your factorization π
β¨π«Ά
π¦ 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