DDTTRSV(l)
β¨ DDTTRSV β the LAPACK routine, but make it a group chat β¨
okay bestie so this is DDTTRSV, a routine from LAPACK version 2.0, and it lives in manual section l. she's a linear-algebra girlie and she's here to solve your systems for you. π
πΈ NAME πΈ
DDTTRSV β solve one of the systems of equations
L * X = B, L**T * X = B, or L**H * X = B,
no cap, that's the whole job. she solves. she slays. she leaves. β¨
π SYNOPSIS π
SUBROUTINE DDTTRSV( UPLO, TRANS, N, NRHS, DL, D, DU, B, LDB, INFO )
CHARACTER UPLO, TRANS
INTEGER INFO, LDB, N, NRHS
DOUBLE PRECISION B( LDB, * ), D( * ), DL( * ), DU( * )
not me noticing the synopsis saysDOUBLE PRECISIONwhile the ARGUMENTS section down there saysCOMPLEXforDL,D, andDUβ¦ i'm literally just the messenger bestie, i'm not touching a single character of it π
π¦ PURPOSE π¦
DDTTRSV solves one of the systems of equations
L * X = B, L**T * X = B, or L**H * X = B,
U * X = B, U**T * X = B, or U**H * X = B,
and where do those factors come from, you ask? they're the factors of the tridiagonal matrix A, straight out of the LU factorization that DDTTRF computed. so like, do the factorization first, then come here. it's giving teamwork. π«Ά
π ARGUMENTS π
buckle up, here's everyone in the cast:
UPLO(input)CHARACTER*1β tells us whether we're solving withLor withU. pick your fighter. πTRANS(input)CHARACTERβ the form of the system of equations, and here are your options:= 'N': A * X = B (No transpose)= 'T': A**T * X = B (Transpose)= 'C': A**H * X = B (Conjugate transpose)
N(input)INTEGERβ the order of the matrixA. constraint:N >= 0. (yes she can be zero, she's flexible like that π )NRHS(input)INTEGERβ the number of right hand sides, a.k.a. the number of columns of the matrixB. constraint:NRHS >= 0.DL(input)COMPLEX array, dimension (N-1)β the(n-1)multipliers that define the matrixLfrom the LU factorization ofA.D(input)COMPLEX array, dimension (N)β thendiagonal elements of the upper triangular matrixUfrom the LU factorization ofA. the main character energy of the diagonal, honestly. βDU(input)COMPLEX array, dimension (N-1)β the(n-1)elements of the first superdiagonal ofU.B(input/output)COMPLEX array, dimension (LDB,NRHS)β on entry, this is your right hand side matrixB. on exit,Bgets overwritten by the solution matrixX. so like, say bye to the original, she's gone, that's the vibe. πLDB(input)INTEGERβ the leading dimension of the arrayB. constraint:LDB >= max(1,N). do not play with her. πINFO(output)INTEGERβ the receipts:= 0: successful exit π< 0: ifINFO = -i, the i-th argument had an illegal value π
π the cute sign-off π
this page is from a modified LAPACK routine, dated 12 May 1997, and it's serving LAPACK routine (version 2.0) energy from the footer. periodt. go solve something iconic bestie, ily πβ¨π
π¦ where this page comes from
- ubuntu jammy: scalapack-doc 1.5-11
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms