PSLASSQ(l)
π PSLASSQ(l) π
okay bestie, sit down, hydrate, because we're about to talk about a LAPACK auxiliary routine β version 1.5 era, vintage, iconic β and it's lowkey one of the most useful little gremlins in the whole distributed-computing lineup. it's giving scaled sum of squares energy and honestly? we're obsessed. π«Ά
β¨ NAME β¨
PSLASSQ β she returns the values scl and smsq such that
( scl**2 )*smsq = x( 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq,
no cap, that's literally the whole job. π
πΈ SYNOPSIS πΈ
SUBROUTINE PSLASSQ( N, X, IX, JX, DESCX, INCX, SCALE, SUMSQ )
INTEGER IX, INCX, JX, N
REAL SCALE, SUMSQ
INTEGER DESCX( * )
REAL X( * )
π¦ PURPOSE π¦
PSLASSQ returns the values scl and smsq such that
where
x( i ) = sub( X ) = X( IX+(JX-1)*DESCX(M_)+(i-1)*INCX ).
the value of sumsq is assumed to be non-negative, and scl returns the value
scl = max( scale, abs( x( i ) ) ).
scale and sumsq must be supplied in SCALE and SUMSQ respectively. SCALE and SUMSQ are overwritten by scl and ssq respectively. π
the routine makes only one pass through the vector sub( X ). one. single. pass. efficient queen behavior. β¨
π Notes π
every global data object is described by an associated description vector. this vector stores the information required to establish the mapping between an object element and its corresponding process and memory location. iykyk. π§
let A be a generic term for any 2D block cyclicly distributed array. such a global array has an associated description vector DESCA. in the following comments, the character _ should be read as "of the global array". π
DTYPE_A(global) β stored inDESCA( DTYPE_ )β the descriptor type. in this case,DTYPE_A = 1.CTXT_A(global) β stored inDESCA( CTXT_ )β the BLACS context handle, indicating the BLACS process gridAis distributed over. the context itself is global, but the handle (the integer value) may vary.M_A(global) β stored inDESCA( M_ )β the number of rows in the global arrayA.N_A(global) β stored inDESCA( N_ )β the number of columns in the global arrayA.MB_A(global) β stored inDESCA( MB_ )β the blocking factor used to distribute the rows of the array.NB_A(global) β stored inDESCA( NB_ )β the blocking factor used to distribute the columns of the array.RSRC_A(global) β stored inDESCA( RSRC_ )β the process row over which the first row of the arrayAis distributed.CSRC_A(global) β stored inDESCA( CSRC_ )β the process column over which the first column of the arrayAis distributed.LLD_A(local) β stored inDESCA( LLD_ )β the leading dimension of the local array.LLD_A >= MAX(1,LOCr(M_A)).
let K be the number of rows or columns of a distributed matrix, and assume that its process grid has dimension p x q.
LOCr( K ) denotes the number of elements of K that a process would receive if K were distributed over the p processes of its process column.
similarly, LOCc( K ) denotes the number of elements of K that a process would receive if K were distributed over the q processes of its process row.
the values of LOCr() and LOCc() may be determined via a call to the ScaLAPACK tool function, NUMROC:
LOCr( M ) = NUMROC( M, MB_A, MYROW, RSRC_A, NPROW ),
LOCc( N ) = NUMROC( N, NB_A, MYCOL, CSRC_A, NPCOL ).
an upper bound for these quantities may be computed by:
LOCr( M ) <= ceil( ceil(M/MB_A)/NPROW )*MB_A
LOCc( N ) <= ceil( ceil(N/NB_A)/NPCOL )*NB_A
because vectors may be viewed as a subclass of matrices, a distributed vector is considered to be a distributed matrix. yes bestie, vectors are just matrices with main character energy. π
β οΈ the result are only available in the scope ofsub( X ), i.e. ifsub( X )is distributed along a process row, the correct results are only available in this process row of the grid. similarly, ifsub( X )is distributed along a process column, the correct results are only available in this process column of the grid. so likeβ¦ know your scope, fr fr. π
π ARGUMENTS π
Nβ (global input)INTEGERβ the length of the distributed vectorsub( X ).Xβ (input)REALβ the vector for which a scaled sum of squares is computed.x( i ) = X(IX+(JX-1)*M_X +(i-1)*INCX ), 1 <= i <= n.IXβ (global input)INTEGERβ the row index in the global arrayXindicating the first row ofsub( X ).JXβ (global input)INTEGERβ the column index in the global arrayXindicating the first column ofsub( X ).DESCXβ (global and local input)INTEGERarray of dimensionDLEN_. the array descriptor for the distributed matrixX.INCXβ (global input)INTEGERβ the global increment for the elements ofX. only two values ofINCXare supported in this version, namely1andM_X.INCXmust not be zero. π«SCALEβ (local input/local output)REALβ on entry, the valuescalein the equation above. on exit,SCALEis overwritten withscl, the scaling factor for the sum of squares.SUMSQβ (local input/local output)REALβ on entry, the valuesumsqin the equation above. on exit,SUMSQis overwritten withsmsq, the basic sum of squares from whichsclhas been factored out.
and that's the whole routine, bestie. go forth and scale those sums of squares. β¨ππ
this little legend comes to you from LAPACK version 1.5, dated 12 May 1997 β yeah she's a '97 baby and she still ate. ππ¦π
π¦ 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