Back| R- |
| R11 R11 if n >= m, r = ( R11 ) m , or if n < m, r = ( r11 r12 ) n m if m <= n, r = ( 0 r12 ) m, or if m > n, r = ( R11 ) m-n n if n >= m, r = ( R11 ) m , or if n < m, r = ( r11 r12 ) n m if m <= n, r = ( 0 r12 ) m, or if m > n, r = ( R11 ) m-n n if n >= m, r = ( R11 ) m , or if n < m, r = ( r11 r12 ) n m if m <= n, r = ( 0 r12 ) m, or if m > n, r = ( R11 ) m-n n if n >= m, r = ( R11 ) m , or if n < m, r = ( r11 r12 ) n m if m <= n, r = ( 0 r12 ) m, or if m > n, r = ( R11 ) m-n n |
| R12 R12 if n >= m, r = ( r11 ) m , or if n < m, r = ( r11 R12 ) n m if m <= n, r = ( 0 R12 ) m, or if m > n, r = ( r11 ) m-n n if n >= m, r = ( r11 ) m , or if n < m, r = ( r11 R12 ) n m if m <= n, r = ( 0 R12 ) m, or if m > n, r = ( r11 ) m-n n if n >= m, r = ( r11 ) m , or if n < m, r = ( r11 R12 ) n m if m <= n, r = ( 0 R12 ) m, or if m > n, r = ( r11 ) m-n n if n >= m, r = ( r11 ) m , or if n < m, r = ( r11 R12 ) n m if m <= n, r = ( 0 R12 ) m, or if m > n, r = ( r11 ) m-n n |
| R21 R21 if m <= n, r = ( 0 r12 ) m, or if m > n, r = ( r11 ) m-n, n-m m ( R21 ) if m <= n, r = ( 0 r12 ) m, or if m > n, r = ( r11 ) m-n, n-m m ( R21 ) if m <= n, r = ( 0 r12 ) m, or if m > n, r = ( r11 ) m-n, n-m m ( R21 ) if m <= n, r = ( 0 r12 ) m, or if m > n, r = ( r11 ) m-n, n-m m ( R21 ) |
| radix radix small, i.e., converged. note : this should be at least radix*machine epsilon pivmin (input) double precision small, i.e., converged. note : this should be at least radix*machine epsilon ===================================================================== small, i.e., converged. note : this should be at least radix*machine epsilon pivmin (input) real small, i.e., converged. note : this should be at least radix*machine epsilon ===================================================================== |
| random random initialize seed for random number generator dlarnv initialize seed for random number generator slarnv |
| range range itmp1 (local input) integer starting range into a. for rows, this is the loca itmp1 (local input) integer starting range into a. for rows, this is the loca of scalapack routines. eigenvalues/vectors can be selected by specifying a range of values or a range of indices for the desire range (global input) character* = 'v': all eigenvalues in the interval [vl,vu] will be found. however, because there are many bulges, k1(ki) & k2(ki) might go past that range while later bulges (ki+1,ki+2,etc..) ar communication sometimes k1(ki)=hbl-2 & k2(ki)=hbl-1 so both the log of large is sufficiently large. this subroutine is intended to identify machines with a large exponent range, such as the crays of the values computed by pdlamch. this subroutine is needed because however, because there are many bulges, k1(ki) & k2(ki) might go past that range while later bulges (ki+1,ki+2,etc..) ar
range (global input) characte
= 'a': ("all") all eigenvalues will be found.
of scalapack routines. eigenvalues/vectors can be selected by specifying a range of values or a range of indices for the desire range (global input) character* = 'v': all eigenvalues in the interval [vl,vu] will be found. the log of large is sufficiently large. this subroutine is intended to identify machines with a large exponent range, such as the crays of the values computed by pslamch. this subroutine is needed because however, because there are many bulges, k1(ki) & k2(ki) might go past that range while later bulges (ki+1,ki+2,etc..) ar
range (global input) characte
= 'a': ("all") all eigenvalues will be found.
of scalapack routines. eigenvalues/vectors can be selected by specifying a range of values or a range of indices for the desire range (global input) character* = 'v': all eigenvalues in the interval [vl,vu] will be found. of scalapack routines. eigenvalues/vectors can be selected by specifying a range of values or a range of indices for the desire range (global input) character* = 'v': all eigenvalues in the interval [vl,vu] will be found. however, because there are many bulges, k1(ki) & k2(ki) might go past that range while later bulges (ki+1,ki+2,etc..) ar communication sometimes k1(ki)=hbl-2 & k2(ki)=hbl-1 so both itmp1 (local input) integer starting range into a. for rows, this is the loca itmp1 (local input) integer starting range into a. for rows, this is the loca |
| rank rank or its conjugate-transpose, using a qr or lq factorization of sub( a ). it is assumed that sub( a ) has full rank the following options are provided: pchengst performs the same function as pchegst, but is based on rank 2k updates, which are faster and more scalable tha which is needed, with w, to apply the transformation to the unreduced part of the matrix, using a hermitian rank-2k update of the form or its transpose, using a qr or lq factorization of sub( a ). it is assumed that sub( a ) has full rank the following options are provided: pdlaed1 computes the updated eigensystem of a diagonal matrix after modification by a rank-one symmetric matrix rho (global input/output) double precision on entry, the off-diagonal element associated with the rank- being recombined. rho (global input/output) double precision on entry, the off-diagonal element associated with the rank- being recombined. which is needed, with w, to apply the transformation to the unreduced part of the matrix, using a symmetric rank-2k update of the form pdsyngst performs the same function as pdhegst, but is based on rank 2k updates, which are faster and more scalable tha or its transpose, using a qr or lq factorization of sub( a ). it is assumed that sub( a ) has full rank the following options are provided: pslaed1 computes the updated eigensystem of a diagonal matrix after modification by a rank-one symmetric matrix rho (global input/output) real on entry, the off-diagonal element associated with the rank- being recombined. rho (global input/output) real on entry, the off-diagonal element associated with the rank- being recombined. which is needed, with w, to apply the transformation to the unreduced part of the matrix, using a symmetric rank-2k update of the form pssyngst performs the same function as pshegst, but is based on rank 2k updates, which are faster and more scalable tha or its conjugate-transpose, using a qr or lq factorization of sub( a ). it is assumed that sub( a ) has full rank the following options are provided: pzhengst performs the same function as pzhegst, but is based on rank 2k updates, which are faster and more scalable tha which is needed, with w, to apply the transformation to the unreduced part of the matrix, using a hermitian rank-2k update of the form |
| rather rather it contains the same values as bycol, but it is replicated across all processes rather than being distribute byall(i) = bycol( numroc(i,desc( nb_ ),myrow,0,nprow ) on the procs it contains the same values as byrow, but it is replicated across all processes rather than being distribute byall(i) = byrow( numroc(i,desc( mb_ ),mycol,0,npcol ) on the procs it contains the same values as bycol, but it is replicated across all processes rather than being distribute byall(i) = bycol( numroc(i,desc( nb_ ),myrow,0,nprow ) on the procs it contains the same values as byrow, but it is replicated across all processes rather than being distribute byall(i) = byrow( numroc(i,desc( mb_ ),mycol,0,npcol ) on the procs |
| ratio ratio local pieces of the m-by-n distributed matrix whose equilibration factors are to be computed ia (global input) integer rowcnd (global input) real the global ratio of the smallest r(i) to the largest r(i) scond (global input) real ratio of the smallest sr(i) (respectively sc(j)) to th and ja <= j <= ja+n-1. scond (global output) real if info = 0, scond contains the ratio of the smallest sr(i ia <= i <= ia+n-1 and ja <= j <= ja+n-1. if scond >= 0.1 local pieces of the m-by-n distributed matrix whose equilibration factors are to be computed ia (global input) integer rowcnd (global input) double precision the global ratio of the smallest r(i) to the largest r(i) scond (global input) double precision ratio of the smallest sr(i) (respectively sc(j)) to th and ja <= j <= ja+n-1. scond (global output) double precision if info = 0, scond contains the ratio of the smallest sr(i ia <= i <= ia+n-1 and ja <= j <= ja+n-1. if scond >= 0.1 local pieces of the m-by-n distributed matrix whose equilibration factors are to be computed ia (global input) integer rowcnd (global input) real the global ratio of the smallest r(i) to the largest r(i) scond (global input) real ratio of the smallest sr(i) (respectively sc(j)) to th and ja <= j <= ja+n-1. scond (global output) real if info = 0, scond contains the ratio of the smallest sr(i ia <= i <= ia+n-1 and ja <= j <= ja+n-1. if scond >= 0.1 local pieces of the m-by-n distributed matrix whose equilibration factors are to be computed ia (global input) integer rowcnd (global input) double precision the global ratio of the smallest r(i) to the largest r(i) scond (global input) double precision ratio of the smallest sr(i) (respectively sc(j)) to th and ja <= j <= ja+n-1. scond (global output) double precision if info = 0, scond contains the ratio of the smallest sr(i ia <= i <= ia+n-1 and ja <= j <= ja+n-1. if scond >= 0.1 |
| RCOND RCOND the reciprocal of the condition number is computed as RCOND = 1 / ( norm( a(ia:ia+n-1,ja:ja+n-1) ) divided by the magnitude of the largest element in sub( x ). the estimate is as reliable as the estimate for RCOND, an this array is tied to the distributed matrix x. RCOND (global output) rea a(ia:ia+n-1,ja:ja+n-1) after equilibration (if done). if the reciprocal of the condition number is computed as RCOND = 1 / ( norm( a(ia:ia+n-1,ja:ja+n-1) ) divided by the magnitude of the largest element in sub( x ). the estimate is as reliable as the estimate for RCOND, an this array is tied to the distributed matrix x. RCOND (global output) rea a after equilibration (if done). if rcond is less than the of the condition number is computed as RCOND = 1 / ( norm( a(ia:ia+n-1,ja:ja+n-1) ) largest entry in sub( x ). the estimate is as reliable as the estimate for RCOND, and is almost always a sligh this array is tied to the distributed matrix x. the reciprocal of the condition number is computed as RCOND = 1 / ( norm( a(ia:ia+n-1,ja:ja+n-1) ) divided by the magnitude of the largest element in sub( x ). the estimate is as reliable as the estimate for RCOND, an this array is tied to the distributed matrix x. RCOND (global output) double precisio a(ia:ia+n-1,ja:ja+n-1) after equilibration (if done). if the reciprocal of the condition number is computed as RCOND = 1 / ( norm( a(ia:ia+n-1,ja:ja+n-1) ) divided by the magnitude of the largest element in sub( x ). the estimate is as reliable as the estimate for RCOND, an this array is tied to the distributed matrix x. RCOND (global output) double precisio a after equilibration (if done). if rcond is less than the of the condition number is computed as RCOND = 1 / ( norm( a(ia:ia+n-1,ja:ja+n-1) ) largest entry in sub( x ). the estimate is as reliable as the estimate for RCOND, and is almost always a sligh this array is tied to the distributed matrix x. the reciprocal of the condition number is computed as RCOND = 1 / ( norm( a(ia:ia+n-1,ja:ja+n-1) ) divided by the magnitude of the largest element in sub( x ). the estimate is as reliable as the estimate for RCOND, an this array is tied to the distributed matrix x. RCOND (global output) rea a(ia:ia+n-1,ja:ja+n-1) after equilibration (if done). if the reciprocal of the condition number is computed as RCOND = 1 / ( norm( a(ia:ia+n-1,ja:ja+n-1) ) divided by the magnitude of the largest element in sub( x ). the estimate is as reliable as the estimate for RCOND, an this array is tied to the distributed matrix x. RCOND (global output) rea a after equilibration (if done). if rcond is less than the of the condition number is computed as RCOND = 1 / ( norm( a(ia:ia+n-1,ja:ja+n-1) ) largest entry in sub( x ). the estimate is as reliable as the estimate for RCOND, and is almost always a sligh this array is tied to the distributed matrix x. the reciprocal of the condition number is computed as RCOND = 1 / ( norm( a(ia:ia+n-1,ja:ja+n-1) ) divided by the magnitude of the largest element in sub( x ). the estimate is as reliable as the estimate for RCOND, an this array is tied to the distributed matrix x. RCOND (global output) double precisio a(ia:ia+n-1,ja:ja+n-1) after equilibration (if done). if the reciprocal of the condition number is computed as RCOND = 1 / ( norm( a(ia:ia+n-1,ja:ja+n-1) ) divided by the magnitude of the largest element in sub( x ). the estimate is as reliable as the estimate for RCOND, an this array is tied to the distributed matrix x. RCOND (global output) double precisio a after equilibration (if done). if rcond is less than the of the condition number is computed as RCOND = 1 / ( norm( a(ia:ia+n-1,ja:ja+n-1) ) largest entry in sub( x ). the estimate is as reliable as the estimate for RCOND, and is almost always a sligh this array is tied to the distributed matrix x. |
| reaches reaches continue for additional iterations after norm reaches continue for additional iterations after norm reaches |
| read read block (global input) logical if .true., then apply several reflectors at once and read if .false., apply the single reflector given by v2, v3, block (global input) logical if .true., then apply several reflectors at once and read if .false., apply the single reflector given by v2, v3, such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a in the following comments, the character _ should be read a block cyclicly distributed matrix. its description vector is desca: such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a sub( a ). this routine assumes that the pivoting information has already been broadcast along the process row or column same mb (or nb) block. if you want to pivot a full matrix, use such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a sub( a ). this routine assumes that the pivoting information has already been broadcast along the process row or column same mb (or nb) block. if you want to pivot a full matrix, use such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a in the following comments, the character _ should be read a block cyclicly distributed matrix. its description vector is desca: such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a sub( a ). this routine assumes that the pivoting information has already been broadcast along the process row or column same mb (or nb) block. if you want to pivot a full matrix, use such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a in the following comments, the character _ should be read a block cyclicly distributed matrix. its description vector is desca: such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a in the following comments, the character _ should be read a block cyclicly distributed matrix. its description vector is desca: such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a sub( a ). this routine assumes that the pivoting information has already been broadcast along the process row or column same mb (or nb) block. if you want to pivot a full matrix, use such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a such a global array has an associated description vector desca. in the following comments, the character _ should be read a block (global input) logical if .true., then apply several reflectors at once and read if .false., apply the single reflector given by v2, v3, block (global input) logical if .true., then apply several reflectors at once and read if .false., apply the single reflector given by v2, v3, |
| ready ready iteration of the loop works with the active submatrix in rows and columns l to i. eigenvalues i+1 to ihi have already so that the matrix splits. iteration of the loop works with the active submatrix in rows and columns l to i. eigenvalues i+1 to ihi have already so that the matrix splits. |
| real real ccombamax1 finds the element having maximum real part absolut cdbtrf computes an lu factorization of a real m-by-n band matrix s = abs( real( h( i,i-1 ) ) ) + abs( real( h( i-1,i-2 ) ) prepare to use wilkinson's shift. ulp (local input) real unchanged on exit. cs (output) real parameters of the rotation matrix. = 'l': e is the subdiagonal of l, and a = l*d*l'. (the two forms are equivalent if a is real. trans (input) character ddbtrf computes an lu factorization of a real m-by-n band matrix dlasorte sorts eigenpairs so that real eigenpairs are together an since every 2nd subdiagonal is guaranteed to be zero. d (input) real array, dimension (n factorization computed by dpttrf. d (local output) real array, dimensio the distributed diagonal elements of the bidiagonal matrix d (local output) real array, dimensio the distributed diagonal elements of the bidiagonal matrix anorm (global input) real matrix a(ia:ia+n-1,ja:ja+n-1). r (local output) real array, dimension locr(m_a scale factors for sub( a ). r is aligned with the distributed rwork (local workspace/local output) real array on exit, rwork(1) returns the minimal and optimal lrwork. ferr (local output) real array of local dimensio the estimated forward error bound for each solution vector s (global output) real array, dimension siz 1. if fact = 'e', real scaling factors are computed to equilibrat trans = 'n': diag(r)*a*diag(c) *inv(diag(c))*x = diag(r)*b pcheev computes selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix a by calling the recommended sequenc w (global output) real array, dimension (n vl (global input) real for eigenvalues. not referenced if range = 'a' or 'i'. scale (global output) real compensate for the scaling performed in this routine. vl (global input) real for eigenvalues. not referenced if range = 'a' or 'i'. scale (global output) real compensate for the scaling performed in this routine. d (local output) real array, dimension locc(ja+n-1 d(i) = a(i,i). d is tied to the distributed matrix a. d (local output) real array, dimension locc(ja+n-1 d(i) = a(i,i). d is tied to the distributed matrix a. d (local output) real array, dimension locc(ja+n-1 d(i) = a(i,i). d is tied to the distributed matrix a. d (local output) real array, dim locq(ja+n-1 d(i) = a(i,i). d is tied to the distributed matrix a. d (local output) real array, dimensio the distributed diagonal elements of the bidiagonal matrix est (global output) real zin (local input) real array the eigenvectors on input. each eigenvector resides entirely work (local workspace) real array dimension (lwork nq0 if norm = '1', 'o' or 'o', r (local input) real array, dimension locr(m_a distributed matrix a, and replicated across every process sr (local input) real array, dimension locr(m_a with the distributed matrix a, and replicated across every where alpha is a real scalar, and sub( x ) is an (n-1)-elemen x(ix,jx:jx+n-2) if incx = descx(m_). h is represented in the form pclascl multiplies the m-by-n complex distributed matrix sub( a ) denoting a(ia:ia+m-1,ja:ja+n-1) by the real scalar cto/cfrom. thi cto * a(i,j) / cfrom does not over/underflow. type specifies that smlnum (global input) real unchanged on exit. scl = max( scale, abs( real( x( i ) ) ), abs( aimag( x( i ) ) ) ) d (local output) real array, dimension locc(ja+n-1 d(i) = a(i,i). d is tied to the distributed matrix a. amax (global output) pointer to real vector sub( x ) only in the scope of sub( x ). anorm (global input) real matrix a(ia:ia+n-1,ja:ja+n-1). sr (local output) real array, dimension locr(m_a for sub( a ). sr is aligned with the distributed matrix a, ferr (local output) real array of local dimensio the estimated forward error bound for each solution vector 1. if fact = 'e', real scaling factors are computed to equilibrat diag(sr) * a * diag(sc) * inv(diag(sc)) * x = diag(sr) * b pcsrscl multiplies an n-element complex distributed vector sub( x ) by the real scalar 1/a. this is done without overflow o underflow. d (global input) real array, dimension (n rcond (global output) real matrix a(ia:ia+n-1,ja:ja+n-1), computed as rwork (local workspace) real array ferr (local output) real array of local dimensio each solution vector of sub( x ). if xtrue is the true where a(1:n, ja:ja+n-1) is an n-by-n real matrix with bandwidth bwl, bwu. stored in a(1:n,ja:ja+n-1) and af by pddbtrf. a(1:n, ja:ja+n-1) is an n-by-n real matrix with bandwidth bwl, bwu. where a(1:n, ja:ja+n-1) is an n-by-n real matrix. stored in a(1:n,ja:ja+n-1) and af by pddttrf. a(1:n, ja:ja+n-1) is an n-by-n real matrix. where a(1:n, ja:ja+n-1) is an n-by-n real matrix with bandwidth bwl, bwu. stored in a(1:n,ja:ja+n-1) and af by pdgbtrf. a(1:n, ja:ja+n-1) is an n-by-n real matrix with bandwidth bwl, bwu. pdgebd2 reduces a real general m-by-n distributed matri form b by an orthogonal transformation: q' * sub( a ) * p = b. pdgebrd reduces a real general m-by-n distributed matri form b by an orthogonal transformation: q' * sub( a ) * p = b. pdgecon estimates the reciprocal of the condition number of a general distributed real matrix a(ia:ia+n-1,ja:ja+n-1), in either the 1-nor pdgehd2 reduces a real general distributed matrix sub( a tion: q' * sub( a ) * q = h, where pdgehrd reduces a real general distributed matrix sub( a tion: q' * sub( a ) * q = h, where pdgelq2 computes a lq factorization of a real distributed m-by- pdgelqf computes a lq factorization of a real distributed m-by- pdgels solves overdetermined or underdetermined real linea or its transpose, using a qr or lq factorization of sub( a ). it is pdgeql2 computes a ql factorization of a real distributed m-by- pdgeqlf computes a ql factorization of a real distributed m-by- where tau is a real scalar, and v is a real vector with v(1:i-1) = pdgeqr2 computes a qr factorization of a real distributed m-by- pdgeqrf computes a qr factorization of a real distributed m-by- pdgerq2 computes a rq factorization of a real distributed m-by- pdgerqf computes a rq factorization of a real distributed m-by- pdgesv computes the solution to a real system of linear equation sub( a ) * x = sub( b ), pdgesvx uses the lu factorization to compute the solution to a real where taua is a real scalar, and v is a real vector wit a(ia+i:ia+n-1,ja+i-1), and taua in taua(ja+i-1). where taua is a real scalar, and v is a real vector wit a(ia+m-k+i-1,ja:ja+n-k+i-2), and taua in taua(ia+m-k+i-1). pdlabrd reduces the first nb rows and columns of a real genera or lower bidiagonal form by an orthogonal transformation q' * a * p, pdlacon estimates the 1-norm of a square, real distributed matrix a x and v are aligned with the distributed matrix a, this information real roots: use wilkinson's shift twic pdlahrd reduces the first nb columns of a real general n-by-(n-k+1 k-th subdiagonal are zero. the reduction is performed by an orthogo- pdlarfb applies a real block reflector q or its transpose q**t to from the left or the right. pdlarfg generates a real elementary reflector h of order n, suc pdlarft forms the triangular factor t of a real block reflector pdlarzb applies a real block reflector q or its transpose q**t t from the left or the right. pdlarzt forms the triangular factor t of a real block reflecto reflectors as returned by pdtzrzf. pdlascl multiplies the m-by-n real distributed matrix sub( a is done without over/underflow as long as the final result pdlatrd reduces nb rows and columns of a real symmetric distribute form by an orthogonal similarity transformation q' * sub( a ) * q, pdlatrz reduces the m-by-n ( m<=n ) real upper trapezoidal matri upper triangular form by means of orthogonal transformations. pdorg2l generates an m-by-n real distributed matrix q denotin the last n columns of a product of k elementary reflectors of order m pdorg2r generates an m-by-n real distributed matrix q denotin the first n columns of a product of k elementary reflectors of order pdorgl2 generates an m-by-n real distributed matrix q denotin the first m rows of a product of k elementary reflectors of order n pdorglq generates an m-by-n real distributed matrix q denotin the first m rows of a product of k elementary reflectors of order n pdorgql generates an m-by-n real distributed matrix q denotin the last n columns of a product of k elementary reflectors of order m pdorgqr generates an m-by-n real distributed matrix q denotin the first n columns of a product of k elementary reflectors of order pdorgr2 generates an m-by-n real distributed matrix q denotin last m rows of a product of k elementary reflectors of order n pdorgrq generates an m-by-n real distributed matrix q denotin last m rows of a product of k elementary reflectors of order n pdorm2l overwrites the general real m-by-n distributed matri pdorm2r overwrites the general real m-by-n distributed matri if vect = 'q', pdormbr overwrites the general real distributed m-by- pdormhr overwrites the general real m-by-n distributed matri pdorml2 overwrites the general real m-by-n distributed matri pdormlq overwrites the general real m-by-n distributed matri pdormql overwrites the general real m-by-n distributed matri pdormqr overwrites the general real m-by-n distributed matri pdormr2 overwrites the general real m-by-n distributed matri pdormr3 overwrites the general real m-by-n distributed matri pdormrq overwrites the general real m-by-n distributed matri pdormrz overwrites the general real m-by-n distributed matri pdormtr overwrites the general real m-by-n distributed matri where a(1:n, ja:ja+n-1) is an n-by-n real matrix with bandwidth bw. stored in a(1:n,ja:ja+n-1) and af by pdpbtrf. a(1:n, ja:ja+n-1) is an n-by-n real matrix with bandwidth bw. pdpocon estimates the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite distributed matri pdpotrf. pdposv computes the solution to a real system of linear equation sub( a ) * x = sub( b ), pdposvx uses the cholesky factorization a = u**t*u or a = l*l**t to compute the solution to a real system of linear equation a(ia:ia+n-1,ja:ja+n-1) * x = b(ib:ib+n-1,jb:jb+nrhs-1), pdpotf2 computes the cholesky factorization of a real symmetri pdpotrf computes the cholesky factorization of an n-by-n real a(ia:ia+n-1, ja:ja+n-1). pdpotri computes the inverse of a real symmetric positive definit cholesky factorization sub( a ) = u**t*u or l*l**t computed by where a(1:n, ja:ja+n-1) is an n-by-n real matrix. stored in a(1:n,ja:ja+n-1) and af by pdpttrf. a(1:n, ja:ja+n-1) is an n-by-n real matrix. pdrscl multiplies an n-element real distributed vector sub( x ) b long as the final result sub( x )/a does not overflow or underflow. pdsyev computes all eigenvalues and, optionally, eigenvectors of a real symmetric matrix a by calling the recommended sequenc pdsyevd computes all the eigenvalues and eigenvectors of a real symmetric matrix a by calling the recommended sequenc pdsyevx computes selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix a by calling the recommended sequenc specifying a range of values or a range of indices for the desired pdsygs2 reduces a real symmetric-definite generalized eigenproble pdsygst reduces a real symmetric-definite generalized eigenproble the eigenvectors of a real generalized sy-definite eigenproblem, of the for sub( b )*sub( a )*x=(lambda)*x. pdsyntrd reduces a real symmetric matrix sub( a ) to symmetri q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pdsytd2 reduces a real symmetric matrix sub( a ) to symmetri q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pdsytrd reduces a real symmetric matrix sub( a ) to symmetri q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pdtrti2 computes the inverse of a real upper or lower triangula contained in one and only one process memory space (local operation). pdtzrzf reduces the m-by-n ( m<=n ) real upper trapezoidal matri of orthogonal transformations. asum (local output) pointer to real only in its scope. where a(1:n, ja:ja+n-1) is an n-by-n real matrix with bandwidth bwl, bwu. stored in a(1:n,ja:ja+n-1) and af by psdbtrf. a(1:n, ja:ja+n-1) is an n-by-n real matrix with bandwidth bwl, bwu. where a(1:n, ja:ja+n-1) is an n-by-n real matrix. stored in a(1:n,ja:ja+n-1) and af by psdttrf. a(1:n, ja:ja+n-1) is an n-by-n real matrix. where a(1:n, ja:ja+n-1) is an n-by-n real matrix with bandwidth bwl, bwu. stored in a(1:n,ja:ja+n-1) and af by psgbtrf. a(1:n, ja:ja+n-1) is an n-by-n real matrix with bandwidth bwl, bwu. psgebd2 reduces a real general m-by-n distributed matri form b by an orthogonal transformation: q' * sub( a ) * p = b. psgebrd reduces a real general m-by-n distributed matri form b by an orthogonal transformation: q' * sub( a ) * p = b. psgecon estimates the reciprocal of the condition number of a general distributed real matrix a(ia:ia+n-1,ja:ja+n-1), in either the 1-nor a (local input) real pointer into the local memor local pieces of the m-by-n distributed matrix whose psgehd2 reduces a real general distributed matrix sub( a tion: q' * sub( a ) * q = h, where psgehrd reduces a real general distributed matrix sub( a tion: q' * sub( a ) * q = h, where psgelq2 computes a lq factorization of a real distributed m-by- psgelqf computes a lq factorization of a real distributed m-by- psgels solves overdetermined or underdetermined real linea or its transpose, using a qr or lq factorization of sub( a ). it is psgeql2 computes a ql factorization of a real distributed m-by- psgeqlf computes a ql factorization of a real distributed m-by- a (local input/local output) real pointer into th on entry, the local pieces of the m-by-n distributed matrix psgeqr2 computes a qr factorization of a real distributed m-by- psgeqrf computes a qr factorization of a real distributed m-by- a (local input) real pointer into the loca this array contains the local pieces of the distributed psgerq2 computes a rq factorization of a real distributed m-by- psgerqf computes a rq factorization of a real distributed m-by- psgesv computes the solution to a real system of linear equation sub( a ) * x = sub( b ), a (local input/workspace) block cyclic real global dimension (m, n), local dimension (mp, nq) psgesvx uses the lu factorization to compute the solution to a real a (local input/local output) real pointer into th on entry, this array contains the local pieces of the m-by-n a (local input/local output) real pointer into th on entry, this array contains the local pieces of the m-by-n a (local input/local output) real pointer into th on entry, the local pieces of the l and u obtained by the a (local input) real pointer into the loca on entry, this array contains the local pieces of the factors a (local input/local output) real pointer into th on entry, the local pieces of the n-by-m distributed matrix a (local input/local output) real pointer into th on entry, the local pieces of the m-by-n distributed matrix small (local input/local output) real on exit, if log10(large) is sufficiently large, the square pslabrd reduces the first nb rows and columns of a real genera or lower bidiagonal form by an orthogonal transformation q' * a * p, pslacon estimates the 1-norm of a square, real distributed matrix a x and v are aligned with the distributed matrix a, this information a (global input) real array, dimensio on entry, the hessenberg matrix whose tridiagonal part is a (local input) real pointer into the local memor contains the local pieces of the distributed matrix sub( a ) a (global input/output) real array, dimensio on entry, the parallel matrix to be copied into or from. a (local input) real pointer into the local memor contains the local pieces of the distributed matrix sub( a ) abstol (input) real is narrower than abstol, or than reltol times the larger (in intvl (input/output) real array, dimension (2*(kl-kf) oendpoint f the j-th interval, and intvl(2*j) is the right d (global input/output) real array, dimension (n on exit, if info = 0, the eigenvalues in descending order. d (global input/output) real array, dimension (n on exit, the eigenvalues of the repaired matrix. d (input/output) real array, dimension (n be combined. d (input/output) real array, dimension (n be combined. zin (local input) real array the eigenvectors on input. each eigenvector resides entirely real roots: use wilkinson's shift twic pslahrd reduces the first nb columns of a real general n-by-(n-k+1 k-th subdiagonal are zero. the reduction is performed by an orthogo- a (local input) real pointer into the local memor local pieces of the distributed matrix sub( a ). sigma (input) real than or equal to sigma. a (local input/local output) real pointer into th on entry, this array contains the local pieces of the a (local input/local output) real pointer into th on entry, this local array contains the local pieces of the a (local input/local output) real pointer into th containing on entry the m-by-n matrix sub( a ). on exit, a (input/output) real pointer into the loca on entry, the local pieces of the distributed symmetric bycol (local input) distributed block cyclic real arra bycol is distributed across the process rows byrow (local input) distributed block cyclic real arra byrow is distributed across the process columns pslarfb applies a real block reflector q or its transpose q**t to from the left or the right. pslarfg generates a real elementary reflector h of order n, suc pslarft forms the triangular factor t of a real block reflector pslarzb applies a real block reflector q or its transpose q**t t from the left or the right. pslarzt forms the triangular factor t of a real block reflecto reflectors as returned by pstzrzf. pslascl multiplies the m-by-n real distributed matrix sub( a is done without over/underflow as long as the final result alpha (global input) real set. alpha (global input) real set. a (global input) real array, dimensio on entry, the hessenberg matrix whose tridiagonal part is d (global input/output) real array, dimmension (n x (input) real x( i ) = x(ix+(jx-1)*m_x +(i-1)*incx ), 1 <= i <= n. a (local input/local output) real pointer into th on entry, this array contains the local pieces of the distri- a (local input) real pointer into the local memor contains the local pieces of the distributed matrix the trace pslatrd reduces nb rows and columns of a real symmetric distribute form by an orthogonal similarity transformation q' * sub( a ) * q, pslatrz reduces the m-by-n ( m<=n ) real upper trapezoidal matri upper triangular form by means of orthogonal transformations. a (local input/local output) real pointer into th on entry, the local pieces of the triangular factor l or u. a (local input/local output) real pointer into th on entry, the local pieces of the triangular factor l or u. a (global input) real array, dimensio on entry, the hessenberg matrix. psorg2l generates an m-by-n real distributed matrix q denotin the last n columns of a product of k elementary reflectors of order m psorg2r generates an m-by-n real distributed matrix q denotin the first n columns of a product of k elementary reflectors of order psorgl2 generates an m-by-n real distributed matrix q denotin the first m rows of a product of k elementary reflectors of order n psorglq generates an m-by-n real distributed matrix q denotin the first m rows of a product of k elementary reflectors of order n psorgql generates an m-by-n real distributed matrix q denotin the last n columns of a product of k elementary reflectors of order m psorgqr generates an m-by-n real distributed matrix q denotin the first n columns of a product of k elementary reflectors of order psorgr2 generates an m-by-n real distributed matrix q denotin last m rows of a product of k elementary reflectors of order n psorgrq generates an m-by-n real distributed matrix q denotin last m rows of a product of k elementary reflectors of order n psorm2l overwrites the general real m-by-n distributed matri psorm2r overwrites the general real m-by-n distributed matri if vect = 'q', psormbr overwrites the general real distributed m-by- psormhr overwrites the general real m-by-n distributed matri psorml2 overwrites the general real m-by-n distributed matri psormlq overwrites the general real m-by-n distributed matri psormql overwrites the general real m-by-n distributed matri psormqr overwrites the general real m-by-n distributed matri psormr2 overwrites the general real m-by-n distributed matri psormr3 overwrites the general real m-by-n distributed matri psormrq overwrites the general real m-by-n distributed matri psormrz overwrites the general real m-by-n distributed matri psormtr overwrites the general real m-by-n distributed matri where a(1:n, ja:ja+n-1) is an n-by-n real matrix with bandwidth bw. stored in a(1:n,ja:ja+n-1) and af by pspbtrf. a(1:n, ja:ja+n-1) is an n-by-n real matrix with bandwidth bw. pspocon estimates the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite distributed matri pspotrf. a (local input) real pointer into the local memory to a n-by-n symmetric positive definite distributed matrix a (local input) real pointer into the loca this array contains the local pieces of the n-by-n symmetric psposv computes the solution to a real system of linear equation sub( a ) * x = sub( b ), psposvx uses the cholesky factorization a = u**t*u or a = l*l**t to compute the solution to a real system of linear equation a(ia:ia+n-1,ja:ja+n-1) * x = b(ib:ib+n-1,jb:jb+nrhs-1), pspotf2 computes the cholesky factorization of a real symmetri pspotrf computes the cholesky factorization of an n-by-n real a(ia:ia+n-1, ja:ja+n-1). pspotri computes the inverse of a real symmetric positive definit cholesky factorization sub( a ) = u**t*u or l*l**t computed by a (local input) real pointer into local memory t array contains the factors l or u from the cholesky facto- where a(1:n, ja:ja+n-1) is an n-by-n real matrix. stored in a(1:n,ja:ja+n-1) and af by pspttrf. a(1:n, ja:ja+n-1) is an n-by-n real matrix. psrscl multiplies an n-element real distributed vector sub( x ) b long as the final result sub( x )/a does not overflow or underflow. vl (global input) real for eigenvalues. eigenvalues less than vl will not be d (global input/output) real array, dimension (n on exit, if info = 0, the eigenvalues in descending order. d (global input) real array, dimension (n pssyev computes all eigenvalues and, optionally, eigenvectors of a real symmetric matrix a by calling the recommended sequenc pssyevd computes all the eigenvalues and eigenvectors of a real symmetric matrix a by calling the recommended sequenc pssyevx computes selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix a by calling the recommended sequenc specifying a range of values or a range of indices for the desired pssygs2 reduces a real symmetric-definite generalized eigenproble pssygst reduces a real symmetric-definite generalized eigenproble the eigenvectors of a real generalized sy-definite eigenproblem, of the for sub( b )*sub( a )*x=(lambda)*x. a (local input/local output) real pointer into th on entry, this array contains the local pieces of the pssyntrd reduces a real symmetric matrix sub( a ) to symmetri q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pssytd2 reduces a real symmetric matrix sub( a ) to symmetri q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pssytrd reduces a real symmetric matrix sub( a ) to symmetri q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). a (local input/local output) real pointer into th on entry, this array contains the local pieces of the a (local input) real pointer into the local memor contains the local pieces of the triangular distributed a (local input) real pointer into the local memor array contains the local pieces of the original triangular pstrti2 computes the inverse of a real upper or lower triangula contained in one and only one process memory space (local operation). a (local input/local output) real pointer into th on entry, this array contains the local pieces of the a (local input) real pointer into the local memor contains the local pieces of the distributed triangular pstzrzf reduces the m-by-n ( m<=n ) real upper trapezoidal matri of orthogonal transformations. pzdrscl multiplies an n-element complex distributed vector sub( x ) by the real scalar 1/a. this is done without overflow o underflow. rwork (workspace) real array, dimension (1+4*sizeb for rwork. 1. if fact = 'e', real scaling factors are computed to equilibrat trans = 'n': diag(r)*a*diag(c) *inv(diag(c))*x = diag(r)*b pzheev computes selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix a by calling the recommended sequenc dimension (lrwork) on output rwork(1) returns the real workspace needed t rwork(1) may also be incorrect. reference: n.j. higham, "fortran codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation" where alpha is a real scalar, and sub( x ) is an (n-1)-elemen x(ix,jx:jx+n-2) if incx = descx(m_). h is represented in the form pzlascl multiplies the m-by-n complex distributed matrix sub( a ) denoting a(ia:ia+m-1,ja:ja+n-1) by the real scalar cto/cfrom. thi cto * a(i,j) / cfrom does not over/underflow. type specifies that scl = max( scale, abs( real( x( i ) ) ), abs( aimag( x( i ) ) ) ) the global index of the element of the distributed vector sub( x ) whose real part has maximum absolute value x (local input) complex*16 array containing the local 1. if fact = 'e', real scaling factors are computed to equilibrat diag(sr) * a * diag(sc) * inv(diag(sc)) * x = diag(sr) * b sdbtrf computes an lu factorization of a real m-by-n band matrix s (local input/output) real array, (lds,* referenced. it is assumed that s has jblk double shifts a (global input/output) real array, (lda,* the updated matrix on exit. slasorte sorts eigenpairs so that real eigenpairs are together an since every 2nd subdiagonal is guaranteed to be zero. d (input) real array, dimension (n factorization computed by spttrf. t - real array of dimension ( ldt, n ) upper triangular part of the array t must contain the upper zcombamax1 finds the element having maximum real part absolut zdbtrf computes an lu factorization of a real m-by-n band matrix = 'l': e is the subdiagonal of l, and a = l*d*l'. (the two forms are equivalent if a is real. trans (input) character |
| rearranged rearranged (size 2). on exit, the data is rearranged in the best order fo (size 2). on exit, the data is rearranged in the best order fo (size 2). on exit, the data is rearranged in the best order fo (size 2). on exit, the data is rearranged in the best order fo |
| reasonably reasonably work required in updating the current column of a. updating the block column of a is reasonably load balanced wherea processor column is involved). work required in updating the current column of a. updating the block column of a is reasonably load balanced wherea processor column is involved). work required in updating the current column of a. updating the block column of a is reasonably load balanced wherea processor column is involved). work required in updating the current column of a. updating the block column of a is reasonably load balanced wherea processor column is involved). |
| Receive Receive a (global input/output) complex array, (lda,*) on entry, the matrix to Receive the reflections a (global input/output) double precision array, (lda,*) on entry, the matrix to Receive the reflections locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive previously transmitted matrix section, which form the "spike" fillin. locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive modifications to processor's right hand side locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive cont. to diagonal block that is stored on this proc locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive modifications to processor's right hand side locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a
Receive triangle b_{i-1} from previous processo
locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a assume that its process grid has dimension r x c. locr( k ) denotes the number of elements of k that a process would Receive if k wer locc( k ) denotes the number of elements of k that a process would locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locp( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locq( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a more. the receiving node can be specified precisely, or all nodes can Receive, or just one row or column of nodes notes locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a everyone needs to Receive the new nbulg the first column of a send data and only processes that own the first column of b Receive data. the calls to cgebs2d/cgebr2 locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive previously transmitted matrix section, which form the "spike" fillin. locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive modifications to processor's right hand side locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive previously transmitted matrix section, which form the "spike" fillin. locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive modifications to processor's right hand side locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the r processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the r processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive previously transmitted matrix section, which form the "spike" fillin. locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive modifications to processor's right hand side locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive cont. to diagonal block that is stored on this proc locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive modifications to processor's right hand side locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a
Receive triangle b_{i-1} from previous processo
locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a assume that its process grid has dimension r x c. locr( k ) denotes the number of elements of k that a process would Receive if k wer locc( k ) denotes the number of elements of k that a process would locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a more. the receiving node can be specified precisely, or all nodes can Receive, or just one row or column of nodes notes locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a proc (iqrow, iqcol) Receive the parts of z locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a the first column of a send data and only processes that own the first column of b Receive data. the calls to dgebs2d/dgebr2 locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive previously transmitted matrix section, which form the "spike" fillin. locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive modifications to processor's right hand side locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive previously transmitted matrix section, which form the "spike" fillin. locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive modifications to processor's right hand side locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the r processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locp( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locq( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive previously transmitted matrix section, which form the "spike" fillin. locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive modifications to processor's right hand side locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive cont. to diagonal block that is stored on this proc locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive modifications to processor's right hand side locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a
Receive triangle b_{i-1} from previous processo
locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a assume that its process grid has dimension r x c. locr( k ) denotes the number of elements of k that a process would Receive if k wer locc( k ) denotes the number of elements of k that a process would locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a more. the receiving node can be specified precisely, or all nodes can Receive, or just one row or column of nodes notes locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a proc (iqrow, iqcol) Receive the parts of z locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a the first column of a send data and only processes that own the first column of b Receive data. the calls to sgebs2d/sgebr2 locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive previously transmitted matrix section, which form the "spike" fillin. locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive modifications to processor's right hand side locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive previously transmitted matrix section, which form the "spike" fillin. locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive modifications to processor's right hand side locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the r processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locp( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locq( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive previously transmitted matrix section, which form the "spike" fillin. locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive modifications to processor's right hand side locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive cont. to diagonal block that is stored on this proc locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive modifications to processor's right hand side locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a
Receive triangle b_{i-1} from previous processo
locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a assume that its process grid has dimension r x c. locr( k ) denotes the number of elements of k that a process would Receive if k wer locc( k ) denotes the number of elements of k that a process would locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locp( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locq( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a more. the receiving node can be specified precisely, or all nodes can Receive, or just one row or column of nodes notes locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a everyone needs to Receive the new nbulg the first column of a send data and only processes that own the first column of b Receive data. the calls to zgebs2d/zgebr2 locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive previously transmitted matrix section, which form the "spike" fillin. locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive modifications to processor's right hand side locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive previously transmitted matrix section, which form the "spike" fillin. locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a Receive modifications to processor's right hand side locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the r processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the r processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a locr( k ) denotes the number of elements of k that a process would Receive if k were distributed over the p processes of it similarly, locc( k ) denotes the number of elements of k that a a (global input/output) real array, (lda,*) on entry, the matrix to Receive the reflections a (global input/output) complex*16 array, (lda,*) on entry, the matrix to Receive the reflections |
| received received the values are stored, if there are any values that a node needs, they will be sent and received. then the next majo small subdiagonals. the values are stored, if there are any values that a node needs, they will be sent and received. then the next majo small subdiagonals. the values are stored, if there are any values that a node needs, they will be sent and received. then the next majo small subdiagonals. the values are stored, if there are any values that a node needs, they will be sent and received. then the next majo small subdiagonals. |
| receives receives receiving the replicated b. if ii>=0,jj>=0, then node (ii,jj) receives the dat data row or process column owns the vector operand, therefore only the
process of coordinate {rsrc_x, csrc_x} receives the result
if incx = m_x, then sub( x ) is a vector distributed over a process
receiving the replicated b. if ii>=0,jj>=0, then node (ii,jj) receives the dat data row or process column owns the vector operand, therefore only the
process of coordinate {rsrc_x, csrc_x} receives the result
if incx = m_x, then sub( x ) is a vector distributed over a process
row or process column owns the vector operand, therefore only the
process of coordinate {rsrc_x, csrc_x} receives the result
if incx = m_x, then sub( x ) is a vector distributed over a process
receiving the replicated b. if ii>=0,jj>=0, then node (ii,jj) receives the dat data receiving the replicated b. if ii>=0,jj>=0, then node (ii,jj) receives the dat data row or process column owns the vector operand, therefore only the
process of coordinate {rsrc_x, csrc_x} receives the result
if incx = m_x, then sub( x ) is a vector distributed over a process
|
| receiving receiving the distance for sending and receiving for each level start the distance for sending and receiving for each level start the distance for sending and receiving for each level start the distance for sending and receiving for each level start the entire submatrix that is copied gets placed on one node or more. the receiving node can be specified precisely, or all node the distance for sending and receiving for each level start the distance for sending and receiving for each level start the distance for sending and receiving for each level start the distance for sending and receiving for each level start the distance for sending and receiving for each level start the distance for sending and receiving for each level start the distance for sending and receiving for each level start the distance for sending and receiving for each level start the entire submatrix that is copied gets placed on one node or more. the receiving node can be specified precisely, or all node the distance for sending and receiving for each level start the distance for sending and receiving for each level start the distance for sending and receiving for each level start the distance for sending and receiving for each level start the distance for sending and receiving for each level start the distance for sending and receiving for each level start the distance for sending and receiving for each level start the distance for sending and receiving for each level start the entire submatrix that is copied gets placed on one node or more. the receiving node can be specified precisely, or all node the distance for sending and receiving for each level start the distance for sending and receiving for each level start the distance for sending and receiving for each level start the distance for sending and receiving for each level start the distance for sending and receiving for each level start the distance for sending and receiving for each level start the distance for sending and receiving for each level start the distance for sending and receiving for each level start the entire submatrix that is copied gets placed on one node or more. the receiving node can be specified precisely, or all node the distance for sending and receiving for each level start the distance for sending and receiving for each level start the distance for sending and receiving for each level start the distance for sending and receiving for each level start |
| reciprocal reciprocal pcgecon estimates the reciprocal of the condition number of a genera 1-norm or the infinity-norm, using the lu factorization computed by 3. the factored form of a is used to estimate the condition number of the matrix a. if the reciprocal of the condition number i use the level 2 pblas solve if the reciprocal of the bound o pcpocon estimates the reciprocal of the condition number (in th using the cholesky factorization a = u**h*u or a = l*l**h computed by 3. the factored form of a is used to estimate the condition number of the matrix a. if the reciprocal of the condition number i pctrcon estimates the reciprocal of the condition number of 1-norm or the infinity-norm. pdgecon estimates the reciprocal of the condition number of a genera or the infinity-norm, using the lu factorization computed by pdgetrf. 3. the factored form of a is used to estimate the condition number of the matrix a. if the reciprocal of the condition number i pdpocon estimates the reciprocal of the condition number (in th using the cholesky factorization a = u**t*u or a = l*l**t computed by 3. the factored form of a is used to estimate the condition number of the matrix a. if the reciprocal of the condition number i pdtrcon estimates the reciprocal of the condition number of 1-norm or the infinity-norm. psgecon estimates the reciprocal of the condition number of a genera or the infinity-norm, using the lu factorization computed by psgetrf. 3. the factored form of a is used to estimate the condition number of the matrix a. if the reciprocal of the condition number i pspocon estimates the reciprocal of the condition number (in th using the cholesky factorization a = u**t*u or a = l*l**t computed by 3. the factored form of a is used to estimate the condition number of the matrix a. if the reciprocal of the condition number i pstrcon estimates the reciprocal of the condition number of 1-norm or the infinity-norm. pzgecon estimates the reciprocal of the condition number of a genera 1-norm or the infinity-norm, using the lu factorization computed by 3. the factored form of a is used to estimate the condition number of the matrix a. if the reciprocal of the condition number i use the level 2 pblas solve if the reciprocal of the bound o pzpocon estimates the reciprocal of the condition number (in th using the cholesky factorization a = u**h*u or a = l*l**h computed by 3. the factored form of a is used to estimate the condition number of the matrix a. if the reciprocal of the condition number i pztrcon estimates the reciprocal of the condition number of 1-norm or the infinity-norm. |
| recombined recombined cut which originally split the two submatrices which are now being recombined pdlaed3. cut which originally split the two submatrices which are now being recombined pdlaed3. cut which originally split the two submatrices which are now being recombined pslaed3. cut which originally split the two submatrices which are now being recombined pslaed3. |
| recommended recommended pcheev computes selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix a by calling the recommended sequenc pcheevx computes selected eigenvalues and, optionally, eigenvectors of a complex hermitian matrix a by calling the recommended sequenc specifying a range of values or a range of indices for the desired pdsyev computes all eigenvalues and, optionally, eigenvectors of a real symmetric matrix a by calling the recommended sequenc pdsyevd computes all the eigenvalues and eigenvectors of a real symmetric matrix a by calling the recommended sequenc pdsyevx computes selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix a by calling the recommended sequenc specifying a range of values or a range of indices for the desired pssyev computes all eigenvalues and, optionally, eigenvectors of a real symmetric matrix a by calling the recommended sequenc pssyevd computes all the eigenvalues and eigenvectors of a real symmetric matrix a by calling the recommended sequenc pssyevx computes selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix a by calling the recommended sequenc specifying a range of values or a range of indices for the desired pzheev computes selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix a by calling the recommended sequenc pzheevx computes selected eigenvalues and, optionally, eigenvectors of a complex hermitian matrix a by calling the recommended sequenc specifying a range of values or a range of indices for the desired |
| recompile recompile point arithmetic. cure: increase the parameter "fudge", recompile point arithmetic. cure: increase the parameter "fudge", recompile |
| redefine redefine to identify machines with a large exponent range, such as the crays, and redefine the underflow and overflow limits to be the square root pdlamch does not compensate for poor arithmetic in the upper half of to identify machines with a large exponent range, such as the crays, and redefine the underflow and overflow limits to be the square root pslamch does not compensate for poor arithmetic in the upper half of |
| redistribute redistribute pclamr1d redistributes a one-dimensional row vector from one dat pdlamr1d redistributes a one-dimensional row vector from one dat pxyytevx.f and pxyytgvx.f and pxyyttrd.f are the only codes which call pjlaenv in this release. pxyytevx.f and pxyytgvx.f redistribute uses a data layout blocking factor of 1 and a pslamr1d redistributes a one-dimensional row vector from one dat pzlamr1d redistributes a one-dimensional row vector from one dat |
| redistributed redistributed n (global input) integer the number of elements to be redistributed. n >= 0 ia (global input) integer n (global input) integer the number of elements to be redistributed. n >= 0 ia (global input) integer n (global input) integer the number of elements to be redistributed. n >= 0 ia (global input) integer n (global input) integer the number of elements to be redistributed. n >= 0 ia (global input) integer |
| redistributes redistributes pclamr1d redistributes a one-dimensional row vector from one dat pdlamr1d redistributes a one-dimensional row vector from one dat pdlared1d redistributes a 1d arra it assumes that the input array, bycol, is distributed across pdlared2d redistributes a 1d arra it assumes that the input array, byrow, is distributed across pslamr1d redistributes a one-dimensional row vector from one dat pslared1d redistributes a 1d arra it assumes that the input array, bycol, is distributed across pslared2d redistributes a 1d arra it assumes that the input array, byrow, is distributed across pzlamr1d redistributes a one-dimensional row vector from one dat |
| reduce reduce m-by-n distributed matrix sub( a ) = a(ia:ia+n-1,ja:ja:ja+n-1) and reduce its condition number. r returns the row scale factors and each row and column of the distributed matrix b with elements equilibrate a distributed hermitian positive definite matrix sub( a ) = a(ia:ia+n-1,ja:ja+n-1) and reduce its condition numbe factors, s(i) = 1/sqrt(a(i,i)), chosen so that the scaled distri- m-by-n distributed matrix sub( a ) = a(ia:ia+n-1,ja:ja:ja+n-1) and reduce its condition number. r returns the row scale factors and each row and column of the distributed matrix b with elements equilibrate a distributed symmetric positive definite matrix sub( a ) = a(ia:ia+n-1,ja:ja+n-1) and reduce its condition numbe factors, s(i) = 1/sqrt(a(i,i)), chosen so that the scaled distri- matrix also. on entry, z contains the orthogonal matrix used to reduce the original matrix t m-by-n distributed matrix sub( a ) = a(ia:ia+n-1,ja:ja:ja+n-1) and reduce its condition number. r returns the row scale factors and each row and column of the distributed matrix b with elements equilibrate a distributed symmetric positive definite matrix sub( a ) = a(ia:ia+n-1,ja:ja+n-1) and reduce its condition numbe factors, s(i) = 1/sqrt(a(i,i)), chosen so that the scaled distri- matrix also. on entry, z contains the orthogonal matrix used to reduce the original matrix t m-by-n distributed matrix sub( a ) = a(ia:ia+n-1,ja:ja:ja+n-1) and reduce its condition number. r returns the row scale factors and each row and column of the distributed matrix b with elements equilibrate a distributed hermitian positive definite matrix sub( a ) = a(ia:ia+n-1,ja:ja+n-1) and reduce its condition numbe factors, s(i) = 1/sqrt(a(i,i)), chosen so that the scaled distri- |
| Reduced Reduced (nbulge > 1) and the first shift is starting in the middle of an unReduced hessenberg matrix because of two or more consecutiv (nbulge > 1) and the first shift is starting in the middle of an unReduced hessenberg matrix because of two or more consecutive smal in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its compute contribution to diagonal block(s) of Reduced system in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its *********************************************** formation and solution of Reduced syste in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its compute contribution to diagonal block(s) of Reduced system in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its *********************************************** formation and solution of Reduced syste in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its ******************************************************************* phase 2: formation and factorization of Reduced system in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its on entry, this array contains the local pieces of the n-by-n general distributed matrix sub( a ) to be Reduced. on exit overwritten with the upper hessenberg matrix h, and the ele- on entry, this array contains the local pieces of the n-by-n general distributed matrix sub( a ) to be Reduced. on exit overwritten with the upper hessenberg matrix h, and the ele- returns the matrices x and y which are needed to apply the transfor- mation to the unReduced part of sub( a ) if m >= n, sub( a ) is reduced to upper bidiagonal form; if m < n, to the offset for the reduction. elements below the k-th subdiagonal in the first nb columns are Reduced to zero nb (global input) integer q' * sub( a ) * q, and returns the matrices v and w which are needed to apply the transformation to the unReduced part of sub( a ) if uplo = 'u', pclatrd reduces the last nb rows and columns of a in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its compute contribution to diagonal block(s) of Reduced system in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its *********************************************** formation and solution of Reduced syste in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its compute contribution to diagonal block(s) of Reduced system in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its *********************************************** formation and solution of Reduced syste if vect = 'q', the number of columns in the original distributed matrix Reduced by pcgebrd distributed matrix reduced by pcgebrd. in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its compute contribution to diagonal block(s) of Reduced system in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its *********************************************** formation and solution of Reduced syste in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its compute contribution to diagonal block(s) of Reduced system in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its *********************************************** formation and solution of Reduced syste in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its ******************************************************************* phase 2: formation and factorization of Reduced system in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its on entry, this array contains the local pieces of the n-by-n general distributed matrix sub( a ) to be Reduced. on exit overwritten with the upper hessenberg matrix h, and the ele- on entry, this array contains the local pieces of the n-by-n general distributed matrix sub( a ) to be Reduced. on exit overwritten with the upper hessenberg matrix h, and the ele- and returns the matrices x and y which are needed to apply the transformation to the unReduced part of sub( a ) if m >= n, sub( a ) is reduced to upper bidiagonal form; if m < n, to the z vector. for each such occurence the dimension of the secular equation problem is Reduced by one. this stage i z vector. for each such occurrence the order of the related secular equation problem is Reduced by one arguments the offset for the reduction. elements below the k-th subdiagonal in the first nb columns are Reduced to zero nb (global input) integer and returns the matrices v and w which are needed to apply the transformation to the unReduced part of sub( a ) if uplo = 'u', pdlatrd reduces the last nb rows and columns of a if vect = 'q', the number of columns in the original distributed matrix Reduced by pdgebrd distributed matrix reduced by pdgebrd. in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its compute contribution to diagonal block(s) of Reduced system in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its *********************************************** formation and solution of Reduced syste in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its compute contribution to diagonal block(s) of Reduced system in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its *********************************************** formation and solution of Reduced syste in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its compute contribution to diagonal block(s) of Reduced system in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its *********************************************** formation and solution of Reduced syste in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its compute contribution to diagonal block(s) of Reduced system in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its *********************************************** formation and solution of Reduced syste in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its ******************************************************************* phase 2: formation and factorization of Reduced system in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its on entry, this array contains the local pieces of the n-by-n general distributed matrix sub( a ) to be Reduced. on exit overwritten with the upper hessenberg matrix h, and the ele- on entry, this array contains the local pieces of the n-by-n general distributed matrix sub( a ) to be Reduced. on exit overwritten with the upper hessenberg matrix h, and the ele- and returns the matrices x and y which are needed to apply the transformation to the unReduced part of sub( a ) if m >= n, sub( a ) is reduced to upper bidiagonal form; if m < n, to the z vector. for each such occurence the dimension of the secular equation problem is Reduced by one. this stage i z vector. for each such occurrence the order of the related secular equation problem is Reduced by one arguments the offset for the reduction. elements below the k-th subdiagonal in the first nb columns are Reduced to zero nb (global input) integer and returns the matrices v and w which are needed to apply the transformation to the unReduced part of sub( a ) if uplo = 'u', pslatrd reduces the last nb rows and columns of a if vect = 'q', the number of columns in the original distributed matrix Reduced by psgebrd distributed matrix reduced by psgebrd. in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its compute contribution to diagonal block(s) of Reduced system in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its *********************************************** formation and solution of Reduced syste in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its compute contribution to diagonal block(s) of Reduced system in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its *********************************************** formation and solution of Reduced syste in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its compute contribution to diagonal block(s) of Reduced system in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its *********************************************** formation and solution of Reduced syste in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its compute contribution to diagonal block(s) of Reduced system in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its *********************************************** formation and solution of Reduced syste in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its ******************************************************************* phase 2: formation and factorization of Reduced system in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its on entry, this array contains the local pieces of the n-by-n general distributed matrix sub( a ) to be Reduced. on exit overwritten with the upper hessenberg matrix h, and the ele- on entry, this array contains the local pieces of the n-by-n general distributed matrix sub( a ) to be Reduced. on exit overwritten with the upper hessenberg matrix h, and the ele- returns the matrices x and y which are needed to apply the transfor- mation to the unReduced part of sub( a ) if m >= n, sub( a ) is reduced to upper bidiagonal form; if m < n, to the offset for the reduction. elements below the k-th subdiagonal in the first nb columns are Reduced to zero nb (global input) integer q' * sub( a ) * q, and returns the matrices v and w which are needed to apply the transformation to the unReduced part of sub( a ) if uplo = 'u', pzlatrd reduces the last nb rows and columns of a in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its compute contribution to diagonal block(s) of Reduced system in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its *********************************************** formation and solution of Reduced syste in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its compute contribution to diagonal block(s) of Reduced system in memory. 2) Reduced system phase interaction of the larger blocks, and is stored (as are its *********************************************** formation and solution of Reduced syste if vect = 'q', the number of columns in the original distributed matrix Reduced by pzgebrd distributed matrix reduced by pzgebrd. (nbulge > 1) and the first shift is starting in the middle of an unReduced hessenberg matrix because of two or more consecutive smal (nbulge > 1) and the first shift is starting in the middle of an unReduced hessenberg matrix because of two or more consecutiv |
| reduces reduces pcgebd2 reduces a complex general m-by-n distributed matri form b by an unitary transformation: q' * sub( a ) * p = b. pcgebrd reduces a complex general m-by-n distributed matri form b by an unitary transformation: q' * sub( a ) * p = b. pcgehd2 reduces a complex general distributed matrix sub( a q' * sub( a ) * q = h, where pcgehrd reduces a complex general distributed matrix sub( a q' * sub( a ) * q = h, where pchegs2 reduces a complex hermitian-definite generalized eigenproble pchegst reduces a complex hermitian-definite generalized eigenproble pchengst reduces a complex hermitian-definite generalize pchentrd reduces a complex hermitian matrix sub( a ) to hermitia q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pchetd2 reduces a complex hermitian matrix sub( a ) to hermitia q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pchetrd reduces a complex hermitian matrix sub( a ) to hermitia q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pchettrd reduces a complex hermitian matrix sub( a ) to hermitia q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pclabrd reduces the first nb rows and columns of a complex genera or lower bidiagonal form by an unitary transformation q' * a * p, and pclahrd reduces the first nb columns of a complex genera elements below the k-th subdiagonal are zero. the reduction is pclatrd reduces nb rows and columns of a complex hermitia tridiagonal form by an unitary similarity transformation pclatrz reduces the m-by-n ( m<=n ) complex upper trapezoida to upper triangular form by means of unitary transformations. pctzrzf reduces the m-by-n ( m<=n ) complex upper trapezoidal matri of unitary transformations. pdgebd2 reduces a real general m-by-n distributed matri form b by an orthogonal transformation: q' * sub( a ) * p = b. pdgebrd reduces a real general m-by-n distributed matri form b by an orthogonal transformation: q' * sub( a ) * p = b. pdgehd2 reduces a real general distributed matrix sub( a tion: q' * sub( a ) * q = h, where pdgehrd reduces a real general distributed matrix sub( a tion: q' * sub( a ) * q = h, where pdlabrd reduces the first nb rows and columns of a real genera or lower bidiagonal form by an orthogonal transformation q' * a * p, pdlahrd reduces the first nb columns of a real general n-by-(n-k+1 k-th subdiagonal are zero. the reduction is performed by an orthogo- pdlatrd reduces nb rows and columns of a real symmetric distribute form by an orthogonal similarity transformation q' * sub( a ) * q, pdlatrz reduces the m-by-n ( m<=n ) real upper trapezoidal matri upper triangular form by means of orthogonal transformations. pdsygs2 reduces a real symmetric-definite generalized eigenproble pdsygst reduces a real symmetric-definite generalized eigenproble pdsyngst reduces a complex hermitian-definite generalize pdsyntrd reduces a real symmetric matrix sub( a ) to symmetri q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pdsytd2 reduces a real symmetric matrix sub( a ) to symmetri q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pdsytrd reduces a real symmetric matrix sub( a ) to symmetri q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pdsyttrd reduces a complex hermitian matrix sub( a ) to hermitia q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pdtzrzf reduces the m-by-n ( m<=n ) real upper trapezoidal matri of orthogonal transformations. psgebd2 reduces a real general m-by-n distributed matri form b by an orthogonal transformation: q' * sub( a ) * p = b. psgebrd reduces a real general m-by-n distributed matri form b by an orthogonal transformation: q' * sub( a ) * p = b. psgehd2 reduces a real general distributed matrix sub( a tion: q' * sub( a ) * q = h, where psgehrd reduces a real general distributed matrix sub( a tion: q' * sub( a ) * q = h, where pslabrd reduces the first nb rows and columns of a real genera or lower bidiagonal form by an orthogonal transformation q' * a * p, pslahrd reduces the first nb columns of a real general n-by-(n-k+1 k-th subdiagonal are zero. the reduction is performed by an orthogo- pslatrd reduces nb rows and columns of a real symmetric distribute form by an orthogonal similarity transformation q' * sub( a ) * q, pslatrz reduces the m-by-n ( m<=n ) real upper trapezoidal matri upper triangular form by means of orthogonal transformations. pssygs2 reduces a real symmetric-definite generalized eigenproble pssygst reduces a real symmetric-definite generalized eigenproble pssyngst reduces a complex hermitian-definite generalize pssyntrd reduces a real symmetric matrix sub( a ) to symmetri q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pssytd2 reduces a real symmetric matrix sub( a ) to symmetri q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pssytrd reduces a real symmetric matrix sub( a ) to symmetri q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pssyttrd reduces a complex hermitian matrix sub( a ) to hermitia q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pstzrzf reduces the m-by-n ( m<=n ) real upper trapezoidal matri of orthogonal transformations. pzgebd2 reduces a complex general m-by-n distributed matri form b by an unitary transformation: q' * sub( a ) * p = b. pzgebrd reduces a complex general m-by-n distributed matri form b by an unitary transformation: q' * sub( a ) * p = b. pzgehd2 reduces a complex general distributed matrix sub( a q' * sub( a ) * q = h, where pzgehrd reduces a complex general distributed matrix sub( a q' * sub( a ) * q = h, where pzhegs2 reduces a complex hermitian-definite generalized eigenproble pzhegst reduces a complex hermitian-definite generalized eigenproble pzhengst reduces a complex hermitian-definite generalize pzhentrd reduces a complex hermitian matrix sub( a ) to hermitia q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pzhetd2 reduces a complex hermitian matrix sub( a ) to hermitia q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pzhetrd reduces a complex hermitian matrix sub( a ) to hermitia q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pzhettrd reduces a complex hermitian matrix sub( a ) to hermitia q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pzlabrd reduces the first nb rows and columns of a complex genera or lower bidiagonal form by an unitary transformation q' * a * p, and pzlahrd reduces the first nb columns of a complex genera elements below the k-th subdiagonal are zero. the reduction is pzlatrd reduces nb rows and columns of a complex hermitia tridiagonal form by an unitary similarity transformation pzlatrz reduces the m-by-n ( m<=n ) complex upper trapezoida to upper triangular form by means of unitary transformations. pztzrzf reduces the m-by-n ( m<=n ) complex upper trapezoidal matri of unitary transformations. |
| reducing reducing where norm(t) is the 1-norm of the tridiagonal matrix obtained by reducing a to tridiagonal form eigenvalues will be computed most accurately when abstol is where norm(t) is the 1-norm of the tridiagonal matrix obtained by reducing a to tridiagonal form eigenvalues will be computed most accurately when abstol is here q and p**h are the unitary distributed matrices determined by pcgebrd when reducing a complex distributed matrix a(ia:*,ja:*) t as products of elementary reflectors h(i) and g(i) respectively. here q and p**t are the orthogonal distributed matrices determined by pdgebrd when reducing a real distributed matrix a(ia:*,ja:*) t as products of elementary reflectors h(i) and g(i) respectively. where norm(t) is the 1-norm of the tridiagonal matrix obtained by reducing a to tridiagonal form eigenvalues will be computed most accurately when abstol is where norm(t) is the 1-norm of the tridiagonal matrix obtained by reducing a to tridiagonal form eigenvalues will be computed most accurately when abstol is here q and p**t are the orthogonal distributed matrices determined by psgebrd when reducing a real distributed matrix a(ia:*,ja:*) t as products of elementary reflectors h(i) and g(i) respectively. where norm(t) is the 1-norm of the tridiagonal matrix obtained by reducing a to tridiagonal form eigenvalues will be computed most accurately when abstol is where norm(t) is the 1-norm of the tridiagonal matrix obtained by reducing a to tridiagonal form eigenvalues will be computed most accurately when abstol is where norm(t) is the 1-norm of the tridiagonal matrix obtained by reducing a to tridiagonal form eigenvalues will be computed most accurately when abstol is where norm(t) is the 1-norm of the tridiagonal matrix obtained by reducing a to tridiagonal form eigenvalues will be computed most accurately when abstol is here q and p**h are the unitary distributed matrices determined by pzgebrd when reducing a complex distributed matrix a(ia:*,ja:*) t as products of elementary reflectors h(i) and g(i) respectively. |
| reduction reduction interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure n-by-(n-k+1) distributed matrix a(ia:ia+n-1,ja:ja+n-k) so that elements below the k-th subdiagonal are zero. the reduction i routine returns the matrices v and t which determine q as a block pclamr1d has not been tested except withint the contect of pcheptrd, the prototype reduction to tridiagonal form code purpose interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure distributed matrix a(ia:ia+n-1,ja:ja+n-k) so that elements below the k-th subdiagonal are zero. the reduction is performed by an orthogo matrices v and t which determine q as a block reflector i - v*t*v', pdlamr1d has not been tested except withint the contect of pdsyptrd, the prototype reduction to tridiagonal form code purpose interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure distributed matrix a(ia:ia+n-1,ja:ja+n-k) so that elements below the k-th subdiagonal are zero. the reduction is performed by an orthogo matrices v and t which determine q as a block reflector i - v*t*v', pslamr1d has not been tested except withint the contect of pssyptrd, the prototype reduction to tridiagonal form code purpose interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure n-by-(n-k+1) distributed matrix a(ia:ia+n-1,ja:ja+n-k) so that elements below the k-th subdiagonal are zero. the reduction i routine returns the matrices v and t which determine q as a block pzlamr1d has not been tested except withint the contect of pzheptrd, the prototype reduction to tridiagonal form code purpose interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure interaction of the larger blocks, and is stored (as are its factors) in the space af. a parallel block cyclic reduction followed by an analagous backsolve, both using the structure |
| refer refer if jobu = 'v', u contains the first min(m,n) columns of u if jobu = 'n', u is not referenced iu (global input) integer if jobu = 'v', u contains the first min(m,n) columns of u if jobu = 'n', u is not referenced iu (global input) integer if jobu = 'v', u contains the first min(m,n) columns of u if jobu = 'n', u is not referenced iu (global input) integer if jobu = 'v', u contains the first min(m,n) columns of u if jobu = 'n', u is not referenced iu (global input) integer |
| refered refered in the following code, the row sums created by --- rows below are refered to as rowsums, and the column sums shown by | are refere in the following code, the row sums created by --- rows below are refered to as rowsums, and the column sums shown by | are refere in the following code, the row sums created by --- rows below are refered to as rowsums, and the column sums shown by | are refere in the following code, the row sums created by --- rows below are refered to as rowsums, and the column sums shown by | are refere in the following code, the row sums created by --- rows below are refered to as rowsums, and the column sums shown by | are refere in the following code, the row sums created by --- rows below are refered to as rowsums, and the column sums shown by | are refere |
| Reference Reference submatrix Reference alignment restriction that prevents unnecessary communication. submatrix Reference alignment restriction that prevents unnecessary communication. part of global vector storing the lower diagonal of the matrix. globally, dl(1) is not Referenced, and dl must b must be of size >= desca( nb_ ). part of global vector storing the lower diagonal of the matrix. globally, dl(1) is not Referenced, and dl must b must be of size >= desca( nb_ ). submatrix Reference alignment restriction that prevents unnecessary communication. submatrix Reference alignment restriction that prevents unnecessary communication. Reference: f. tisseur and j. dongarra, "a parallel divide an on distributed memory architectures", Reference: n.j. higham, "fortran codes for estimating the one-norm o acm trans. math. soft., vol. 14, no. 4, pp. 381-396, december 1988. submatrix Reference alignment restriction that prevents unnecessary communication. submatrix Reference alignment restriction that prevents unnecessary communication. part of global vector storing the upper diagonal of the matrix. globally, du(n) is not Referenced, and du must b on exit, this array contains information containing the part of global vector storing the upper diagonal of the matrix. globally, du(n) is not Referenced, and du must b on exit, this array contains information containing the submatrix Reference alignment restriction that prevents unnecessary communication. submatrix Reference alignment restriction that prevents unnecessary communication. part of global vector storing the lower diagonal of the matrix. globally, dl(1) is not Referenced, and dl must b must be of size >= desca( nb_ ). part of global vector storing the lower diagonal of the matrix. globally, dl(1) is not Referenced, and dl must b must be of size >= desca( nb_ ). submatrix Reference alignment restriction that prevents unnecessary communication. submatrix Reference alignment restriction that prevents unnecessary communication. Reference: n.j. higham, "fortran codes for estimating the one-norm o acm trans. math. soft., vol. 14, no. 4, pp. 381-396, december 1988. submatrix Reference alignment restriction that prevents unnecessary communication. submatrix Reference alignment restriction that prevents unnecessary communication. part of global vector storing the upper diagonal of the matrix. globally, du(n) is not Referenced, and du must b on exit, this array contains information containing the part of global vector storing the upper diagonal of the matrix. globally, du(n) is not Referenced, and du must b on exit, this array contains information containing the Reference: f. tisseur and j. dongarra, "a parallel divide an on distributed memory architectures", Reference: f. tisseur and j. dongarra, "a parallel divide an on distributed memory architectures", submatrix Reference alignment restriction that prevents unnecessary communication. submatrix Reference alignment restriction that prevents unnecessary communication. part of global vector storing the lower diagonal of the matrix. globally, dl(1) is not Referenced, and dl must b must be of size >= desca( nb_ ). part of global vector storing the lower diagonal of the matrix. globally, dl(1) is not Referenced, and dl must b must be of size >= desca( nb_ ). submatrix Reference alignment restriction that prevents unnecessary communication. submatrix Reference alignment restriction that prevents unnecessary communication. Reference: n.j. higham, "fortran codes for estimating the one-norm o acm trans. math. soft., vol. 14, no. 4, pp. 381-396, december 1988. submatrix Reference alignment restriction that prevents unnecessary communication. submatrix Reference alignment restriction that prevents unnecessary communication. part of global vector storing the upper diagonal of the matrix. globally, du(n) is not Referenced, and du must b on exit, this array contains information containing the part of global vector storing the upper diagonal of the matrix. globally, du(n) is not Referenced, and du must b on exit, this array contains information containing the Reference: f. tisseur and j. dongarra, "a parallel divide an on distributed memory architectures", Reference: f. tisseur and j. dongarra, "a parallel divide an on distributed memory architectures", submatrix Reference alignment restriction that prevents unnecessary communication. submatrix Reference alignment restriction that prevents unnecessary communication. part of global vector storing the lower diagonal of the matrix. globally, dl(1) is not Referenced, and dl must b must be of size >= desca( nb_ ). part of global vector storing the lower diagonal of the matrix. globally, dl(1) is not Referenced, and dl must b must be of size >= desca( nb_ ). submatrix Reference alignment restriction that prevents unnecessary communication. submatrix Reference alignment restriction that prevents unnecessary communication. Reference: f. tisseur and j. dongarra, "a parallel divide an on distributed memory architectures", Reference: n.j. higham, "fortran codes for estimating the one-norm o acm trans. math. soft., vol. 14, no. 4, pp. 381-396, december 1988. submatrix Reference alignment restriction that prevents unnecessary communication. submatrix Reference alignment restriction that prevents unnecessary communication. part of global vector storing the upper diagonal of the matrix. globally, du(n) is not Referenced, and du must b on exit, this array contains information containing the part of global vector storing the upper diagonal of the matrix. globally, du(n) is not Referenced, and du must b on exit, this array contains information containing the |
| referenced referenced on entry, the matrix of shifts. only the 2x2 diagonal of s is referenced. it is assumed that s has jblk double shift on exit, the data is rearranged in the best order for triangular matrix and the strictly lower triangular part of t is not referenced lower triangular part of the array t must contain the lower on entry, the matrix of shifts. only the 2x2 diagonal of s is referenced. it is assumed that s has jblk double shift on exit, the data is rearranged in the best order for triangular matrix and the strictly lower triangular part of t is not referenced lower triangular part of the array t must contain the lower part of global vector storing the lower diagonal of the matrix. globally, dl(1) is not referenced, and dl must b must be of size >= desca( nb_ ). part of global vector storing the lower diagonal of the matrix. globally, dl(1) is not referenced, and dl must b must be of size >= desca( nb_ ). if jobu = 'v', u contains the first min(m,n) columns of u if jobu = 'n', u is not referenced iu (global input) integer corresponding to the selected eigenvalues. if jobz = 'n', then z is not referenced iz (global input) integer if range='v', the lower bound of the interval to be searched for eigenvalues. not referenced if range = 'a' or 'i' vu (global input) real the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th the lower triangular part of the matrix, and its strictly the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th the lower triangular part of the matrix, and its strictly if range='v', the lower bound of the interval to be searched for eigenvalues. not referenced if range = 'a' or 'i' vu (global input) real the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th the lower triangular part of the matrix, and its strictly the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th lower triangular part of the matrix, and its strictly upper the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th lower triangular part of the matrix, and its strictly upper the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th lower triangular part of the matrix, and its strictly upper the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th lower triangular part of the matrix, and its strictly upper = 'u': upper triangular part is copied; the strictly lower triangular part of sub( a ) is not referenced upper triangular part of sub( a ) is not referenced; = 'u': upper triangular part is copied; the strictly lower triangular part of sub( a ) is not referenced upper triangular part of sub( a ) is not referenced; work (local workspace) real array dimension (lwork) lwork >= 0 if norm = 'm' or 'm' (not referenced) mp0 if norm = 'i' or 'i', else iwork is not referenced specifies whether the upper or lower triangular part of the symmetric distributed matrix sub( a ) is to be referenced = 'l': lower triangular the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th lower triangular part of the matrix, and its strictly upper sub( a ) whose scaling factors are to be computed. only the diagonal elements of sub( a ) are referenced ia (global input) integer sub( a ) contains the upper triangular part of the matrix, and its strictly lower triangular part is not referenced sub( a ) contains the lower triangular part of the distribu- sub( a ) contains the upper triangular part of the matrix, and its strictly lower triangular part is not referenced sub( a ) contains the lower triangular part of the distribu- triangular part of the matrix a, and the strictly lower triangular part of a is not referenced. if uplo = 'l', th triangular part of the matrix a, and the strictly upper sub( a ) contains the upper triangular part of the matrix, and its strictly lower triangular part is not referenced sub( a ) contains the lower triangular part of the distribu- sub( a ) contains the upper triangular part of the matrix, and its strictly lower triangular part is not referenced sub( a ) contains the lower triangular part of the distribu- part of global vector storing the upper diagonal of the matrix. globally, du(n) is not referenced, and du must b on exit, this array contains information containing the part of global vector storing the upper diagonal of the matrix. globally, du(n) is not referenced, and du must b on exit, this array contains information containing the tains the upper triangular matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th matrix contains the lower triangular matrix, and the strictly computed. if howmny = 'a' or 'b', select is not referenced eigenvalue, select(j) must be set to .true.. sub( a ) contains the upper triangular part of the matrix, and its strictly lower triangular part is not referenced sub( a ) contains the lower triangular part of the distribu- matrix, and the strictly lower triangular part of sub( a ) is not referenced. if uplo = 'l', the leading n-by-n lowe triangular matrix, and the strictly upper triangular part the upper triangular matrix to be inverted, and the strictly lower triangular part of sub( a ) is not referenced the matrix sub( a ) contains the lower triangular matrix, matrix, and the strictly lower triangular part of sub( a ) is not referenced. if uplo = 'l', the leading n-by-n lowe matrix, and the strictly upper triangular part of sub( a ) part of global vector storing the lower diagonal of the matrix. globally, dl(1) is not referenced, and dl must b must be of size >= desca( nb_ ). part of global vector storing the lower diagonal of the matrix. globally, dl(1) is not referenced, and dl must b must be of size >= desca( nb_ ). if jobu = 'v', u contains the first min(m,n) columns of u if jobu = 'n', u is not referenced iu (global input) integer = 'u': upper triangular part is copied; the strictly lower triangular part of sub( a ) is not referenced upper triangular part of sub( a ) is not referenced; = 'u': upper triangular part is copied; the strictly lower triangular part of sub( a ) is not referenced upper triangular part of sub( a ) is not referenced; if ijob = 1, nval(2) is the desired value of n(w). if ijob = 2, not referenced work (local workspace) double precision array dimension (lwork) lwork >= 0 if norm = 'm' or 'm' (not referenced) mp0 if norm = 'i' or 'i', else iwork is not referenced specifies whether the upper or lower triangular part of the symmetric distributed matrix sub( a ) is to be referenced = 'l': lower triangular the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th lower triangular part of the matrix, and its strictly upper sub( a ) whose scaling factors are to be computed. only the diagonal elements of sub( a ) are referenced ia (global input) integer sub( a ) contains the upper triangular part of the matrix, and its strictly lower triangular part is not referenced sub( a ) contains the lower triangular part of the distribu- sub( a ) contains the upper triangular part of the matrix, and its strictly lower triangular part is not referenced sub( a ) contains the lower triangular part of the distribu- triangular part of the matrix a, and the strictly lower triangular part of a is not referenced. if uplo = 'l', th triangular part of the matrix a, and the strictly upper sub( a ) contains the upper triangular part of the matrix, and its strictly lower triangular part is not referenced sub( a ) contains the lower triangular part of the distribu- sub( a ) contains the upper triangular part of the matrix, and its strictly lower triangular part is not referenced sub( a ) contains the lower triangular part of the distribu- part of global vector storing the upper diagonal of the matrix. globally, du(n) is not referenced, and du must b on exit, this array contains information containing the part of global vector storing the upper diagonal of the matrix. globally, du(n) is not referenced, and du must b on exit, this array contains information containing the for eigenvalues. eigenvalues less than vl will not be returned. not referenced if range='a' or 'i' vu (global input) double precision corresponding to the selected eigenvalues. if jobz = 'n', then z is not referenced iz (global input) integer if range='v', the lower bound of the interval to be searched for eigenvalues. not referenced if range = 'a' or 'i' vu (global input) double precision the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th the lower triangular part of the matrix, and its strictly the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th the lower triangular part of the matrix, and its strictly if range='v', the lower bound of the interval to be searched for eigenvalues. not referenced if range = 'a' or 'i' vu (global input) double precision the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th the lower triangular part of the matrix, and its strictly the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th lower triangular part of the matrix, and its strictly upper the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th lower triangular part of the matrix, and its strictly upper the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th lower triangular part of the matrix, and its strictly upper the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th lower triangular part of the matrix, and its strictly upper tains the upper triangular matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th matrix contains the lower triangular matrix, and the strictly sub( a ) contains the upper triangular part of the matrix, and its strictly lower triangular part is not referenced sub( a ) contains the lower triangular part of the distribu- matrix, and the strictly lower triangular part of sub( a ) is not referenced. if uplo = 'l', the leading n-by-n lowe triangular matrix, and the strictly upper triangular part the upper triangular matrix to be inverted, and the strictly lower triangular part of sub( a ) is not referenced the matrix sub( a ) contains the lower triangular matrix, matrix, and the strictly lower triangular part of sub( a ) is not referenced. if uplo = 'l', the leading n-by-n lowe matrix, and the strictly upper triangular part of sub( a ) part of global vector storing the lower diagonal of the matrix. globally, dl(1) is not referenced, and dl must b must be of size >= desca( nb_ ). part of global vector storing the lower diagonal of the matrix. globally, dl(1) is not referenced, and dl must b must be of size >= desca( nb_ ). if jobu = 'v', u contains the first min(m,n) columns of u if jobu = 'n', u is not referenced iu (global input) integer = 'u': upper triangular part is copied; the strictly lower triangular part of sub( a ) is not referenced upper triangular part of sub( a ) is not referenced; = 'u': upper triangular part is copied; the strictly lower triangular part of sub( a ) is not referenced upper triangular part of sub( a ) is not referenced; if ijob = 1, nval(2) is the desired value of n(w). if ijob = 2, not referenced work (local workspace) real array dimension (lwork) lwork >= 0 if norm = 'm' or 'm' (not referenced) mp0 if norm = 'i' or 'i', else iwork is not referenced specifies whether the upper or lower triangular part of the symmetric distributed matrix sub( a ) is to be referenced = 'l': lower triangular the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th lower triangular part of the matrix, and its strictly upper sub( a ) whose scaling factors are to be computed. only the diagonal elements of sub( a ) are referenced ia (global input) integer sub( a ) contains the upper triangular part of the matrix, and its strictly lower triangular part is not referenced sub( a ) contains the lower triangular part of the distribu- sub( a ) contains the upper triangular part of the matrix, and its strictly lower triangular part is not referenced sub( a ) contains the lower triangular part of the distribu- triangular part of the matrix a, and the strictly lower triangular part of a is not referenced. if uplo = 'l', th triangular part of the matrix a, and the strictly upper sub( a ) contains the upper triangular part of the matrix, and its strictly lower triangular part is not referenced sub( a ) contains the lower triangular part of the distribu- sub( a ) contains the upper triangular part of the matrix, and its strictly lower triangular part is not referenced sub( a ) contains the lower triangular part of the distribu- part of global vector storing the upper diagonal of the matrix. globally, du(n) is not referenced, and du must b on exit, this array contains information containing the part of global vector storing the upper diagonal of the matrix. globally, du(n) is not referenced, and du must b on exit, this array contains information containing the for eigenvalues. eigenvalues less than vl will not be returned. not referenced if range='a' or 'i' vu (global input) real corresponding to the selected eigenvalues. if jobz = 'n', then z is not referenced iz (global input) integer if range='v', the lower bound of the interval to be searched for eigenvalues. not referenced if range = 'a' or 'i' vu (global input) real the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th the lower triangular part of the matrix, and its strictly the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th the lower triangular part of the matrix, and its strictly if range='v', the lower bound of the interval to be searched for eigenvalues. not referenced if range = 'a' or 'i' vu (global input) real the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th the lower triangular part of the matrix, and its strictly the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th lower triangular part of the matrix, and its strictly upper the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th lower triangular part of the matrix, and its strictly upper the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th lower triangular part of the matrix, and its strictly upper the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th lower triangular part of the matrix, and its strictly upper tains the upper triangular matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th matrix contains the lower triangular matrix, and the strictly sub( a ) contains the upper triangular part of the matrix, and its strictly lower triangular part is not referenced sub( a ) contains the lower triangular part of the distribu- matrix, and the strictly lower triangular part of sub( a ) is not referenced. if uplo = 'l', the leading n-by-n lowe triangular matrix, and the strictly upper triangular part the upper triangular matrix to be inverted, and the strictly lower triangular part of sub( a ) is not referenced the matrix sub( a ) contains the lower triangular matrix, matrix, and the strictly lower triangular part of sub( a ) is not referenced. if uplo = 'l', the leading n-by-n lowe matrix, and the strictly upper triangular part of sub( a ) part of global vector storing the lower diagonal of the matrix. globally, dl(1) is not referenced, and dl must b must be of size >= desca( nb_ ). part of global vector storing the lower diagonal of the matrix. globally, dl(1) is not referenced, and dl must b must be of size >= desca( nb_ ). if jobu = 'v', u contains the first min(m,n) columns of u if jobu = 'n', u is not referenced iu (global input) integer corresponding to the selected eigenvalues. if jobz = 'n', then z is not referenced iz (global input) integer if range='v', the lower bound of the interval to be searched for eigenvalues. not referenced if range = 'a' or 'i' vu (global input) double precision the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th the lower triangular part of the matrix, and its strictly the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th the lower triangular part of the matrix, and its strictly if range='v', the lower bound of the interval to be searched for eigenvalues. not referenced if range = 'a' or 'i' vu (global input) double precision the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th the lower triangular part of the matrix, and its strictly the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th lower triangular part of the matrix, and its strictly upper the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th lower triangular part of the matrix, and its strictly upper the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th lower triangular part of the matrix, and its strictly upper the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th lower triangular part of the matrix, and its strictly upper = 'u': upper triangular part is copied; the strictly lower triangular part of sub( a ) is not referenced upper triangular part of sub( a ) is not referenced; = 'u': upper triangular part is copied; the strictly lower triangular part of sub( a ) is not referenced upper triangular part of sub( a ) is not referenced; work (local workspace) double precision array dimension (lwork) lwork >= 0 if norm = 'm' or 'm' (not referenced) mp0 if norm = 'i' or 'i', else iwork is not referenced specifies whether the upper or lower triangular part of the symmetric distributed matrix sub( a ) is to be referenced = 'l': lower triangular the upper triangular part of the matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th lower triangular part of the matrix, and its strictly upper sub( a ) whose scaling factors are to be computed. only the diagonal elements of sub( a ) are referenced ia (global input) integer sub( a ) contains the upper triangular part of the matrix, and its strictly lower triangular part is not referenced sub( a ) contains the lower triangular part of the distribu- sub( a ) contains the upper triangular part of the matrix, and its strictly lower triangular part is not referenced sub( a ) contains the lower triangular part of the distribu- triangular part of the matrix a, and the strictly lower triangular part of a is not referenced. if uplo = 'l', th triangular part of the matrix a, and the strictly upper sub( a ) contains the upper triangular part of the matrix, and its strictly lower triangular part is not referenced sub( a ) contains the lower triangular part of the distribu- sub( a ) contains the upper triangular part of the matrix, and its strictly lower triangular part is not referenced sub( a ) contains the lower triangular part of the distribu- part of global vector storing the upper diagonal of the matrix. globally, du(n) is not referenced, and du must b on exit, this array contains information containing the part of global vector storing the upper diagonal of the matrix. globally, du(n) is not referenced, and du must b on exit, this array contains information containing the tains the upper triangular matrix, and its strictly lower triangular part is not referenced. if uplo = 'l', th matrix contains the lower triangular matrix, and the strictly computed. if howmny = 'a' or 'b', select is not referenced eigenvalue, select(j) must be set to .true.. sub( a ) contains the upper triangular part of the matrix, and its strictly lower triangular part is not referenced sub( a ) contains the lower triangular part of the distribu- matrix, and the strictly lower triangular part of sub( a ) is not referenced. if uplo = 'l', the leading n-by-n lowe triangular matrix, and the strictly upper triangular part the upper triangular matrix to be inverted, and the strictly lower triangular part of sub( a ) is not referenced the matrix sub( a ) contains the lower triangular matrix, matrix, and the strictly lower triangular part of sub( a ) is not referenced. if uplo = 'l', the leading n-by-n lowe matrix, and the strictly upper triangular part of sub( a ) on entry, the matrix of shifts. only the 2x2 diagonal of s is referenced. it is assumed that s has jblk double shift on exit, the data is rearranged in the best order for triangular matrix and the strictly lower triangular part of t is not referenced lower triangular part of the array t must contain the lower on entry, the matrix of shifts. only the 2x2 diagonal of s is referenced. it is assumed that s has jblk double shift on exit, the data is rearranged in the best order for triangular matrix and the strictly lower triangular part of t is not referenced lower triangular part of the array t must contain the lower |
| referred referred the innermost loop to avoid overflow and determine the sign of a floating point number. pdlapdct will be referred to as the "paranoid the innermost loop to avoid overflow and determine the sign of a floating point number. pslapdct will be referred to as the "paranoid |
| refers refers (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must corresponding to the eigenvalue w(ifail(i)) failed to converge ( w refers to the array of eigenvalues on output ) iclustr (global output) integer array, dimension (2*p) (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must corresponding to the eigenvalue w(ifail(i)) failed to converge ( w refers to the array of eigenvalues on output ) iclustr (global output) integer array, dimension (2*p) (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must corresponding to the eigenvalue w(ifail(i)) failed to converge ( w refers to the array of eigenvalues on output ) iclustr (global output) integer array, dimension (2*p) (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must (1 by p type), then the two dimensional descriptor must have a ctxt value that refers to a 1 by p blacs grid (p by 1 type), then the two dimensional descriptor must corresponding to the eigenvalue w(ifail(i)) failed to converge ( w refers to the array of eigenvalues on output ) iclustr (global output) integer array, dimension (2*p) |
| refinement refinement itmax is the maximum number of steps of iterative refinement notes 5. iterative refinement is applied to improve the computed solutio for it. itmax is the maximum number of steps of iterative refinement notes 5. iterative refinement is applied to improve the computed solutio for it. means before entering this routine. pctrrfs does not do iterative refinement because doing so cannot improve the backward error notes itmax is the maximum number of steps of iterative refinement notes 5. iterative refinement is applied to improve the computed solutio for it. itmax is the maximum number of steps of iterative refinement notes 5. iterative refinement is applied to improve the computed solutio for it. means before entering this routine. pdtrrfs does not do iterative refinement because doing so cannot improve the backward error notes itmax is the maximum number of steps of iterative refinement notes 5. iterative refinement is applied to improve the computed solutio for it. itmax is the maximum number of steps of iterative refinement notes 5. iterative refinement is applied to improve the computed solutio for it. means before entering this routine. pstrrfs does not do iterative refinement because doing so cannot improve the backward error notes itmax is the maximum number of steps of iterative refinement notes 5. iterative refinement is applied to improve the computed solutio for it. itmax is the maximum number of steps of iterative refinement notes 5. iterative refinement is applied to improve the computed solutio for it. means before entering this routine. pztrrfs does not do iterative refinement because doing so cannot improve the backward error notes |
| reflect reflect are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: are temporary and will be removed in future releases, while others may reflect fundamental technical limitations non-cyclic restriction: very important! holding part of the matrix, of size 1xnp where np is adjusted, starting at csrc=0, with ja modified to reflect dropped procs first processor to hold part of the matrix: |
| reflecting reflecting p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one p*nb>= mod(ja-1,nb)+n. the mapping for matrices must be blocked, reflecting the natur this formula in words is: no processor may have more than one |
| reflection reflection the first iteration of this loop determines a reflection thus creating a nonzero bulge below the subdiagonal. triangular matrix, stopping/starting at the diagonal, which is the point of reflection. the pictures below demonstrate this refered to as rowsums, and the column sums shown by | are refered triangular matrix, stopping/starting at the diagonal, which is the point of reflection. the pictures below demonstrate this refered to as rowsums, and the column sums shown by | are refered triangular matrix, stopping/starting at the diagonal, which is the point of reflection. the pictures below demonstrate this refered to as rowsums, and the column sums shown by | are refered triangular matrix, stopping/starting at the diagonal, which is the point of reflection. the pictures below demonstrate this refered to as rowsums, and the column sums shown by | are refered triangular matrix, stopping/starting at the diagonal, which is the point of reflection. the pictures below demonstrate this refered to as rowsums, and the column sums shown by | are refered triangular matrix, stopping/starting at the diagonal, which is the point of reflection. the pictures below demonstrate this refered to as rowsums, and the column sums shown by | are refered the first iteration of this loop determines a reflection thus creating a nonzero bulge below the subdiagonal. |
| reflections reflections a (global input/output) complex array, (lda,*) on entry, the matrix to receive the reflections a (global input/output) double precision array, (lda,*) on entry, the matrix to receive the reflections a (global input/output) real array, (lda,*) on entry, the matrix to receive the reflections a (global input/output) complex*16 array, (lda,*) on entry, the matrix to receive the reflections |
| reflector reflector claref applies one or several householder reflectors of size rows or columns. dlaref applies one or several householder reflectors of size rows or columns. routine returns the matrices v and t which determine q as a block reflector i - v*t*v', and also the matrix y = a * v * t this is an auxiliary routine called by pcgehrd. in the following pclarfb applies a complex block reflector q or its conjugat denoting c(ic:ic+m-1,jc:jc+n-1), from the left or the right. pclarfg generates a complex elementary reflector h of order n, suc pclarft forms the triangular factor t of a complex block reflector pclarzb applies a complex block reflector q or its conjugat denoting c(ic:ic+m-1,jc:jc+n-1), from the left or the right. pclarzt forms the triangular factor t of a complex block reflector reflectors as returned by pctzrzf. a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the last n columns of a product of k elementary reflectors of order q = h(k) . . . h(2) h(1) a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the first n columns of a product of k elementary reflectors of orde a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the first m rows of a product of k elementary reflectors of order q = h(k)' . . . h(2)' h(1)' a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the first m rows of a product of k elementary reflectors of order q = h(k)' . . . h(2)' h(1)' a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the last n columns of a product of k elementary reflectors of order q = h(k) . . . h(2) h(1) a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the first n columns of a product of k elementary reflectors of orde a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the last m rows of a product of k elementary reflectors of order q = h(1)' h(2)' . . . h(k)' a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the last m rows of a product of k elementary reflectors of order q = h(1)' h(2)' . . . h(k)' where q is a complex unitary distributed matrix defined as the product of k elementary reflector q = h(k) . . . h(2) h(1) where q is a complex unitary distributed matrix defined as the product of k elementary reflector q = h(1) h(2) . . . h(k) bidiagonal form: a(ia:*,ja:*) = q * b * p**h. q and p**h are defined as products of elementary reflectors h(i) and g(i) respectively let nq = m if side = 'l' and nq = n if side = 'r'. thus nq is the where q is a complex unitary distributed matrix defined as the product of k elementary reflector q = h(k)' . . . h(2)' h(1)' where q is a complex unitary distributed matrix defined as the product of k elementary reflector q = h(k)' . . . h(2)' h(1)' where q is a complex unitary distributed matrix defined as the product of k elementary reflector q = h(k) . . . h(2) h(1) where q is a complex unitary distributed matrix defined as the product of k elementary reflector q = h(1) h(2) . . . h(k) where q is a complex unitary distributed matrix defined as the product of k elementary reflector q = h(1)' h(2)' . . . h(k)' where q is a complex unitary distributed matrix defined as the product of k elementary reflector q = h(1)' h(2)' . . . h(k)' where q is a complex unitary distributed matrix defined as the product of k elementary reflector q = h(1)' h(2)' . . . h(k)' where q is a complex unitary distributed matrix defined as the product of k elementary reflector q = h(1)' h(2)' . . . h(k)' nq = m if side = 'l' and nq = n if side = 'r'. q is defined as the product of nq-1 elementary reflectors, as returned by pchetrd if uplo = 'u', q = h(nq-1) . . . h(2) h(1); nal similarity transformation q' * a * q. the routine returns the matrices v and t which determine q as a block reflector i - v*t*v' pdlarfb applies a real block reflector q or its transpose q**t to from the left or the right. pdlarfg generates a real elementary reflector h of order n, suc pdlarft forms the triangular factor t of a real block reflector pdlarzb applies a real block reflector q or its transpose q**t t from the left or the right. pdlarzt forms the triangular factor t of a real block reflector reflectors as returned by pdtzrzf. a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the last n columns of a product of k elementary reflectors of order q = h(k) . . . h(2) h(1) a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the first n columns of a product of k elementary reflectors of orde a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the first m rows of a product of k elementary reflectors of order q = h(k) . . . h(2) h(1) a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the first m rows of a product of k elementary reflectors of order q = h(k) . . . h(2) h(1) a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the last n columns of a product of k elementary reflectors of order q = h(k) . . . h(2) h(1) a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the first n columns of a product of k elementary reflectors of orde a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the last m rows of a product of k elementary reflectors of order q = h(1) h(2) . . . h(k) a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the last m rows of a product of k elementary reflectors of order q = h(1) h(2) . . . h(k) where q is a real orthogonal distributed matrix defined as the product of k elementary reflector q = h(k) . . . h(2) h(1) where q is a real orthogonal distributed matrix defined as the product of k elementary reflector q = h(1) h(2) . . . h(k) bidiagonal form: a(ia:*,ja:*) = q * b * p**t. q and p**t are defined as products of elementary reflectors h(i) and g(i) respectively let nq = m if side = 'l' and nq = n if side = 'r'. thus nq is the where q is a real orthogonal distributed matrix defined as the product of k elementary reflector q = h(k) . . . h(2) h(1) where q is a real orthogonal distributed matrix defined as the product of k elementary reflector q = h(k) . . . h(2) h(1) where q is a real orthogonal distributed matrix defined as the product of k elementary reflector q = h(k) . . . h(2) h(1) where q is a real orthogonal distributed matrix defined as the product of k elementary reflector q = h(1) h(2) . . . h(k) where q is a real orthogonal distributed matrix defined as the product of k elementary reflector q = h(1) h(2) . . . h(k) where q is a real orthogonal distributed matrix defined as the product of k elementary reflector q = h(1) h(2) . . . h(k) where q is a real orthogonal distributed matrix defined as the product of k elementary reflector q = h(1) h(2) . . . h(k) where q is a real orthogonal distributed matrix defined as the product of k elementary reflector q = h(1) h(2) . . . h(k) nq = m if side = 'l' and nq = n if side = 'r'. q is defined as the product of nq-1 elementary reflectors, as returned by pdsytrd if uplo = 'u', q = h(nq-1) . . . h(2) h(1); nal similarity transformation q' * a * q. the routine returns the matrices v and t which determine q as a block reflector i - v*t*v' pslarfb applies a real block reflector q or its transpose q**t to from the left or the right. pslarfg generates a real elementary reflector h of order n, suc pslarft forms the triangular factor t of a real block reflector pslarzb applies a real block reflector q or its transpose q**t t from the left or the right. pslarzt forms the triangular factor t of a real block reflector reflectors as returned by pstzrzf. a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the last n columns of a product of k elementary reflectors of order q = h(k) . . . h(2) h(1) a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the first n columns of a product of k elementary reflectors of orde a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the first m rows of a product of k elementary reflectors of order q = h(k) . . . h(2) h(1) a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the first m rows of a product of k elementary reflectors of order q = h(k) . . . h(2) h(1) a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the last n columns of a product of k elementary reflectors of order q = h(k) . . . h(2) h(1) a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the first n columns of a product of k elementary reflectors of orde a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the last m rows of a product of k elementary reflectors of order q = h(1) h(2) . . . h(k) a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the last m rows of a product of k elementary reflectors of order q = h(1) h(2) . . . h(k) where q is a real orthogonal distributed matrix defined as the product of k elementary reflector q = h(k) . . . h(2) h(1) where q is a real orthogonal distributed matrix defined as the product of k elementary reflector q = h(1) h(2) . . . h(k) bidiagonal form: a(ia:*,ja:*) = q * b * p**t. q and p**t are defined as products of elementary reflectors h(i) and g(i) respectively let nq = m if side = 'l' and nq = n if side = 'r'. thus nq is the where q is a real orthogonal distributed matrix defined as the product of k elementary reflector q = h(k) . . . h(2) h(1) where q is a real orthogonal distributed matrix defined as the product of k elementary reflector q = h(k) . . . h(2) h(1) where q is a real orthogonal distributed matrix defined as the product of k elementary reflector q = h(k) . . . h(2) h(1) where q is a real orthogonal distributed matrix defined as the product of k elementary reflector q = h(1) h(2) . . . h(k) where q is a real orthogonal distributed matrix defined as the product of k elementary reflector q = h(1) h(2) . . . h(k) where q is a real orthogonal distributed matrix defined as the product of k elementary reflector q = h(1) h(2) . . . h(k) where q is a real orthogonal distributed matrix defined as the product of k elementary reflector q = h(1) h(2) . . . h(k) where q is a real orthogonal distributed matrix defined as the product of k elementary reflector q = h(1) h(2) . . . h(k) nq = m if side = 'l' and nq = n if side = 'r'. q is defined as the product of nq-1 elementary reflectors, as returned by pssytrd if uplo = 'u', q = h(nq-1) . . . h(2) h(1); routine returns the matrices v and t which determine q as a block reflector i - v*t*v', and also the matrix y = a * v * t this is an auxiliary routine called by pzgehrd. in the following pzlarfb applies a complex block reflector q or its conjugat denoting c(ic:ic+m-1,jc:jc+n-1), from the left or the right. pzlarfg generates a complex elementary reflector h of order n, suc pzlarft forms the triangular factor t of a complex block reflector pzlarzb applies a complex block reflector q or its conjugat denoting c(ic:ic+m-1,jc:jc+n-1), from the left or the right. pzlarzt forms the triangular factor t of a complex block reflector reflectors as returned by pztzrzf. a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the last n columns of a product of k elementary reflectors of order q = h(k) . . . h(2) h(1) a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the first n columns of a product of k elementary reflectors of orde a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the first m rows of a product of k elementary reflectors of order q = h(k)' . . . h(2)' h(1)' a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the first m rows of a product of k elementary reflectors of order q = h(k)' . . . h(2)' h(1)' a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the last n columns of a product of k elementary reflectors of order q = h(k) . . . h(2) h(1) a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the first n columns of a product of k elementary reflectors of orde a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the last m rows of a product of k elementary reflectors of order q = h(1)' h(2)' . . . h(k)' a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the last m rows of a product of k elementary reflectors of order q = h(1)' h(2)' . . . h(k)' where q is a complex unitary distributed matrix defined as the product of k elementary reflector q = h(k) . . . h(2) h(1) where q is a complex unitary distributed matrix defined as the product of k elementary reflector q = h(1) h(2) . . . h(k) bidiagonal form: a(ia:*,ja:*) = q * b * p**h. q and p**h are defined as products of elementary reflectors h(i) and g(i) respectively let nq = m if side = 'l' and nq = n if side = 'r'. thus nq is the where q is a complex unitary distributed matrix defined as the product of k elementary reflector q = h(k)' . . . h(2)' h(1)' where q is a complex unitary distributed matrix defined as the product of k elementary reflector q = h(k)' . . . h(2)' h(1)' where q is a complex unitary distributed matrix defined as the product of k elementary reflector q = h(k) . . . h(2) h(1) where q is a complex unitary distributed matrix defined as the product of k elementary reflector q = h(1) h(2) . . . h(k) where q is a complex unitary distributed matrix defined as the product of k elementary reflector q = h(1)' h(2)' . . . h(k)' where q is a complex unitary distributed matrix defined as the product of k elementary reflector q = h(1)' h(2)' . . . h(k)' where q is a complex unitary distributed matrix defined as the product of k elementary reflector q = h(1)' h(2)' . . . h(k)' where q is a complex unitary distributed matrix defined as the product of k elementary reflector q = h(1)' h(2)' . . . h(k)' nq = m if side = 'l' and nq = n if side = 'r'. q is defined as the product of nq-1 elementary reflectors, as returned by pzhetrd if uplo = 'u', q = h(nq-1) . . . h(2) h(1); slaref applies one or several householder reflectors of size rows or columns. zlaref applies one or several householder reflectors of size rows or columns. |
| reflectors reflectors claref applies one or several householder reflectors of size rows or columns. dlaref applies one or several householder reflectors of size rows or columns. below the diagonal, with the array tauq, represent the unitary matrix q as a product of elementary reflectors, an taup, represent the orthogonal matrix p as a product of below the diagonal, with the array tauq, represent the unitary matrix q as a product of elementary reflectors, an taup, represent the orthogonal matrix p as a product of sent the unitary matrix q as a product of elementary reflectors. see further details ia (global input) integer sent the unitary matrix q as a product of elementary reflectors. see further details ia (global input) integer sent the unitary matrix q as a product of elementary reflectors (see further details) ia (global input) integer sent the unitary matrix q as a product of elementary reflectors (see further details) ia (global input) integer array tau, represent the unitary matrix q as a product of elementary reflectors (see further details) ia (global input) integer array tau, represent the unitary matrix q as a product of elementary reflectors (see further details) ia (global input) integer sent the unitary matrix q as a product of elementary reflectors (see further details) ia (global input) integer represent the unitary matrix q as a product of elementary reflectors (see further details) ia (global input) integer represent the unitary matrix q as a product of elementary reflectors (see further details) ia (global input) integer tau, represent the unitary matrix q as a product of elementary reflectors (see further details) ia (global input) integer tau, represent the unitary matrix q as a product of elementary reflectors (see further details) ia (global input) integer represent the unitary matrix q as a product of min(n,m) elementary reflectors (see further details) ia (global input) integer taua, represent the unitary matrix q as a product of elementary reflectors (see further details) ia (global input) integer with the array tau, represent the unitary matrix q as a product of elementary reflectors; if uplo = 'l', the diagona corresponding elements of the tridiagonal matrix t, and the with the array tau, represent the unitary matrix q as a product of elementary reflectors; if uplo = 'l', the diagona corresponding elements of the tridiagonal matrix t, and the with the array tau, represent the unitary matrix q as a product of elementary reflectors; if uplo = 'l', the diagona corresponding elements of the tridiagonal matrix t, and the with the array tau, represent the unitary matrix q as a product of elementary reflectors; if uplo = 'l', the diagona corresponding elements of the tridiagonal matrix t, and the columns, with the array tauq, represent the unitary matrix q as a product of elementary reflectors; an array taup, represent the unitary matrix p as a product array tau, represent the matrix q as a product of elementary reflectors. the other columns of a(ia:ia+n-1,ja:ja+n-k) ar indicates how q is formed from a product of elementary reflectors = 'b': q = h(k) . . . h(2) h(1) (backward) pclarft forms the triangular factor t of a complex block reflector h of order n, which is defined as a product of k elementary reflectors if direct = 'f', h = h(1) h(2) . . . h(k) and t is upper triangular; q is a product of k elementary reflectors as returned by pctzrzf currently, only storev = 'r' and direct = 'b' are supported. h of order > n, which is defined as a product of k elementary reflectors as returned by pctzrzf if direct = 'f', h = h(1) h(2) . . . h(k) and t is upper triangular; diagonal with the array tau, represent the unitary matrix q as a product of elementary reflectors. if uplo = 'l', th the diagonal elements overwriting the diagonal elements of the columns of the distributed submatrix sub( a ) containing the meaningful part of the householder reflectors. l > 0 a (local input/local output) complex pointer into the sub( a ), with the array tau, represent the unitary matrix z as a product of m elementary reflectors ia (global input) integer a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the last n columns of a product of k elementary reflectors of order q = h(k) . . . h(2) h(1) a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the first n columns of a product of k elementary reflectors of orde a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the first m rows of a product of k elementary reflectors of order q = h(k)' . . . h(2)' h(1)' a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the first m rows of a product of k elementary reflectors of order q = h(k)' . . . h(2)' h(1)' a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the last n columns of a product of k elementary reflectors of order q = h(k) . . . h(2) h(1) a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the first n columns of a product of k elementary reflectors of orde a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the last m rows of a product of k elementary reflectors of order q = h(1)' h(2)' . . . h(k)' a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the last m rows of a product of k elementary reflectors of order q = h(1)' h(2)' . . . h(k)' where q is a complex unitary distributed matrix defined as the product of k elementary reflectors q = h(k) . . . h(2) h(1) where q is a complex unitary distributed matrix defined as the product of k elementary reflectors q = h(1) h(2) . . . h(k) bidiagonal form: a(ia:*,ja:*) = q * b * p**h. q and p**h are defined as products of elementary reflectors h(i) and g(i) respectively let nq = m if side = 'l' and nq = n if side = 'r'. thus nq is the nq = m if side = 'l' and nq = n if side = 'r'. q is defined as the product of ihi-ilo elementary reflectors, as returned by pcgehrd q = h(ilo) h(ilo+1) . . . h(ihi-1). where q is a complex unitary distributed matrix defined as the product of k elementary reflectors q = h(k)' . . . h(2)' h(1)' where q is a complex unitary distributed matrix defined as the product of k elementary reflectors q = h(k)' . . . h(2)' h(1)' where q is a complex unitary distributed matrix defined as the product of k elementary reflectors q = h(k) . . . h(2) h(1) where q is a complex unitary distributed matrix defined as the product of k elementary reflectors q = h(1) h(2) . . . h(k) where q is a complex unitary distributed matrix defined as the product of k elementary reflectors q = h(1)' h(2)' . . . h(k)' where q is a complex unitary distributed matrix defined as the product of k elementary reflectors q = h(1)' h(2)' . . . h(k)' where q is a complex unitary distributed matrix defined as the product of k elementary reflectors q = h(1)' h(2)' . . . h(k)' where q is a complex unitary distributed matrix defined as the product of k elementary reflectors q = h(1)' h(2)' . . . h(k)' nq = m if side = 'l' and nq = n if side = 'r'. q is defined as the product of nq-1 elementary reflectors, as returned by pchetrd if uplo = 'u', q = h(nq-1) . . . h(2) h(1); below the diagonal, with the array tauq, represent the orthogonal matrix q as a product of elementary reflectors array taup, represent the orthogonal matrix p as a product below the diagonal, with the array tauq, represent the orthogonal matrix q as a product of elementary reflectors array taup, represent the orthogonal matrix p as a product sent the orthogonal matrix q as a product of elementary reflectors. see further details ia (global input) integer sent the orthogonal matrix q as a product of elementary reflectors. see further details ia (global input) integer sent the orthogonal matrix q as a product of elementary reflectors (see further details) ia (global input) integer sent the orthogonal matrix q as a product of elementary reflectors (see further details) ia (global input) integer array tau, represent the orthogonal matrix q as a product of elementary reflectors (see further details) ia (global input) integer array tau, represent the orthogonal matrix q as a product of elementary reflectors (see further details) ia (global input) integer sent the orthogonal matrix q as a product of elementary reflectors (see further details) ia (global input) integer represent the orthogonal matrix q as a product of elementary reflectors (see further details) ia (global input) integer represent the orthogonal matrix q as a product of elementary reflectors (see further details) ia (global input) integer tau, represent the orthogonal matrix q as a product of elementary reflectors (see further details) ia (global input) integer tau, represent the orthogonal matrix q as a product of elementary reflectors (see further details) ia (global input) integer represent the orthogonal matrix q as a product of min(n,m) elementary reflectors (see further details) ia (global input) integer taua, represent the orthogonal matrix q as a product of elementary reflectors (see further details) ia (global input) integer columns, with the array tauq, represent the orthogonal matrix q as a product of elementary reflectors; an array taup, represent the orthogonal matrix p as a product array tau, represent the matrix q as a product of elementary reflectors. the other columns of a(ia:ia+n-1,ja:ja+n-k) ar indicates how q is formed from a product of elementary reflectors = 'b': q = h(k) . . . h(2) h(1) (backward) pdlarft forms the triangular factor t of a real block reflector h of order n, which is defined as a product of k elementary reflectors if direct = 'f', h = h(1) h(2) . . . h(k) and t is upper triangular; q is a product of k elementary reflectors as returned by pdtzrzf currently, only storev = 'r' and direct = 'b' are supported. h of order > n, which is defined as a product of k elementary reflectors as returned by pdtzrzf if direct = 'f', h = h(1) h(2) . . . h(k) and t is upper triangular; diagonal with the array tau, represent the orthogonal matrix q as a product of elementary reflectors. if uplo = 'l', th the diagonal elements overwriting the diagonal elements of the columns of the distributed submatrix sub( a ) containing the meaningful part of the householder reflectors. l > 0 a (local input/local output) double precision pointer into the a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the last n columns of a product of k elementary reflectors of order q = h(k) . . . h(2) h(1) a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the first n columns of a product of k elementary reflectors of orde a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the first m rows of a product of k elementary reflectors of order q = h(k) . . . h(2) h(1) a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the first m rows of a product of k elementary reflectors of order q = h(k) . . . h(2) h(1) a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the last n columns of a product of k elementary reflectors of order q = h(k) . . . h(2) h(1) a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the first n columns of a product of k elementary reflectors of orde a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the last m rows of a product of k elementary reflectors of order q = h(1) h(2) . . . h(k) a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the last m rows of a product of k elementary reflectors of order q = h(1) h(2) . . . h(k) where q is a real orthogonal distributed matrix defined as the product of k elementary reflectors q = h(k) . . . h(2) h(1) where q is a real orthogonal distributed matrix defined as the product of k elementary reflectors q = h(1) h(2) . . . h(k) bidiagonal form: a(ia:*,ja:*) = q * b * p**t. q and p**t are defined as products of elementary reflectors h(i) and g(i) respectively let nq = m if side = 'l' and nq = n if side = 'r'. thus nq is the nq = m if side = 'l' and nq = n if side = 'r'. q is defined as the product of ihi-ilo elementary reflectors, as returned by pdgehrd q = h(ilo) h(ilo+1) . . . h(ihi-1). where q is a real orthogonal distributed matrix defined as the product of k elementary reflectors q = h(k) . . . h(2) h(1) where q is a real orthogonal distributed matrix defined as the product of k elementary reflectors q = h(k) . . . h(2) h(1) where q is a real orthogonal distributed matrix defined as the product of k elementary reflectors q = h(k) . . . h(2) h(1) where q is a real orthogonal distributed matrix defined as the product of k elementary reflectors q = h(1) h(2) . . . h(k) where q is a real orthogonal distributed matrix defined as the product of k elementary reflectors q = h(1) h(2) . . . h(k) where q is a real orthogonal distributed matrix defined as the product of k elementary reflectors q = h(1) h(2) . . . h(k) where q is a real orthogonal distributed matrix defined as the product of k elementary reflectors q = h(1) h(2) . . . h(k) where q is a real orthogonal distributed matrix defined as the product of k elementary reflectors q = h(1) h(2) . . . h(k) nq = m if side = 'l' and nq = n if side = 'r'. q is defined as the product of nq-1 elementary reflectors, as returned by pdsytrd if uplo = 'u', q = h(nq-1) . . . h(2) h(1); with the array tau, represent the orthogonal matrix q as a product of elementary reflectors; if uplo = 'l', the diagona corresponding elements of the tridiagonal matrix t, and the with the array tau, represent the orthogonal matrix q as a product of elementary reflectors; if uplo = 'l', the diagona corresponding elements of the tridiagonal matrix t, and the with the array tau, represent the orthogonal matrix q as a product of elementary reflectors; if uplo = 'l', the diagona corresponding elements of the tridiagonal matrix t, and the with the array tau, represent the unitary matrix q as a product of elementary reflectors; if uplo = 'l', the diagona corresponding elements of the tridiagonal matrix t, and the sub( a ), with the array tau, represent the orthogonal matrix z as a product of m elementary reflectors ia (global input) integer below the diagonal, with the array tauq, represent the orthogonal matrix q as a product of elementary reflectors array taup, represent the orthogonal matrix p as a product below the diagonal, with the array tauq, represent the orthogonal matrix q as a product of elementary reflectors array taup, represent the orthogonal matrix p as a product sent the orthogonal matrix q as a product of elementary reflectors. see further details ia (global input) integer sent the orthogonal matrix q as a product of elementary reflectors. see further details ia (global input) integer sent the orthogonal matrix q as a product of elementary reflectors (see further details) ia (global input) integer sent the orthogonal matrix q as a product of elementary reflectors (see further details) ia (global input) integer array tau, represent the orthogonal matrix q as a product of elementary reflectors (see further details) ia (global input) integer array tau, represent the orthogonal matrix q as a product of elementary reflectors (see further details) ia (global input) integer sent the orthogonal matrix q as a product of elementary reflectors (see further details) ia (global input) integer represent the orthogonal matrix q as a product of elementary reflectors (see further details) ia (global input) integer represent the orthogonal matrix q as a product of elementary reflectors (see further details) ia (global input) integer tau, represent the orthogonal matrix q as a product of elementary reflectors (see further details) ia (global input) integer tau, represent the orthogonal matrix q as a product of elementary reflectors (see further details) ia (global input) integer represent the orthogonal matrix q as a product of min(n,m) elementary reflectors (see further details) ia (global input) integer taua, represent the orthogonal matrix q as a product of elementary reflectors (see further details) ia (global input) integer columns, with the array tauq, represent the orthogonal matrix q as a product of elementary reflectors; an array taup, represent the orthogonal matrix p as a product array tau, represent the matrix q as a product of elementary reflectors. the other columns of a(ia:ia+n-1,ja:ja+n-k) ar indicates how q is formed from a product of elementary reflectors = 'b': q = h(k) . . . h(2) h(1) (backward) pslarft forms the triangular factor t of a real block reflector h of order n, which is defined as a product of k elementary reflectors if direct = 'f', h = h(1) h(2) . . . h(k) and t is upper triangular; q is a product of k elementary reflectors as returned by pstzrzf currently, only storev = 'r' and direct = 'b' are supported. h of order > n, which is defined as a product of k elementary reflectors as returned by pstzrzf if direct = 'f', h = h(1) h(2) . . . h(k) and t is upper triangular; diagonal with the array tau, represent the orthogonal matrix q as a product of elementary reflectors. if uplo = 'l', th the diagonal elements overwriting the diagonal elements of the columns of the distributed submatrix sub( a ) containing the meaningful part of the householder reflectors. l > 0 a (local input/local output) real pointer into the a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the last n columns of a product of k elementary reflectors of order q = h(k) . . . h(2) h(1) a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the first n columns of a product of k elementary reflectors of orde a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the first m rows of a product of k elementary reflectors of order q = h(k) . . . h(2) h(1) a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the first m rows of a product of k elementary reflectors of order q = h(k) . . . h(2) h(1) a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the last n columns of a product of k elementary reflectors of order q = h(k) . . . h(2) h(1) a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the first n columns of a product of k elementary reflectors of orde a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the last m rows of a product of k elementary reflectors of order q = h(1) h(2) . . . h(k) a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the last m rows of a product of k elementary reflectors of order q = h(1) h(2) . . . h(k) where q is a real orthogonal distributed matrix defined as the product of k elementary reflectors q = h(k) . . . h(2) h(1) where q is a real orthogonal distributed matrix defined as the product of k elementary reflectors q = h(1) h(2) . . . h(k) bidiagonal form: a(ia:*,ja:*) = q * b * p**t. q and p**t are defined as products of elementary reflectors h(i) and g(i) respectively let nq = m if side = 'l' and nq = n if side = 'r'. thus nq is the nq = m if side = 'l' and nq = n if side = 'r'. q is defined as the product of ihi-ilo elementary reflectors, as returned by psgehrd q = h(ilo) h(ilo+1) . . . h(ihi-1). where q is a real orthogonal distributed matrix defined as the product of k elementary reflectors q = h(k) . . . h(2) h(1) where q is a real orthogonal distributed matrix defined as the product of k elementary reflectors q = h(k) . . . h(2) h(1) where q is a real orthogonal distributed matrix defined as the product of k elementary reflectors q = h(k) . . . h(2) h(1) where q is a real orthogonal distributed matrix defined as the product of k elementary reflectors q = h(1) h(2) . . . h(k) where q is a real orthogonal distributed matrix defined as the product of k elementary reflectors q = h(1) h(2) . . . h(k) where q is a real orthogonal distributed matrix defined as the product of k elementary reflectors q = h(1) h(2) . . . h(k) where q is a real orthogonal distributed matrix defined as the product of k elementary reflectors q = h(1) h(2) . . . h(k) where q is a real orthogonal distributed matrix defined as the product of k elementary reflectors q = h(1) h(2) . . . h(k) nq = m if side = 'l' and nq = n if side = 'r'. q is defined as the product of nq-1 elementary reflectors, as returned by pssytrd if uplo = 'u', q = h(nq-1) . . . h(2) h(1); with the array tau, represent the orthogonal matrix q as a product of elementary reflectors; if uplo = 'l', the diagona corresponding elements of the tridiagonal matrix t, and the with the array tau, represent the orthogonal matrix q as a product of elementary reflectors; if uplo = 'l', the diagona corresponding elements of the tridiagonal matrix t, and the with the array tau, represent the orthogonal matrix q as a product of elementary reflectors; if uplo = 'l', the diagona corresponding elements of the tridiagonal matrix t, and the with the array tau, represent the unitary matrix q as a product of elementary reflectors; if uplo = 'l', the diagona corresponding elements of the tridiagonal matrix t, and the sub( a ), with the array tau, represent the orthogonal matrix z as a product of m elementary reflectors ia (global input) integer below the diagonal, with the array tauq, represent the unitary matrix q as a product of elementary reflectors, an taup, represent the orthogonal matrix p as a product of below the diagonal, with the array tauq, represent the unitary matrix q as a product of elementary reflectors, an taup, represent the orthogonal matrix p as a product of sent the unitary matrix q as a product of elementary reflectors. see further details ia (global input) integer sent the unitary matrix q as a product of elementary reflectors. see further details ia (global input) integer sent the unitary matrix q as a product of elementary reflectors (see further details) ia (global input) integer sent the unitary matrix q as a product of elementary reflectors (see further details) ia (global input) integer array tau, represent the unitary matrix q as a product of elementary reflectors (see further details) ia (global input) integer array tau, represent the unitary matrix q as a product of elementary reflectors (see further details) ia (global input) integer sent the unitary matrix q as a product of elementary reflectors (see further details) ia (global input) integer represent the unitary matrix q as a product of elementary reflectors (see further details) ia (global input) integer represent the unitary matrix q as a product of elementary reflectors (see further details) ia (global input) integer tau, represent the unitary matrix q as a product of elementary reflectors (see further details) ia (global input) integer tau, represent the unitary matrix q as a product of elementary reflectors (see further details) ia (global input) integer represent the unitary matrix q as a product of min(n,m) elementary reflectors (see further details) ia (global input) integer taua, represent the unitary matrix q as a product of elementary reflectors (see further details) ia (global input) integer with the array tau, represent the unitary matrix q as a product of elementary reflectors; if uplo = 'l', the diagona corresponding elements of the tridiagonal matrix t, and the with the array tau, represent the unitary matrix q as a product of elementary reflectors; if uplo = 'l', the diagona corresponding elements of the tridiagonal matrix t, and the with the array tau, represent the unitary matrix q as a product of elementary reflectors; if uplo = 'l', the diagona corresponding elements of the tridiagonal matrix t, and the with the array tau, represent the unitary matrix q as a product of elementary reflectors; if uplo = 'l', the diagona corresponding elements of the tridiagonal matrix t, and the columns, with the array tauq, represent the unitary matrix q as a product of elementary reflectors; an array taup, represent the unitary matrix p as a product array tau, represent the matrix q as a product of elementary reflectors. the other columns of a(ia:ia+n-1,ja:ja+n-k) ar indicates how q is formed from a product of elementary reflectors = 'b': q = h(k) . . . h(2) h(1) (backward) pzlarft forms the triangular factor t of a complex block reflector h of order n, which is defined as a product of k elementary reflectors if direct = 'f', h = h(1) h(2) . . . h(k) and t is upper triangular; q is a product of k elementary reflectors as returned by pztzrzf currently, only storev = 'r' and direct = 'b' are supported. h of order > n, which is defined as a product of k elementary reflectors as returned by pztzrzf if direct = 'f', h = h(1) h(2) . . . h(k) and t is upper triangular; diagonal with the array tau, represent the unitary matrix q as a product of elementary reflectors. if uplo = 'l', th the diagonal elements overwriting the diagonal elements of the columns of the distributed submatrix sub( a ) containing the meaningful part of the householder reflectors. l > 0 a (local input/local output) complex*16 pointer into the sub( a ), with the array tau, represent the unitary matrix z as a product of m elementary reflectors ia (global input) integer a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the last n columns of a product of k elementary reflectors of order q = h(k) . . . h(2) h(1) a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the first n columns of a product of k elementary reflectors of orde a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the first m rows of a product of k elementary reflectors of order q = h(k)' . . . h(2)' h(1)' a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the first m rows of a product of k elementary reflectors of order q = h(k)' . . . h(2)' h(1)' a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the last n columns of a product of k elementary reflectors of order q = h(k) . . . h(2) h(1) a(ia:ia+m-1,ja:ja+n-1) with orthonormal columns, which is defined as the first n columns of a product of k elementary reflectors of orde a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the last m rows of a product of k elementary reflectors of order q = h(1)' h(2)' . . . h(k)' a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as the last m rows of a product of k elementary reflectors of order q = h(1)' h(2)' . . . h(k)' where q is a complex unitary distributed matrix defined as the product of k elementary reflectors q = h(k) . . . h(2) h(1) where q is a complex unitary distributed matrix defined as the product of k elementary reflectors q = h(1) h(2) . . . h(k) bidiagonal form: a(ia:*,ja:*) = q * b * p**h. q and p**h are defined as products of elementary reflectors h(i) and g(i) respectively let nq = m if side = 'l' and nq = n if side = 'r'. thus nq is the nq = m if side = 'l' and nq = n if side = 'r'. q is defined as the product of ihi-ilo elementary reflectors, as returned by pzgehrd q = h(ilo) h(ilo+1) . . . h(ihi-1). where q is a complex unitary distributed matrix defined as the product of k elementary reflectors q = h(k)' . . . h(2)' h(1)' where q is a complex unitary distributed matrix defined as the product of k elementary reflectors q = h(k)' . . . h(2)' h(1)' where q is a complex unitary distributed matrix defined as the product of k elementary reflectors q = h(k) . . . h(2) h(1) where q is a complex unitary distributed matrix defined as the product of k elementary reflectors q = h(1) h(2) . . . h(k) where q is a complex unitary distributed matrix defined as the product of k elementary reflectors q = h(1)' h(2)' . . . h(k)' where q is a complex unitary distributed matrix defined as the product of k elementary reflectors q = h(1)' h(2)' . . . h(k)' where q is a complex unitary distributed matrix defined as the product of k elementary reflectors q = h(1)' h(2)' . . . h(k)' where q is a complex unitary distributed matrix defined as the product of k elementary reflectors q = h(1)' h(2)' . . . h(k)' nq = m if side = 'l' and nq = n if side = 'r'. q is defined as the product of nq-1 elementary reflectors, as returned by pzhetrd if uplo = 'u', q = h(nq-1) . . . h(2) h(1); slaref applies one or several householder reflectors of size rows or columns. zlaref applies one or several householder reflectors of size rows or columns. |
| related related if incx = 1, and locr(ix) otherwise. this array contains the householder scalars related to the householder vectors if incv = m_v, and locc(jv+k-1) otherwise. this array contains the householder scalars related to the householde if incv = m_v, and locc(jv+k-1) otherwise. this array contains the householder scalars related to the householde eigenvalues are close together or if there is a tiny entry in the z vector. for each such occurrence the order of the related secula the number of non-deflated eigenvalues, and the order of the related secular equation. 0 <= k <=n n (input) integer if incx = 1, and locr(ix) otherwise. this array contains the householder scalars related to the householder vectors if incv = m_v, and locc(jv+k-1) otherwise. this array contains the householder scalars related to the householde if incv = m_v, and locc(jv+k-1) otherwise. this array contains the householder scalars related to the householde eigenvalues are close together or if there is a tiny entry in the z vector. for each such occurrence the order of the related secula the number of non-deflated eigenvalues, and the order of the related secular equation. 0 <= k <=n n (input) integer if incx = 1, and locr(ix) otherwise. this array contains the householder scalars related to the householder vectors if incv = m_v, and locc(jv+k-1) otherwise. this array contains the householder scalars related to the householde if incv = m_v, and locc(jv+k-1) otherwise. this array contains the householder scalars related to the householde if incx = 1, and locr(ix) otherwise. this array contains the householder scalars related to the householder vectors if incv = m_v, and locc(jv+k-1) otherwise. this array contains the householder scalars related to the householde if incv = m_v, and locc(jv+k-1) otherwise. this array contains the householder scalars related to the householde |
| Relationship Relationship Relationship between workspace, orthogonality & performance enough space to compute all the eigenvectors Relationship between workspace, orthogonality & performance enough space to compute all the eigenvectors Relationship between workspace, orthogonality & performance is provided. on the other hand, in some situations, Relationship between workspace, orthogonality & performance is provided. on the other hand, in some situations, Relationship between workspace, orthogonality & performance is provided. on the other hand, in some situations, Relationship between workspace, orthogonality & performance is provided. on the other hand, in some situations, Relationship between workspace, orthogonality & performance enough space to compute all the eigenvectors Relationship between workspace, orthogonality & performance enough space to compute all the eigenvectors |
| Relative Relative berr (local output) real array of local dimension locc(jb+nrhs-1). the componentwise Relative backwar lative change in any entry of sub( a ) or sub( b ) berr (local output) real array, dimension locc(n_b). the componentwise Relative backward error of each solutio any entry of a(ia:ia+n-1,ja:ja+n-1) or see "computing small singular values of bidiagonal matrices with guaranteed high Relative accuracy," by demmel an see "computing small singular values of bidiagonal matrices with guaranteed high Relative accuracy," by demmel an berr (local output) real array of local dimension locc(jb+nrhs-1). the componentwise Relative backwar lative change in any entry of sub( a ) or sub( b ) berr (local output) real array, dimension (loc(n_b)) the componentwise Relative backward error of each solutio any entry of a or b that makes x(j) an exact solution). berr (local output) real array of local dimension locc(jb+nrhs-1). the componentwise Relative backwar lative change in any entry of sub( a ) or sub( b ) if side = 'r', 1 <= ilo <= ihi <= max(1,n); ilo and ihi are Relative indexes a (local input) complex pointer into the local memory berr (local output) double precision array of local dimension locc(jb+nrhs-1). the componentwise Relative backwar lative change in any entry of sub( a ) or sub( b ) berr (local output) double precision array, dimension locc(n_b). the componentwise Relative backward error of each solutio any entry of a(ia:ia+n-1,ja:ja+n-1) or reltol (input) double precision the minimum Relative width of an interval. when an interva magnitude) endpoint, then it is considered to be sufficiently reltol (input) double precision the minimum Relative width of an interval. when an interva magnitude) endpoint, then it is considered to be sufficiently eps = Relative machine precisio base = base of the machine if side = 'r', 1 <= ilo <= ihi <= max(1,n); ilo and ihi are Relative indexes a (local input) double precision pointer into the local memory berr (local output) double precision array of local dimension locc(jb+nrhs-1). the componentwise Relative backwar lative change in any entry of sub( a ) or sub( b ) berr (local output) double precision array, dimension (loc(n_b)) the componentwise Relative backward error of each solutio any entry of a or b that makes x(j) an exact solution). number. the effect is that the eigenvalues may not be as accurate as the absolute and Relative which is less accurate than pdlamch says. see "computing small singular values of bidiagonal matrices with guaranteed high Relative accuracy," by demmel an see "computing small singular values of bidiagonal matrices with guaranteed high Relative accuracy," by demmel an berr (local output) double precision array of local dimension locc(jb+nrhs-1). the componentwise Relative backwar lative change in any entry of sub( a ) or sub( b ) berr (local output) real array of local dimension locc(jb+nrhs-1). the componentwise Relative backwar lative change in any entry of sub( a ) or sub( b ) berr (local output) real array, dimension locc(n_b). the componentwise Relative backward error of each solutio any entry of a(ia:ia+n-1,ja:ja+n-1) or reltol (input) real the minimum Relative width of an interval. when an interva magnitude) endpoint, then it is considered to be sufficiently reltol (input) real the minimum Relative width of an interval. when an interva magnitude) endpoint, then it is considered to be sufficiently eps = Relative machine precisio base = base of the machine if side = 'r', 1 <= ilo <= ihi <= max(1,n); ilo and ihi are Relative indexes a (local input) real pointer into the local memory berr (local output) real array of local dimension locc(jb+nrhs-1). the componentwise Relative backwar lative change in any entry of sub( a ) or sub( b ) berr (local output) real array, dimension (loc(n_b)) the componentwise Relative backward error of each solutio any entry of a or b that makes x(j) an exact solution). number. the effect is that the eigenvalues may not be as accurate as the absolute and Relative which is less accurate than pslamch says. see "computing small singular values of bidiagonal matrices with guaranteed high Relative accuracy," by demmel an see "computing small singular values of bidiagonal matrices with guaranteed high Relative accuracy," by demmel an berr (local output) real array of local dimension locc(jb+nrhs-1). the componentwise Relative backwar lative change in any entry of sub( a ) or sub( b ) berr (local output) double precision array of local dimension locc(jb+nrhs-1). the componentwise Relative backwar lative change in any entry of sub( a ) or sub( b ) berr (local output) double precision array, dimension locc(n_b). the componentwise Relative backward error of each solutio any entry of a(ia:ia+n-1,ja:ja+n-1) or see "computing small singular values of bidiagonal matrices with guaranteed high Relative accuracy," by demmel an see "computing small singular values of bidiagonal matrices with guaranteed high Relative accuracy," by demmel an berr (local output) double precision array of local dimension locc(jb+nrhs-1). the componentwise Relative backwar lative change in any entry of sub( a ) or sub( b ) berr (local output) double precision array, dimension (loc(n_b)) the componentwise Relative backward error of each solutio any entry of a or b that makes x(j) an exact solution). berr (local output) double precision array of local dimension locc(jb+nrhs-1). the componentwise Relative backwar lative change in any entry of sub( a ) or sub( b ) if side = 'r', 1 <= ilo <= ihi <= max(1,n); ilo and ihi are Relative indexes a (local input) complex*16 pointer into the local memory |
| relatively relatively if eigenvalues j and j-1 are too close, add a relatively convergence of a double shift if their product is small relatively even if each is not very small. thus it i the lapack algorithm zlahqr, a loop of m goes from i-2 down to convergence of a double shift if their product is small relatively even if each is not very small. thus it i the lapack algorithm dlahqr, a loop of m goes from i-2 down to convergence of a double shift if their product is small relatively even if each is not very small. thus it i the lapack algorithm dlahqr, a loop of m goes from i-2 down to convergence of a double shift if their product is small relatively even if each is not very small. thus it i the lapack algorithm zlahqr, a loop of m goes from i-2 down to if eigenvalues j and j-1 are too close, add a relatively |
| release release pxyytevx.f and pxyytgvx.f and pxyyttrd.f are the only codes which call pjlaenv in this release. pxyytevx.f and pxyytgvx.f redistribut uses a data layout blocking factor of 1 and a |
| released released current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== arithmetic, this needs to be larger. the default for publicly released versions should be large enough to handl on the accuracy of the solution. current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== arithmetic, this needs to be larger. the default for publicly released versions should be large enough to handl on the accuracy of the solution. current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== current address: lawrence livermore national labs. this version released: august, 2001 ===================================================================== |
| releases releases the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed in future releases. -andy cleary, april 14, 1996 block sizes must be the same the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed in future releases. -andy cleary, april 14, 1996 block sizes must be the same the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed in future releases. -andy cleary, april 14, 1996 block sizes must be the same the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed in future releases. -andy cleary, april 14, 1996 block sizes must be the same the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed in future releases. -andy cleary, april 14, 1996 block sizes must be the same the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed in future releases. -andy cleary, april 14, 1996 block sizes must be the same the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed in future releases. -andy cleary, april 14, 1996 block sizes must be the same the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed in future releases. -andy cleary, april 14, 1996 block sizes must be the same the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed in future releases. -andy cleary, april 14, 1996 block sizes must be the same the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed in future releases. -andy cleary, april 14, 1996 block sizes must be the same the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed in future releases. -andy cleary, april 14, 1996 block sizes must be the same the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed in future releases. -andy cleary, april 14, 1996 block sizes must be the same the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed in future releases. -andy cleary, april 14, 1996 block sizes must be the same the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed in future releases. -andy cleary, april 14, 1996 block sizes must be the same the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed in future releases. -andy cleary, april 14, 1996 block sizes must be the same the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed in future releases. -andy cleary, april 14, 1996 block sizes must be the same |
| relevant relevant adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat adjust addressing into matrix space to properly get into the beginning part of the relevant dat |
| RELFAC RELFAC RELFAC double precision, default = 2. "relative tolerance" if b-a < relfac*ulp*max(|a|,|b|), RELFAC real, default = 2. "relative tolerance" if b-a < relfac*ulp*max(|a|,|b|), |
| reliable reliable divided by the magnitude of the largest element in sub( x ). the estimate is as reliable as the estimate for rcond, an this array is tied to the distributed matrix x. (x(j) - xtrue) divided by the magnitude of the largest entry in x(j). the estimate is as reliable as the estimate fo true error. ferr is replicated in every process row, and is divided by the magnitude of the largest element in sub( x ). the estimate is as reliable as the estimate for rcond, an this array is tied to the distributed matrix x. in (sub( x ) - xtrue) divided by the magnitude of the largest entry in sub( x ). the estimate is as reliable a overestimate of the true error. divided by the magnitude of the largest element in sub( x ). the estimate is as reliable as the estimate for rcond, an this array is tied to the distributed matrix x. (x(j) - xtrue) divided by the magnitude of the largest entry in x(j). the estimate is as reliable as the estimate fo true error. ferr is replicated in every process row, and is divided by the magnitude of the largest element in sub( x ). the estimate is as reliable as the estimate for rcond, an this array is tied to the distributed matrix x. in (sub( x ) - xtrue) divided by the magnitude of the largest entry in sub( x ). the estimate is as reliable a overestimate of the true error. divided by the magnitude of the largest element in sub( x ). the estimate is as reliable as the estimate for rcond, an this array is tied to the distributed matrix x. (x(j) - xtrue) divided by the magnitude of the largest entry in x(j). the estimate is as reliable as the estimate fo true error. ferr is replicated in every process row, and is divided by the magnitude of the largest element in sub( x ). the estimate is as reliable as the estimate for rcond, an this array is tied to the distributed matrix x. in (sub( x ) - xtrue) divided by the magnitude of the largest entry in sub( x ). the estimate is as reliable a overestimate of the true error. divided by the magnitude of the largest element in sub( x ). the estimate is as reliable as the estimate for rcond, an this array is tied to the distributed matrix x. (x(j) - xtrue) divided by the magnitude of the largest entry in x(j). the estimate is as reliable as the estimate fo true error. ferr is replicated in every process row, and is divided by the magnitude of the largest element in sub( x ). the estimate is as reliable as the estimate for rcond, an this array is tied to the distributed matrix x. in (sub( x ) - xtrue) divided by the magnitude of the largest entry in sub( x ). the estimate is as reliable a overestimate of the true error. |
| RELTOL RELTOL the minimum (absolute) width of an interval. when an interval is narrower than abstol, or than RELTOL times the larger (i small, i.e., converged. = 0 : when an interval is narrower than abstol, or than RELTOL times the larger (in magnitude) endpoint, the = 1 : when an interval is narrower than abstol, or than the minimum (absolute) width of an interval. when an interval is narrower than abstol, or than RELTOL times the larger (i small, i.e., converged. = 0 : when an interval is narrower than abstol, or than RELTOL times the larger (in magnitude) endpoint, the = 1 : when an interval is narrower than abstol, or than |
| remainder remainder use partial factors to update remainder use partial factors to update remainder use partial factors to update remainder use partial factors to update remainder |
| remaining remaining if remaining matrix is 2-by-2, use slae2 or slaev if remaining matrix is 2-by-2, use dlae2 or slaev the (n-m)-th superdiagonal contain the m by n lower trapezoidal matrix l; the remaining elements, with th elementary reflectors (see further details). the (n-m)-th superdiagonal contain the m by n lower trapezoidal matrix l; the remaining elements, with th elementary reflectors (see further details). and above the (m-n)-th subdiagonal contain the m by n upper trapezoidal matrix r; the remaining elements, with the arra elementary reflectors (see further details). and above the (m-n)-th subdiagonal contain the m by n upper trapezoidal matrix r; the remaining elements, with the arra elementary reflectors (see further details). and above the (n-p)-th subdiagonal contain the n by p upper trapezoidal matrix t; the remaining elements, with the arra elementary reflectors (see further details). and above the (m-n)-th subdiagonal contain the m by n upper trapezoidal matrix r; the remaining elements, with the arra elementary reflectors (see further details). grow as the square of the cluster size, all other factors remaining equal and assuming enough workspace. les execution. grow as the square of the cluster size, all other factors remaining equal and assuming enough workspace. les execution. loop over the remaining rows/columns of the matrix loop over remaining block of column loop over the remaining rows/columns of the matrix loop over remaining block of column the (n-m)-th superdiagonal contain the m by n lower trapezoidal matrix l; the remaining elements, with th elementary reflectors (see further details). the (n-m)-th superdiagonal contain the m by n lower trapezoidal matrix l; the remaining elements, with th elementary reflectors (see further details). and above the (m-n)-th subdiagonal contain the m by n upper trapezoidal matrix r; the remaining elements, with the arra elementary reflectors (see further details). and above the (m-n)-th subdiagonal contain the m by n upper trapezoidal matrix r; the remaining elements, with the arra elementary reflectors (see further details). and above the (n-p)-th subdiagonal contain the n by p upper trapezoidal matrix t; the remaining elements, with the arra elementary reflectors (see further details). and above the (m-n)-th subdiagonal contain the m by n upper trapezoidal matrix r; the remaining elements, with the arra elementary reflectors (see further details). loop over remaining block of column loop over the remaining rows/columns of the matrix loop over remaining block of column grow as the square of the cluster size, all other factors remaining equal and assuming enough workspace. les execution. grow as the square of the cluster size, all other factors remaining equal and assuming enough workspace. les execution. the (n-m)-th superdiagonal contain the m by n lower trapezoidal matrix l; the remaining elements, with th elementary reflectors (see further details). the (n-m)-th superdiagonal contain the m by n lower trapezoidal matrix l; the remaining elements, with th elementary reflectors (see further details). and above the (m-n)-th subdiagonal contain the m by n upper trapezoidal matrix r; the remaining elements, with the arra elementary reflectors (see further details). and above the (m-n)-th subdiagonal contain the m by n upper trapezoidal matrix r; the remaining elements, with the arra elementary reflectors (see further details). and above the (n-p)-th subdiagonal contain the n by p upper trapezoidal matrix t; the remaining elements, with the arra elementary reflectors (see further details). and above the (m-n)-th subdiagonal contain the m by n upper trapezoidal matrix r; the remaining elements, with the arra elementary reflectors (see further details). loop over remaining block of column loop over the remaining rows/columns of the matrix loop over remaining block of column grow as the square of the cluster size, all other factors remaining equal and assuming enough workspace. les execution. grow as the square of the cluster size, all other factors remaining equal and assuming enough workspace. les execution. the (n-m)-th superdiagonal contain the m by n lower trapezoidal matrix l; the remaining elements, with th elementary reflectors (see further details). the (n-m)-th superdiagonal contain the m by n lower trapezoidal matrix l; the remaining elements, with th elementary reflectors (see further details). and above the (m-n)-th subdiagonal contain the m by n upper trapezoidal matrix r; the remaining elements, with the arra elementary reflectors (see further details). and above the (m-n)-th subdiagonal contain the m by n upper trapezoidal matrix r; the remaining elements, with the arra elementary reflectors (see further details). and above the (n-p)-th subdiagonal contain the n by p upper trapezoidal matrix t; the remaining elements, with the arra elementary reflectors (see further details). and above the (m-n)-th subdiagonal contain the m by n upper trapezoidal matrix r; the remaining elements, with the arra elementary reflectors (see further details). grow as the square of the cluster size, all other factors remaining equal and assuming enough workspace. les execution. grow as the square of the cluster size, all other factors remaining equal and assuming enough workspace. les execution. loop over the remaining rows/columns of the matrix loop over remaining block of column loop over the remaining rows/columns of the matrix loop over remaining block of column if remaining matrix is 2-by-2, use slae2 or slaev if remaining matrix is 2-by-2, use dlae2 or dlaev |
| remedy remedy overlap over several processors and the code gets very "congested." as a remedy, when we first hit a border, a 6x work is done on that. at the end of the border, the data is overlap over several processors and the code gets very "congested." as a remedy, when we first hit a border, a 6x work is done on that. at the end of the border, the data is overlap over several processors and the code gets very "congested." as a remedy, when we first hit a border, a 6x work is done on that. at the end of the border, the data is overlap over several processors and the code gets very "congested." as a remedy, when we first hit a border, a 6x work is done on that. at the end of the border, the data is |
| removed removed the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other the following are restrictions on the input parameters. some of these are temporary and will be removed in future releases, while other these are alignment restrictions that may or may not be removed |
| Ren Ren if range='v', the lower bound of the interval to be searched for eigenvalues. not refeRenced if range = 'a' or 'i' vu (global input) real if range='v', the lower bound of the interval to be searched for eigenvalues. not refeRenced if range = 'a' or 'i' vu (global input) real if range='v', the lower bound of the interval to be searched for eigenvalues. not refeRenced if range = 'a' or 'i' vu (global input) double precision if range='v', the lower bound of the interval to be searched for eigenvalues. not refeRenced if range = 'a' or 'i' vu (global input) double precision if range='v', the lower bound of the interval to be searched for eigenvalues. not refeRenced if range = 'a' or 'i' vu (global input) real if range='v', the lower bound of the interval to be searched for eigenvalues. not refeRenced if range = 'a' or 'i' vu (global input) real if range='v', the lower bound of the interval to be searched for eigenvalues. not refeRenced if range = 'a' or 'i' vu (global input) double precision if range='v', the lower bound of the interval to be searched for eigenvalues. not refeRenced if range = 'a' or 'i' vu (global input) double precision |
| reordered reordered if ijob = 2, not referenced. this array will, in general, be reordered on output intvl (input/output) double precision array, dimension (2*mmax) i.e., on output, all intervals [ intvl(2*i-1), intvl(2*i) ], i < kf, have converged. note that the input intervals may be reordered b if ijob = 2, not referenced. this array will, in general, be reordered on output intvl (input/output) real array, dimension (2*mmax) i.e., on output, all intervals [ intvl(2*i-1), intvl(2*i) ], i < kf, have converged. note that the input intervals may be reordered b |
| reordering reordering gaussian elimination without pivoting is used to factor a reordering fillin, which is stored in a non-inspectable way in auxiliary space af. mathematically, this is equivalent to reordering leading submatrix of size equal to the sum of the sizes of gaussian elimination without pivoting is used to factor a reordering fillin, which is stored in a non-inspectable way in auxiliary space af. mathematically, this is equivalent to reordering leading submatrix of size equal to the sum of the sizes of gaussian elimination with pivoting is used to factor a reordering fillin, which is stored in a non-inspectable way in auxiliary space af. mathematically, this is equivalent to reordering leading submatrix of size equal to the sum of the sizes of cholesky factorization is used to factor a reordering o fillin, which is stored in a non-inspectable way in auxiliary space af. mathematically, this is equivalent to reordering leading submatrix of size equal to the sum of the sizes of cholesky factorization is used to factor a reordering o fillin, which is stored in a non-inspectable way in auxiliary space af. mathematically, this is equivalent to reordering leading submatrix of size equal to the sum of the sizes of gaussian elimination without pivoting is used to factor a reordering fillin, which is stored in a non-inspectable way in auxiliary space af. mathematically, this is equivalent to reordering leading submatrix of size equal to the sum of the sizes of gaussian elimination without pivoting is used to factor a reordering fillin, which is stored in a non-inspectable way in auxiliary space af. mathematically, this is equivalent to reordering leading submatrix of size equal to the sum of the sizes of gaussian elimination with pivoting is used to factor a reordering fillin, which is stored in a non-inspectable way in auxiliary space af. mathematically, this is equivalent to reordering leading submatrix of size equal to the sum of the sizes of cholesky factorization is used to factor a reordering o fillin, which is stored in a non-inspectable way in auxiliary space af. mathematically, this is equivalent to reordering leading submatrix of size equal to the sum of the sizes of cholesky factorization is used to factor a reordering o fillin, which is stored in a non-inspectable way in auxiliary space af. mathematically, this is equivalent to reordering leading submatrix of size equal to the sum of the sizes of gaussian elimination without pivoting is used to factor a reordering fillin, which is stored in a non-inspectable way in auxiliary space af. mathematically, this is equivalent to reordering leading submatrix of size equal to the sum of the sizes of gaussian elimination without pivoting is used to factor a reordering fillin, which is stored in a non-inspectable way in auxiliary space af. mathematically, this is equivalent to reordering leading submatrix of size equal to the sum of the sizes of gaussian elimination with pivoting is used to factor a reordering fillin, which is stored in a non-inspectable way in auxiliary space af. mathematically, this is equivalent to reordering leading submatrix of size equal to the sum of the sizes of cholesky factorization is used to factor a reordering o fillin, which is stored in a non-inspectable way in auxiliary space af. mathematically, this is equivalent to reordering leading submatrix of size equal to the sum of the sizes of cholesky factorization is used to factor a reordering o fillin, which is stored in a non-inspectable way in auxiliary space af. mathematically, this is equivalent to reordering leading submatrix of size equal to the sum of the sizes of gaussian elimination without pivoting is used to factor a reordering fillin, which is stored in a non-inspectable way in auxiliary space af. mathematically, this is equivalent to reordering leading submatrix of size equal to the sum of the sizes of gaussian elimination without pivoting is used to factor a reordering fillin, which is stored in a non-inspectable way in auxiliary space af. mathematically, this is equivalent to reordering leading submatrix of size equal to the sum of the sizes of gaussian elimination with pivoting is used to factor a reordering fillin, which is stored in a non-inspectable way in auxiliary space af. mathematically, this is equivalent to reordering leading submatrix of size equal to the sum of the sizes of cholesky factorization is used to factor a reordering o fillin, which is stored in a non-inspectable way in auxiliary space af. mathematically, this is equivalent to reordering leading submatrix of size equal to the sum of the sizes of cholesky factorization is used to factor a reordering o fillin, which is stored in a non-inspectable way in auxiliary space af. mathematically, this is equivalent to reordering leading submatrix of size equal to the sum of the sizes of |
| reorthogonalization reorthogonalization compute reorthogonalization criterion and stopping criterion reorthogonalized can be stored in one process. no reorthogonalization will be done if orfac equals zero orfac should be identical on all processes. reorthogonalized can be stored in one process. no reorthogonalization will be done if orfac equals zero orfac should be identical on all processes. reorthogonalized can be stored in one process. no reorthogonalization will be done if orfac equals zero orfac should be identical on all processes. reorthogonalized can be stored in one process. no reorthogonalization will be done if orfac equals zero orfac should be identical on all processes. reorthogonalized can be stored in one process. no reorthogonalization will be done if orfac equals zero orfac should be identical on all processes. reorthogonalized can be stored in one process. no reorthogonalization will be done if orfac equals zero orfac should be identical on all processes. reorthogonalized can be stored in one process. no reorthogonalization will be done if orfac equals zero orfac should be identical on all processes. reorthogonalized can be stored in one process. no reorthogonalization will be done if orfac equals zero orfac should be identical on all processes. compute reorthogonalization criterion and stopping criterion |
| reorthogonalize reorthogonalize reorthogonalize by modified gram-schmidt if eigenvalues ar orfac (global input) real specifies which eigenvectors should be reorthogonalized tol=orfac*norm(a) of each other are to be reorthogonalized. orfac (global input) double precision specifies which eigenvectors should be reorthogonalized tol=orfac*norm(a) of each other are to be reorthogonalized. orfac (global input) real specifies which eigenvectors should be reorthogonalized tol=orfac*norm(a) of each other are to be reorthogonalized. orfac (global input) double precision specifies which eigenvectors should be reorthogonalized tol=orfac*norm(a) of each other are to be reorthogonalized. reorthogonalize by modified gram-schmidt if eigenvalues ar |
| reorthogonalized reorthogonalized orfac (global input) real specifies which eigenvectors should be reorthogonalized tol=orfac*norm(a) of each other are to be reorthogonalized. orfac (global input) real specifies which eigenvectors should be reorthogonalized tol=orfac*norm(a) of each other are to be reorthogonalized. orfac (global input) double precision specifies which eigenvectors should be reorthogonalized tol=orfac*norm(a) of each other are to be reorthogonalized. orfac (global input) double precision specifies which eigenvectors should be reorthogonalized tol=orfac*norm(a) of each other are to be reorthogonalized. orfac (global input) real specifies which eigenvectors should be reorthogonalized tol=orfac*norm(a) of each other are to be reorthogonalized. orfac (global input) real specifies which eigenvectors should be reorthogonalized tol=orfac*norm(a) of each other are to be reorthogonalized. orfac (global input) double precision specifies which eigenvectors should be reorthogonalized tol=orfac*norm(a) of each other are to be reorthogonalized. orfac (global input) double precision specifies which eigenvectors should be reorthogonalized tol=orfac*norm(a) of each other are to be reorthogonalized. |
| reorthogonalizing reorthogonalizing processor. for clustersize = n/sqrt(nprow*npcol) reorthogonalizing by a factor of 2 or more. pcstein will perform no better than cstein on 1 processor. for clustersize = n/sqrt(nprow*npcol) reorthogonalizing by a factor of 2 or more. processor. for clustersize = n/sqrt(nprow*npcol) reorthogonalizing by a factor of 2 or more. pdstein will perform no better than dstein on 1 processor. for clustersize = n/sqrt(nprow*npcol) reorthogonalizing by a factor of 2 or more. processor. for clustersize = n/sqrt(nprow*npcol) reorthogonalizing by a factor of 2 or more. psstein will perform no better than sstein on 1 processor. for clustersize = n/sqrt(nprow*npcol) reorthogonalizing by a factor of 2 or more. processor. for clustersize = n/sqrt(nprow*npcol) reorthogonalizing by a factor of 2 or more. pzstein will perform no better than zstein on 1 processor. for clustersize = n/sqrt(nprow*npcol) reorthogonalizing by a factor of 2 or more. |
| repaired repaired on entry,the eigenvalues of the rank-1-perturbed matrix. on exit, the eigenvalues of the repaired matrix id (global input) integer on entry,the eigenvalues of the rank-1-perturbed matrix. on exit, the eigenvalues of the repaired matrix id (global input) integer |
| replaced replaced = 'b': both row and column equilibration, i.e., a(ia:ia+n-1,ja:ja+n-1) has been replaced b equed is an input variable if fact = 'f'; otherwise, it is an = 'b': both row and column equilibration, i.e., sub( a ) has been replaced b = 'n': no equilibration (always true if fact = 'n'). = 'y': equilibration was done, i.e., a has been replaced b equed is an input variable if fact = 'f'; otherwise, it is an = 'b': both row and column equilibration, i.e., a(ia:ia+n-1,ja:ja+n-1) has been replaced b equed is an input variable if fact = 'f'; otherwise, it is an = 'b': both row and column equilibration, i.e., sub( a ) has been replaced b = 'n': no equilibration (always true if fact = 'n'). = 'y': equilibration was done, i.e., a has been replaced b equed is an input variable if fact = 'f'; otherwise, it is an = 'b': both row and column equilibration, i.e., a(ia:ia+n-1,ja:ja+n-1) has been replaced b equed is an input variable if fact = 'f'; otherwise, it is an = 'b': both row and column equilibration, i.e., sub( a ) has been replaced b = 'n': no equilibration (always true if fact = 'n'). = 'y': equilibration was done, i.e., a has been replaced b equed is an input variable if fact = 'f'; otherwise, it is an = 'b': both row and column equilibration, i.e., a(ia:ia+n-1,ja:ja+n-1) has been replaced b equed is an input variable if fact = 'f'; otherwise, it is an = 'b': both row and column equilibration, i.e., sub( a ) has been replaced b = 'n': no equilibration (always true if fact = 'n'). = 'y': equilibration was done, i.e., a has been replaced b equed is an input variable if fact = 'f'; otherwise, it is an |
| replicated replicated scale factors for sub( a ). r is aligned with the distributed matrix a, and replicated across every process column. r i be positive. r is replicated in every process column, and is aligne arrays v and h are replicated across all processor columns pclacp3 is an auxiliary routine that copies from a global parallel array into a local replicated array or vise versa. notice tha more. the receiving node can be specified precisely, or all nodes local memory to an array of dimension (locc(ja+n-1)). on output, a is replicated across all processes i pivoting the rows of sub( a ), ipiv should be distributed along a process column and replicated over all process rows. similarly all process columns for column pivoting. the row scale factors for sub( a ). r is aligned with the distributed matrix a, and replicated across every proces the scale factors for a(ia:ia+m-1,ja:ja+n-1). sr is aligned with the distributed matrix a, and replicated across ever for sub( a ). sr is aligned with the distributed matrix a, and replicated across every process column. sr is tied to th w from psstebz with order='b' is expected here). this array should be replicated on all processes eigenvalues in ascending order. scale factors for sub( a ). r is aligned with the distributed matrix a, and replicated across every process column. r i be positive. r is replicated in every process column, and is aligne pdlacp3 is an auxiliary routine that copies from a global parallel array into a local replicated array or vise versa. notice tha more. the receiving node can be specified precisely, or all nodes local memory to an array of dimension (locc(ja+n-1)). on output, a is replicated across all processes i pivoting the rows of sub( a ), ipiv should be distributed along a process column and replicated over all process rows. similarly all process columns for column pivoting. the row scale factors for sub( a ). r is aligned with the distributed matrix a, and replicated across every proces the scale factors for a(ia:ia+m-1,ja:ja+n-1). sr is aligned with the distributed matrix a, and replicated across ever byall is exactly duplicated on all processes it contains the same values as bycol, but it is replicated byall is exactly duplicated on all processes it contains the same values as byrow, but it is replicated for sub( a ). sr is aligned with the distributed matrix a, and replicated across every process column. sr is tied to th w from pdstebz with order='b' is expected here). this array should be replicated on all processes eigenvalues in ascending order. arrays v and h are replicated across all processor columns scale factors for sub( a ). r is aligned with the distributed matrix a, and replicated across every process column. r i be positive. r is replicated in every process column, and is aligne pslacp3 is an auxiliary routine that copies from a global parallel array into a local replicated array or vise versa. notice tha more. the receiving node can be specified precisely, or all nodes local memory to an array of dimension (locc(ja+n-1)). on output, a is replicated across all processes i pivoting the rows of sub( a ), ipiv should be distributed along a process column and replicated over all process rows. similarly all process columns for column pivoting. the row scale factors for sub( a ). r is aligned with the distributed matrix a, and replicated across every proces the scale factors for a(ia:ia+m-1,ja:ja+n-1). sr is aligned with the distributed matrix a, and replicated across ever byall is exactly duplicated on all processes it contains the same values as bycol, but it is replicated byall is exactly duplicated on all processes it contains the same values as byrow, but it is replicated for sub( a ). sr is aligned with the distributed matrix a, and replicated across every process column. sr is tied to th w from psstebz with order='b' is expected here). this array should be replicated on all processes eigenvalues in ascending order. arrays v and h are replicated across all processor columns scale factors for sub( a ). r is aligned with the distributed matrix a, and replicated across every process column. r i be positive. r is replicated in every process column, and is aligne arrays v and h are replicated across all processor columns pzlacp3 is an auxiliary routine that copies from a global parallel array into a local replicated array or vise versa. notice tha more. the receiving node can be specified precisely, or all nodes local memory to an array of dimension (locc(ja+n-1)). on output, a is replicated across all processes i pivoting the rows of sub( a ), ipiv should be distributed along a process column and replicated over all process rows. similarly all process columns for column pivoting. the row scale factors for sub( a ). r is aligned with the distributed matrix a, and replicated across every proces the scale factors for a(ia:ia+m-1,ja:ja+n-1). sr is aligned with the distributed matrix a, and replicated across ever for sub( a ). sr is aligned with the distributed matrix a, and replicated across every process column. sr is tied to th w from pdstebz with order='b' is expected here). this array should be replicated on all processes eigenvalues in ascending order. |
| Report Report see w. kahan "accurate eigenvalues of a symmetric tridiagonal matrix", Report cs41, computer science dept., stanfor see w. kahan "accurate eigenvalues of a symmetric tridiagonal matrix", Report cs41, computer science dept., stanfor |
| reporting reporting if desca( ctxt_ ) is incorrect, pcheev cannot guarantee correct error reporting w (global output) real array, dimension (n) if desca( ctxt_ ) is incorrect, pcheevd cannot guarantee correct error reporting w (global output) real array, dimension (n) if desca( ctxt_ ) is incorrect, pcheevx cannot guarantee correct error reporting vl (global input) real if desca( ctxt_ ) is incorrect, pchegvx cannot guarantee correct error reporting b (local input/local output) complex pointer into the if desca( ctxt_ ) is incorrect, pdsyev cannot guarantee correct error reporting w (global output) double precision array, dimension (n) if desca( ctxt_ ) is incorrect, pdsyevx cannot guarantee correct error reporting vl (global input) double precision if desca( ctxt_ ) is incorrect, pdsygvx cannot guarantee correct error reporting b (local input/local output) double precision pointer into the if desca( ctxt_ ) is incorrect, pssyev cannot guarantee correct error reporting w (global output) real array, dimension (n) if desca( ctxt_ ) is incorrect, pssyevx cannot guarantee correct error reporting vl (global input) real if desca( ctxt_ ) is incorrect, pssygvx cannot guarantee correct error reporting b (local input/local output) real pointer into the if desca( ctxt_ ) is incorrect, pzheev cannot guarantee correct error reporting w (global output) double precision array, dimension (n) if desca( ctxt_ ) is incorrect, pzheev cannot guarantee correct error reporting w (global output) double precision array, dimension (n) if desca( ctxt_ ) is incorrect, pzheevx cannot guarantee correct error reporting vl (global input) double precision if desca( ctxt_ ) is incorrect, pzhegvx cannot guarantee correct error reporting b (local input/local output) complex*16 pointer into the |
| repre repre overwritten with the upper hessenberg matrix h, and the ele- ments below the first subdiagonal, with the array tau, repre reflectors. see further details. overwritten with the upper hessenberg matrix h, and the ele- ments below the first subdiagonal, with the array tau, repre reflectors. see further details. lower trapezoidal matrix l (l is lower triangular if m <= n); the elements above the diagonal, with the array tau, repre reflectors (see further details). lower trapezoidal matrix l (l is lower triangular if m <= n); the elements above the diagonal, with the array tau, repre reflectors (see further details). upper trapezoidal matrix r (r is upper triangular if m >= n); the elements below the diagonal, with the array tau, repre reflectors (see further details). overwritten with the upper hessenberg matrix h, and the ele- ments below the first subdiagonal, with the array tau, repre reflectors. see further details. overwritten with the upper hessenberg matrix h, and the ele- ments below the first subdiagonal, with the array tau, repre reflectors. see further details. lower trapezoidal matrix l (l is lower triangular if m <= n); the elements above the diagonal, with the array tau, repre reflectors (see further details). lower trapezoidal matrix l (l is lower triangular if m <= n); the elements above the diagonal, with the array tau, repre reflectors (see further details). upper trapezoidal matrix r (r is upper triangular if m >= n); the elements below the diagonal, with the array tau, repre reflectors (see further details). overwritten with the upper hessenberg matrix h, and the ele- ments below the first subdiagonal, with the array tau, repre reflectors. see further details. overwritten with the upper hessenberg matrix h, and the ele- ments below the first subdiagonal, with the array tau, repre reflectors. see further details. lower trapezoidal matrix l (l is lower triangular if m <= n); the elements above the diagonal, with the array tau, repre reflectors (see further details). lower trapezoidal matrix l (l is lower triangular if m <= n); the elements above the diagonal, with the array tau, repre reflectors (see further details). upper trapezoidal matrix r (r is upper triangular if m >= n); the elements below the diagonal, with the array tau, repre reflectors (see further details). overwritten with the upper hessenberg matrix h, and the ele- ments below the first subdiagonal, with the array tau, repre reflectors. see further details. overwritten with the upper hessenberg matrix h, and the ele- ments below the first subdiagonal, with the array tau, repre reflectors. see further details. lower trapezoidal matrix l (l is lower triangular if m <= n); the elements above the diagonal, with the array tau, repre reflectors (see further details). lower trapezoidal matrix l (l is lower triangular if m <= n); the elements above the diagonal, with the array tau, repre reflectors (see further details). upper trapezoidal matrix r (r is upper triangular if m >= n); the elements below the diagonal, with the array tau, repre reflectors (see further details). |
| represent represent overwritten with the upper bidiagonal matrix b; the elements below the diagonal, with the array tauq, represent th the elements above the first superdiagonal, with the array overwritten with the upper bidiagonal matrix b; the elements below the diagonal, with the array tauq, represent th the elements above the first superdiagonal, with the array trapezoidal matrix l; the remaining elements, with the array tau, represent the unitary matrix q as a product o trapezoidal matrix l; the remaining elements, with the array tau, represent the unitary matrix q as a product o the elements below the diagonal, with the array tau, represent the unitary matrix q as a product of elementar the elements below the diagonal, with the array tau, represent the unitary matrix q as a product of elementar trapezoidal matrix r; the remaining elements, with the array tau, represent the unitary matrix q as a product o trapezoidal matrix r; the remaining elements, with the array tau, represent the unitary matrix q as a product o the elements below the diagonal, with the array taua, represent the unitary matrix q as a product of min(n,m trapezoidal matrix r; the remaining elements, with the array taua, represent the unitary matrix q as a product o matrix t, and the elements above the first superdiagonal, with the array tau, represent the unitary matrix q as and first subdiagonal of sub( a ) are overwritten by the matrix t, and the elements above the first superdiagonal, with the array tau, represent the unitary matrix q as and first subdiagonal of sub( a ) are overwritten by the matrix t, and the elements above the first superdiagonal, with the array tau, represent the unitary matrix q as and first subdiagonal of sub( a ) are overwritten by the matrix t, and the elements above the first superdiagonal, with the array tau, represent the unitary matrix q as and first subdiagonal of sub( a ) are overwritten by the if m >= n, elements on and below the diagonal in the first nb columns, with the array tauq, represent the unitar elements above the diagonal in the first nb rows, with the matrix; the elements below the k-th subdiagonal, with the array tau, represent the matrix q as a product of elementar unchanged. see further details. the diagonal elements of sub( a ); the elements above the diagonal with the array tau, represent the unitary matrix first nb columns have been reduced to tridiagonal form, with gular matrix r, and elements n-l+1 to n of the first m rows of sub( a ), with the array tau, represent the unitary matri gular matrix r, and elements m+1 to n of the first m rows of sub( a ), with the array tau, represent the unitary matrix overwritten with the upper bidiagonal matrix b; the elements below the diagonal, with the array tauq, represent th and the elements above the first superdiagonal, with the overwritten with the upper bidiagonal matrix b; the elements below the diagonal, with the array tauq, represent th and the elements above the first superdiagonal, with the trapezoidal matrix l; the remaining elements, with the array tau, represent the orthogonal matrix q as a product o trapezoidal matrix l; the remaining elements, with the array tau, represent the orthogonal matrix q as a product o the elements below the diagonal, with the array tau, represent the orthogonal matrix q as a product of elementar the elements below the diagonal, with the array tau, represent the orthogonal matrix q as a product of elementar trapezoidal matrix r; the remaining elements, with the array tau, represent the orthogonal matrix q as a product o trapezoidal matrix r; the remaining elements, with the array tau, represent the orthogonal matrix q as a product o the elements below the diagonal, with the array taua, represent the orthogonal matrix q as a product of min(n,m trapezoidal matrix r; the remaining elements, with the array taua, represent the orthogonal matrix q as a product o if m >= n, elements on and below the diagonal in the first nb columns, with the array tauq, represent the orthogona elements above the diagonal in the first nb rows, with the matrix; the elements below the k-th subdiagonal, with the array tau, represent the matrix q as a product of elementar unchanged. see further details. the diagonal elements of sub( a ); the elements above the diagonal with the array tau, represent the orthogonal matri first nb columns have been reduced to tridiagonal form, with gular matrix r, and elements n-l+1 to n of the first m rows of sub( a ), with the array tau, represent the orthogona matrix t, and the elements above the first superdiagonal, with the array tau, represent the orthogonal matrix q as and first subdiagonal of sub( a ) are overwritten by the matrix t, and the elements above the first superdiagonal, with the array tau, represent the orthogonal matrix q as and first subdiagonal of sub( a ) are overwritten by the matrix t, and the elements above the first superdiagonal, with the array tau, represent the orthogonal matrix q as and first subdiagonal of sub( a ) are overwritten by the matrix t, and the elements above the first superdiagonal, with the array tau, represent the unitary matrix q as and first subdiagonal of sub( a ) are overwritten by the gular matrix r, and elements m+1 to n of the first m rows of sub( a ), with the array tau, represent the orthogonal matri overwritten with the upper bidiagonal matrix b; the elements below the diagonal, with the array tauq, represent th and the elements above the first superdiagonal, with the overwritten with the upper bidiagonal matrix b; the elements below the diagonal, with the array tauq, represent th and the elements above the first superdiagonal, with the trapezoidal matrix l; the remaining elements, with the array tau, represent the orthogonal matrix q as a product o trapezoidal matrix l; the remaining elements, with the array tau, represent the orthogonal matrix q as a product o the elements below the diagonal, with the array tau, represent the orthogonal matrix q as a product of elementar the elements below the diagonal, with the array tau, represent the orthogonal matrix q as a product of elementar trapezoidal matrix r; the remaining elements, with the array tau, represent the orthogonal matrix q as a product o trapezoidal matrix r; the remaining elements, with the array tau, represent the orthogonal matrix q as a product o the elements below the diagonal, with the array taua, represent the orthogonal matrix q as a product of min(n,m trapezoidal matrix r; the remaining elements, with the array taua, represent the orthogonal matrix q as a product o if m >= n, elements on and below the diagonal in the first nb columns, with the array tauq, represent the orthogona elements above the diagonal in the first nb rows, with the matrix; the elements below the k-th subdiagonal, with the array tau, represent the matrix q as a product of elementar unchanged. see further details. the diagonal elements of sub( a ); the elements above the diagonal with the array tau, represent the orthogonal matri first nb columns have been reduced to tridiagonal form, with gular matrix r, and elements n-l+1 to n of the first m rows of sub( a ), with the array tau, represent the orthogona matrix t, and the elements above the first superdiagonal, with the array tau, represent the orthogonal matrix q as and first subdiagonal of sub( a ) are overwritten by the matrix t, and the elements above the first superdiagonal, with the array tau, represent the orthogonal matrix q as and first subdiagonal of sub( a ) are overwritten by the matrix t, and the elements above the first superdiagonal, with the array tau, represent the orthogonal matrix q as and first subdiagonal of sub( a ) are overwritten by the matrix t, and the elements above the first superdiagonal, with the array tau, represent the unitary matrix q as and first subdiagonal of sub( a ) are overwritten by the gular matrix r, and elements m+1 to n of the first m rows of sub( a ), with the array tau, represent the orthogonal matri overwritten with the upper bidiagonal matrix b; the elements below the diagonal, with the array tauq, represent th the elements above the first superdiagonal, with the array overwritten with the upper bidiagonal matrix b; the elements below the diagonal, with the array tauq, represent th the elements above the first superdiagonal, with the array trapezoidal matrix l; the remaining elements, with the array tau, represent the unitary matrix q as a product o trapezoidal matrix l; the remaining elements, with the array tau, represent the unitary matrix q as a product o the elements below the diagonal, with the array tau, represent the unitary matrix q as a product of elementar the elements below the diagonal, with the array tau, represent the unitary matrix q as a product of elementar trapezoidal matrix r; the remaining elements, with the array tau, represent the unitary matrix q as a product o trapezoidal matrix r; the remaining elements, with the array tau, represent the unitary matrix q as a product o the elements below the diagonal, with the array taua, represent the unitary matrix q as a product of min(n,m trapezoidal matrix r; the remaining elements, with the array taua, represent the unitary matrix q as a product o matrix t, and the elements above the first superdiagonal, with the array tau, represent the unitary matrix q as and first subdiagonal of sub( a ) are overwritten by the matrix t, and the elements above the first superdiagonal, with the array tau, represent the unitary matrix q as and first subdiagonal of sub( a ) are overwritten by the matrix t, and the elements above the first superdiagonal, with the array tau, represent the unitary matrix q as and first subdiagonal of sub( a ) are overwritten by the matrix t, and the elements above the first superdiagonal, with the array tau, represent the unitary matrix q as and first subdiagonal of sub( a ) are overwritten by the if m >= n, elements on and below the diagonal in the first nb columns, with the array tauq, represent the unitar elements above the diagonal in the first nb rows, with the matrix; the elements below the k-th subdiagonal, with the array tau, represent the matrix q as a product of elementar unchanged. see further details. the diagonal elements of sub( a ); the elements above the diagonal with the array tau, represent the unitary matrix first nb columns have been reduced to tridiagonal form, with gular matrix r, and elements n-l+1 to n of the first m rows of sub( a ), with the array tau, represent the unitary matri gular matrix r, and elements m+1 to n of the first m rows of sub( a ), with the array tau, represent the unitary matrix |
| representation representation if storev = 'r' and nb_v by nb_v if storev = 'c'. the trian- gular matrix t in the representation of the block reflector c (local input/local output) complex pointer into the t (local input) complex array, dimension mb_v by mb_v the lower triangular matrix t in the representation of th if storev = 'r' and nb_v by nb_v if storev = 'c'. the trian- gular matrix t in the representation of the block reflector c (local input/local output) double precision pointer into the t (local input) double precision array, dimension mb_v by mb_v the lower triangular matrix t in the representation of th if storev = 'r' and nb_v by nb_v if storev = 'c'. the trian- gular matrix t in the representation of the block reflector c (local input/local output) real pointer into the t (local input) real array, dimension mb_v by mb_v the lower triangular matrix t in the representation of th if storev = 'r' and nb_v by nb_v if storev = 'c'. the trian- gular matrix t in the representation of the block reflector c (local input/local output) complex*16 pointer into the t (local input) complex*16 array, dimension mb_v by mb_v the lower triangular matrix t in the representation of th |
| represented represented important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type the matrices q and p are represented as products of elementar the matrices q and p are represented as products of elementar the matrix q is represented as a product of (ihi-ilo) elementar the matrix q is represented as a product of (ihi-ilo) elementar the matrix q is represented as a product of elementary reflector q = h(ia+k-1)' h(ia+k-2)' . . . h(ia)', where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ia+k-1)' h(ia+k-2)' . . . h(ia)', where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ja+k-1) . . . h(ja+1) h(ja), where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ja+k-1) . . . h(ja+1) h(ja), where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(1) h(2) . . . h(n) the matrix q is represented as a product of elementary reflector q = h(ja) h(ja+1) . . . h(ja+k-1), where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ja) h(ja+1) . . . h(ja+k-1), where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ia)' h(ia+1)' . . . h(ia+k-1)', where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ia)' h(ia+1)' . . . h(ia+k-1)', where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ja) h(ja+1) . . . h(ja+k-1), where k = min(n,m). the matrix q is represented as a product of elementary reflector q = h(ia)' h(ia+1)' . . . h(ia+k-1)', where k = min(m,n). if uplo = 'u', the matrix q is represented as a product of elementar if uplo = 'u', the matrix q is represented as a product of elementar if uplo = 'u', the matrix q is represented as a product of elementar if uplo = 'u', the matrix q is represented as a product o the matrices q and p are represented as products of elementar the matrix q is represented as a product of nb elementary reflector q = h(1) h(2) . . . h(nb). complex distributed vector x(ix:ix+n-2,jx) if incx = 1 and x(ix,jx:jx+n-2) if incx = descx(m_). h is represented in the for h = i - tau * ( 1 ) * ( 1 v' ) , a(i,j) is computed without over/underflow if the final result cto * a(i,j) / cfrom can be represented withou if uplo = 'u', the matrix q is represented as a product of elementar important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type the matrices q and p are represented as products of elementar the matrices q and p are represented as products of elementar the matrix q is represented as a product of (ihi-ilo) elementar the matrix q is represented as a product of (ihi-ilo) elementar the matrix q is represented as a product of elementary reflector q = h(ia+k-1) h(ia+k-2) . . . h(ia), where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ia+k-1) h(ia+k-2) . . . h(ia), where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ja+k-1) . . . h(ja+1) h(ja), where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ja+k-1) . . . h(ja+1) h(ja), where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(1) h(2) . . . h(n) the matrix q is represented as a product of elementary reflector q = h(ja) h(ja+1) . . . h(ja+k-1), where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ja) h(ja+1) . . . h(ja+k-1), where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ia) h(ia+1) . . . h(ia+k-1), where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ia) h(ia+1) . . . h(ia+k-1), where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ja) h(ja+1) . . . h(ja+k-1), where k = min(n,m). the matrix q is represented as a product of elementary reflector q = h(ia) h(ia+1) . . . h(ia+k-1), where k = min(m,n). the matrices q and p are represented as products of elementar the matrix q is represented as a product of nb elementary reflector q = h(1) h(2) . . . h(nb). distributed vector x(ix:ix+n-2,jx) if incx = 1 and x(ix,jx:jx+n-2) if incx = descx(m_). h is represented in the for h = i - tau * ( 1 ) * ( 1 v' ) , a(i,j) is computed without over/underflow if the final result cto * a(i,j) / cfrom can be represented withou if uplo = 'u', the matrix q is represented as a product of elementar important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type if uplo = 'u', the matrix q is represented as a product of elementar if uplo = 'u', the matrix q is represented as a product of elementar if uplo = 'u', the matrix q is represented as a product of elementar if uplo = 'u', the matrix q is represented as a product o important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type the matrices q and p are represented as products of elementar the matrices q and p are represented as products of elementar the matrix q is represented as a product of (ihi-ilo) elementar the matrix q is represented as a product of (ihi-ilo) elementar the matrix q is represented as a product of elementary reflector q = h(ia+k-1) h(ia+k-2) . . . h(ia), where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ia+k-1) h(ia+k-2) . . . h(ia), where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ja+k-1) . . . h(ja+1) h(ja), where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ja+k-1) . . . h(ja+1) h(ja), where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(1) h(2) . . . h(n) the matrix q is represented as a product of elementary reflector q = h(ja) h(ja+1) . . . h(ja+k-1), where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ja) h(ja+1) . . . h(ja+k-1), where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ia) h(ia+1) . . . h(ia+k-1), where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ia) h(ia+1) . . . h(ia+k-1), where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ja) h(ja+1) . . . h(ja+k-1), where k = min(n,m). the matrix q is represented as a product of elementary reflector q = h(ia) h(ia+1) . . . h(ia+k-1), where k = min(m,n). the matrices q and p are represented as products of elementar the matrix q is represented as a product of nb elementary reflector q = h(1) h(2) . . . h(nb). distributed vector x(ix:ix+n-2,jx) if incx = 1 and x(ix,jx:jx+n-2) if incx = descx(m_). h is represented in the for h = i - tau * ( 1 ) * ( 1 v' ) , a(i,j) is computed without over/underflow if the final result cto * a(i,j) / cfrom can be represented withou if uplo = 'u', the matrix q is represented as a product of elementar important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type if uplo = 'u', the matrix q is represented as a product of elementar if uplo = 'u', the matrix q is represented as a product of elementar if uplo = 'u', the matrix q is represented as a product of elementar if uplo = 'u', the matrix q is represented as a product o important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type the matrices q and p are represented as products of elementar the matrices q and p are represented as products of elementar the matrix q is represented as a product of (ihi-ilo) elementar the matrix q is represented as a product of (ihi-ilo) elementar the matrix q is represented as a product of elementary reflector q = h(ia+k-1)' h(ia+k-2)' . . . h(ia)', where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ia+k-1)' h(ia+k-2)' . . . h(ia)', where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ja+k-1) . . . h(ja+1) h(ja), where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ja+k-1) . . . h(ja+1) h(ja), where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(1) h(2) . . . h(n) the matrix q is represented as a product of elementary reflector q = h(ja) h(ja+1) . . . h(ja+k-1), where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ja) h(ja+1) . . . h(ja+k-1), where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ia)' h(ia+1)' . . . h(ia+k-1)', where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ia)' h(ia+1)' . . . h(ia+k-1)', where k = min(m,n). the matrix q is represented as a product of elementary reflector q = h(ja) h(ja+1) . . . h(ja+k-1), where k = min(n,m). the matrix q is represented as a product of elementary reflector q = h(ia)' h(ia+1)' . . . h(ia+k-1)', where k = min(m,n). if uplo = 'u', the matrix q is represented as a product of elementar if uplo = 'u', the matrix q is represented as a product of elementar if uplo = 'u', the matrix q is represented as a product of elementar if uplo = 'u', the matrix q is represented as a product o the matrices q and p are represented as products of elementar the matrix q is represented as a product of nb elementary reflector q = h(1) h(2) . . . h(nb). complex distributed vector x(ix:ix+n-2,jx) if incx = 1 and x(ix,jx:jx+n-2) if incx = descx(m_). h is represented in the for h = i - tau * ( 1 ) * ( 1 v' ) , a(i,j) is computed without over/underflow if the final result cto * a(i,j) / cfrom can be represented withou if uplo = 'u', the matrix q is represented as a product of elementar important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type important note: the actual blacs grid represented by th irrespective of which one-dimensional descriptor type |
| representing representing if info = k>nprocs, the submatrix stored on processor info-nprocs representing interactions with othe stably factorable wo/interchanges, 2) reduced system phase: a small (max(bwl,bwu)* (p-1)) system is formed representing factors) in the space af. a parallel block cyclic reduction if info = k>nprocs, the submatrix stored on processor info-nprocs representing interactions with othe stably factorable wo/interchanges, 2) reduced system phase: a small ((p-1)) system is formed representing factors) in the space af. a parallel block cyclic reduction if info = k>nprocs, the submatrix stored on processor info-nprocs representing interactions with othe nonsingular, 2) reduced system phase: a small (max(bwl,bwu)* (p-1)) system is formed representing factors) in the space af. a parallel block cyclic reduction side = 'r'. it contains the local pieces of the distributed vectors v representing the householder transformation if storev = 'c' and side = 'l', lld_v >= max(1,locr(iv+m-1)); (lld_v, locc(jv+n-1)) if side = 'r'. it contains the local pieces of the distributed vectors v representing th lld_v >= locr(iv+k-1). if info = k>nprocs, the submatrix stored on processor info-nprocs representing interactions with othe positive definite, 2) reduced system phase: a small (bw* (p-1)) system is formed representing factors) in the space af. a parallel block cyclic reduction if info = k>nprocs, the submatrix stored on processor info-nprocs representing interactions with othe positive definite, 2) reduced system phase: a small ((p-1)) system is formed representing factors) in the space af. a parallel block cyclic reduction if info = k>nprocs, the submatrix stored on processor info-nprocs representing interactions with othe stably factorable wo/interchanges, 2) reduced system phase: a small (max(bwl,bwu)* (p-1)) system is formed representing factors) in the space af. a parallel block cyclic reduction if info = k>nprocs, the submatrix stored on processor info-nprocs representing interactions with othe stably factorable wo/interchanges, 2) reduced system phase: a small ((p-1)) system is formed representing factors) in the space af. a parallel block cyclic reduction if info = k>nprocs, the submatrix stored on processor info-nprocs representing interactions with othe nonsingular, 2) reduced system phase: a small (max(bwl,bwu)* (p-1)) system is formed representing factors) in the space af. a parallel block cyclic reduction side = 'r'. it contains the local pieces of the distributed vectors v representing the householder transformation if storev = 'c' and side = 'l', lld_v >= max(1,locr(iv+m-1)); (lld_v, locc(jv+n-1)) if side = 'r'. it contains the local pieces of the distributed vectors v representing th lld_v >= locr(iv+k-1). if info = k>nprocs, the submatrix stored on processor info-nprocs representing interactions with othe positive definite, 2) reduced system phase: a small (bw* (p-1)) system is formed representing factors) in the space af. a parallel block cyclic reduction if info = k>nprocs, the submatrix stored on processor info-nprocs representing interactions with othe positive definite, 2) reduced system phase: a small ((p-1)) system is formed representing factors) in the space af. a parallel block cyclic reduction if info = k>nprocs, the submatrix stored on processor info-nprocs representing interactions with othe stably factorable wo/interchanges, 2) reduced system phase: a small (max(bwl,bwu)* (p-1)) system is formed representing factors) in the space af. a parallel block cyclic reduction if info = k>nprocs, the submatrix stored on processor info-nprocs representing interactions with othe stably factorable wo/interchanges, 2) reduced system phase: a small ((p-1)) system is formed representing factors) in the space af. a parallel block cyclic reduction if info = k>nprocs, the submatrix stored on processor info-nprocs representing interactions with othe nonsingular, 2) reduced system phase: a small (max(bwl,bwu)* (p-1)) system is formed representing factors) in the space af. a parallel block cyclic reduction side = 'r'. it contains the local pieces of the distributed vectors v representing the householder transformation if storev = 'c' and side = 'l', lld_v >= max(1,locr(iv+m-1)); (lld_v, locc(jv+n-1)) if side = 'r'. it contains the local pieces of the distributed vectors v representing th lld_v >= locr(iv+k-1). if info = k>nprocs, the submatrix stored on processor info-nprocs representing interactions with othe positive definite, 2) reduced system phase: a small (bw* (p-1)) system is formed representing factors) in the space af. a parallel block cyclic reduction if info = k>nprocs, the submatrix stored on processor info-nprocs representing interactions with othe positive definite, 2) reduced system phase: a small ((p-1)) system is formed representing factors) in the space af. a parallel block cyclic reduction if info = k>nprocs, the submatrix stored on processor info-nprocs representing interactions with othe stably factorable wo/interchanges, 2) reduced system phase: a small (max(bwl,bwu)* (p-1)) system is formed representing factors) in the space af. a parallel block cyclic reduction if info = k>nprocs, the submatrix stored on processor info-nprocs representing interactions with othe stably factorable wo/interchanges, 2) reduced system phase: a small ((p-1)) system is formed representing factors) in the space af. a parallel block cyclic reduction if info = k>nprocs, the submatrix stored on processor info-nprocs representing interactions with othe nonsingular, 2) reduced system phase: a small (max(bwl,bwu)* (p-1)) system is formed representing factors) in the space af. a parallel block cyclic reduction side = 'r'. it contains the local pieces of the distributed vectors v representing the householder transformation if storev = 'c' and side = 'l', lld_v >= max(1,locr(iv+m-1)); (lld_v, locc(jv+n-1)) if side = 'r'. it contains the local pieces of the distributed vectors v representing th lld_v >= locr(iv+k-1). if info = k>nprocs, the submatrix stored on processor info-nprocs representing interactions with othe positive definite, 2) reduced system phase: a small (bw* (p-1)) system is formed representing factors) in the space af. a parallel block cyclic reduction if info = k>nprocs, the submatrix stored on processor info-nprocs representing interactions with othe positive definite, 2) reduced system phase: a small ((p-1)) system is formed representing factors) in the space af. a parallel block cyclic reduction |
| requested requested see below for definitions of variables used to define lwork. if no eigenvectors are requested (jobz = 'n') the if eigenvectors are requested (jobz = 'v' ) then lwork (local input) integer if eigenvectors are requested with np0 = numroc( max( n, nb, 2 ), nb, 0, 0, nprow ) before beginning computation. to get all the eigenvectors requested, the user must supply both sufficien and sufficient workspace to compute them. (see lwork below.) before beginning computation. to get all the eigenvectors requested, the user must supply both sufficien and sufficient workspace to compute them. (see lwork below.) if all eigenvectors are requested, the routine may either return th products q*x and/or q*y, where q is an input unitary see below for definitions of variables used to define lwork. if no eigenvectors are requested (jobz = 'n') the where before beginning computation. to get all the eigenvectors requested, the user must supply both sufficien and sufficient workspace to compute them. (see lwork below.) before beginning computation. to get all the eigenvectors requested, the user must supply both sufficien and sufficient workspace to compute them. (see lwork below.) see below for definitions of variables used to define lwork. if no eigenvectors are requested (jobz = 'n') the where before beginning computation. to get all the eigenvectors requested, the user must supply both sufficien and sufficient workspace to compute them. (see lwork below.) before beginning computation. to get all the eigenvectors requested, the user must supply both sufficien and sufficient workspace to compute them. (see lwork below.) see below for definitions of variables used to define lwork. if no eigenvectors are requested (jobz = 'n') the if eigenvectors are requested (jobz = 'v' ) then lwork (local input) integer if eigenvectors are requested with np0 = numroc( max( n, nb, 2 ), nb, 0, 0, nprow ) before beginning computation. to get all the eigenvectors requested, the user must supply both sufficien and sufficient workspace to compute them. (see lwork below.) before beginning computation. to get all the eigenvectors requested, the user must supply both sufficien and sufficient workspace to compute them. (see lwork below.) if all eigenvectors are requested, the routine may either return th products q*x and/or q*y, where q is an input unitary |
| require require each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. |
| required required array elements marked * are not used by the routine; elements marked + need not be set on entry, but are required by the routine to stor interchanges. array elements marked * are not used by the routine; elements marked + need not be set on entry, but are required by the routine to stor interchanges. out (local input/output) double precision array, dimension jx2 this is the work buffer required by this routine info (local input) integer each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. this node stops work after this stage -- an extra copy is required to make the odd and even frontal matrice each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. a description vector is associated with each 2d block-cyclicly dis- tributed matrix. this vector stores the information required t process and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis process and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. this node stops work after this stage -- an extra copy is required to make the odd and even frontal matrice each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. being recombined. on exit, rho has been modified to the value required b being recombined. on exit, rho has been modified to the value required b each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. query is assumed; the routine only calculates the minimum size for the work array. the required workspace is returne by pxerbla. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. a description vector is associated with each 2d block-cyclicly dis- tributed matrix. this vector stores the information required t process and memory location. dimension (lwork) on output, work(1) returns the workspace required lwork (local input) integer each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis process and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. problem dimensions for the subroutine name; these may not all be required at present, only n1 is used, and it (n1) is used only for each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. this node stops work after this stage -- an extra copy is required to make the odd and even frontal matrice each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. being recombined. on exit, rho has been modified to the value required b being recombined. on exit, rho has been modified to the value required b each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. query is assumed; the routine only calculates the minimum size for the work array. the required workspace is returne by pxerbla. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. a description vector is associated with each 2d block-cyclicly dis- tributed matrix. this vector stores the information required t process and memory location. dimension (lwork) on output, work(1) returns the workspace required lwork (local input) integer each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis process and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. this node stops work after this stage -- an extra copy is required to make the odd and even frontal matrice each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. a description vector is associated with each 2d block-cyclicly dis- tributed matrix. this vector stores the information required t process and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis process and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. each global data object is described by an associated description vector. this vector stores the information required to establis and memory location. array elements marked * are not used by the routine; elements marked + need not be set on entry, but are required by the routine to stor interchanges. out (local input/output) real array, dimension jx2 this is the work buffer required by this routine info (local input) integer array elements marked * are not used by the routine; elements marked + need not be set on entry, but are required by the routine to stor interchanges. |
| requirement requirement where sizesytrd = the workspace requirement for pdsytr if eigenvectors are requested (jobz = 'v' ) then where sizesytrd = the workspace requirement for pssytr if eigenvectors are requested (jobz = 'v' ) then |
| requirements requirements for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. copy matrix hu_i (the last bwl rows of gu_i) to afl storage as per requirements of blas routine ctrmm conjugate transpose hu_i to hu_i^c. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements data storage requirements alignment requirements alignment requirements for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. copy matrix h_i (the last bw cols of g_i) to af storage as per requirements of blas routine ctrmm h_i^c to h_i. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. copy matrix hu_i (the last bwl rows of gu_i) to afl storage as per requirements of blas routine dtrmm transpose hu_i to hu_i^t. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. copy matrix h_i (the last bw cols of g_i) to af storage as per requirements of blas routine dtrmm h_i^t to h_i. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements data storage requirements for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. copy matrix hu_i (the last bwl rows of gu_i) to afl storage as per requirements of blas routine dtrmm transpose hu_i to hu_i^t. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. copy matrix h_i (the last bw cols of g_i) to af storage as per requirements of blas routine strmm h_i^t to h_i. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements data storage requirements for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. copy matrix hu_i (the last bwl rows of gu_i) to afl storage as per requirements of blas routine ztrmm conjugate transpose hu_i to hu_i^c. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements data storage requirements alignment requirements alignment requirements for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. copy matrix h_i (the last bw cols of g_i) to af storage as per requirements of blas routine ztrmm h_i^c to h_i. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. for *both* dtype_a and dtype_b to be 2d_type(1), as these lead to opposite requirements for the orientation of the blacs grid all descriptors in a single scalapack subroutine call. alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements alignment requirements |
| requires requires moreover, this routine requires the distributed submatrices sub( a ) i.e., if f(x,y) = mod( x-1, y ): this routine requires square block decomposition ( mb_a = nb_a ) arguments 1-dimensional "row" of processes. calling the lapack procedure cbdsqr requires wcbdsqr = max(1, 4*size ) this routine requires n <= nb_a-mod(ja-1, nb_a) and square bloc this routine requires square block decomposition ( mb_a = nb_a ) arguments this routine requires square block data decomposition ( mb_a=nb_a ) arguments v = v + alpha * h however, the traditional way of computing v requires that ta v = tau * v) and then a sum-to-all is required (to a(ia:ia+m-1,ja:ja+n-1) and sub( b ) denotes b(ib:ib+m-1,jb:jb+n-1). pclacp2 requires that only dimension of the matrix operands i a(ia:ia+m-1,ja:ja+n-1) to beta on the diagonal and alpha on the offdiagonals. pclase2 requires that only dimension of the matri moreover, this routine requires the distributed submatrices sub( a ) i.e., if f(x,y) = mod( x-1, y ): this routine requires square block decomposition ( mb_a = nb_a ) arguments this routine requires n <= nb_a-mod(ja-1, nb_a) and square bloc this routine requires square block decomposition ( mb_a = nb_a ) arguments this routine requires square block decomposition ( mb_a = nb_a ) arguments moreover, this routine requires the distributed submatrices sub( a ) i.e., if f(x,y) = mod( x-1, y ): moreover, this routine requires the distributed submatrices sub( a ) i.e., if f(x,y) = mod( x-1, y ): this routine requires square block decomposition ( mb_a = nb_a ) arguments 1-dimensional "row" of processes. calling the lapack procedure dbdsqr requires wdbdsqr = max(1, 4*size ) this routine requires n <= nb_a-mod(ja-1, nb_a) and square bloc this routine requires square block decomposition ( mb_a = nb_a ) arguments this routine requires square block data decomposition ( mb_a=nb_a ) arguments a(ia:ia+m-1,ja:ja+n-1) and sub( b ) denotes b(ib:ib+m-1,jb:jb+n-1). pdlacp2 requires that only dimension of the matrix operands i a(ia:ia+m-1,ja:ja+n-1) to beta on the diagonal and alpha on the offdiagonals. pdlase2 requires that only dimension of the matri moreover, this routine requires the distributed submatrices sub( a ) i.e., if f(x,y) = mod( x-1, y ): this routine requires square block decomposition ( mb_a = nb_a ) arguments this routine requires n <= nb_a-mod(ja-1, nb_a) and square bloc this routine requires square block decomposition ( mb_a = nb_a ) arguments this routine requires square block decomposition ( mb_a = nb_a ) arguments v = v + alpha * h however, the traditional way of computing v requires that ta v = tau * v) and then a sum-to-all is required (to moreover, this routine requires the distributed submatrices sub( a ) i.e., if f(x,y) = mod( x-1, y ): moreover, this routine requires the distributed submatrices sub( a ) i.e., if f(x,y) = mod( x-1, y ): this routine requires square block decomposition ( mb_a = nb_a ) arguments 1-dimensional "row" of processes. calling the lapack procedure sbdsqr requires wsbdsqr = max(1, 4*size ) this routine requires n <= nb_a-mod(ja-1, nb_a) and square bloc this routine requires square block decomposition ( mb_a = nb_a ) arguments this routine requires square block data decomposition ( mb_a=nb_a ) arguments a(ia:ia+m-1,ja:ja+n-1) and sub( b ) denotes b(ib:ib+m-1,jb:jb+n-1). pslacp2 requires that only dimension of the matrix operands i a(ia:ia+m-1,ja:ja+n-1) to beta on the diagonal and alpha on the offdiagonals. pslase2 requires that only dimension of the matri moreover, this routine requires the distributed submatrices sub( a ) i.e., if f(x,y) = mod( x-1, y ): this routine requires square block decomposition ( mb_a = nb_a ) arguments this routine requires n <= nb_a-mod(ja-1, nb_a) and square bloc this routine requires square block decomposition ( mb_a = nb_a ) arguments this routine requires square block decomposition ( mb_a = nb_a ) arguments v = v + alpha * h however, the traditional way of computing v requires that ta v = tau * v) and then a sum-to-all is required (to moreover, this routine requires the distributed submatrices sub( a ) i.e., if f(x,y) = mod( x-1, y ): moreover, this routine requires the distributed submatrices sub( a ) i.e., if f(x,y) = mod( x-1, y ): this routine requires square block decomposition ( mb_a = nb_a ) arguments 1-dimensional "row" of processes. calling the lapack procedure zbdsqr requires wzbdsqr = max(1, 4*size ) this routine requires n <= nb_a-mod(ja-1, nb_a) and square bloc this routine requires square block decomposition ( mb_a = nb_a ) arguments this routine requires square block data decomposition ( mb_a=nb_a ) arguments v = v + alpha * h however, the traditional way of computing v requires that ta v = tau * v) and then a sum-to-all is required (to a(ia:ia+m-1,ja:ja+n-1) and sub( b ) denotes b(ib:ib+m-1,jb:jb+n-1). pzlacp2 requires that only dimension of the matrix operands i a(ia:ia+m-1,ja:ja+n-1) to beta on the diagonal and alpha on the offdiagonals. pzlase2 requires that only dimension of the matri moreover, this routine requires the distributed submatrices sub( a ) i.e., if f(x,y) = mod( x-1, y ): this routine requires square block decomposition ( mb_a = nb_a ) arguments this routine requires n <= nb_a-mod(ja-1, nb_a) and square bloc this routine requires square block decomposition ( mb_a = nb_a ) arguments this routine requires square block decomposition ( mb_a = nb_a ) arguments moreover, this routine requires the distributed submatrices sub( a ) i.e., if f(x,y) = mod( x-1, y ): |
| reserved reserved type_a = 502: lld_a >=nb_a, 1. reserved desca( 7 ) reserved for future use type_a = 502: lld_a >=nb_a, 1. reserved desca( 7 ) reserved for future use ignored desca( 6 ) ignored for tridiagonal matrices. reserved desca( 7 ) reserved for future use ignored desca( 6 ) ignored for tridiagonal matrices. reserved desca( 7 ) reserved for future use type_a = 502: lld_a >=nb_a, 1. reserved desca( 7 ) reserved for future use type_a = 502: lld_a >=nb_a, 1. reserved desca( 7 ) reserved for future use type_a = 502: lld_a >=nb_a, 1. reserved desca( 7 ) reserved for future use type_a = 502: lld_a >=nb_a, 1. reserved desca( 7 ) reserved for future use ignored desca( 6 ) ignored for tridiagonal matrices. reserved desca( 7 ) reserved for future use ignored desca( 6 ) ignored for tridiagonal matrices. reserved desca( 7 ) reserved for future use type_a = 502: lld_a >=nb_a, 1. reserved desca( 7 ) reserved for future use type_a = 502: lld_a >=nb_a, 1. reserved desca( 7 ) reserved for future use ignored desca( 6 ) ignored for tridiagonal matrices. reserved desca( 7 ) reserved for future use ignored desca( 6 ) ignored for tridiagonal matrices. reserved desca( 7 ) reserved for future use type_a = 502: lld_a >=nb_a, 1. reserved desca( 7 ) reserved for future use type_a = 502: lld_a >=nb_a, 1. reserved desca( 7 ) reserved for future use ===================================================================== type_a = 502: lld_a >=nb_a, 1. reserved desca( 7 ) reserved for future use type_a = 502: lld_a >=nb_a, 1. reserved desca( 7 ) reserved for future use ignored desca( 6 ) ignored for tridiagonal matrices. reserved desca( 7 ) reserved for future use ignored desca( 6 ) ignored for tridiagonal matrices. reserved desca( 7 ) reserved for future use since the user cannot know a priori what value nsplit will have, n words must be reserved for isplit. work (local workspace) double precision array, type_a = 502: lld_a >=nb_a, 1. reserved desca( 7 ) reserved for future use type_a = 502: lld_a >=nb_a, 1. reserved desca( 7 ) reserved for future use ignored desca( 6 ) ignored for tridiagonal matrices. reserved desca( 7 ) reserved for future use ignored desca( 6 ) ignored for tridiagonal matrices. reserved desca( 7 ) reserved for future use type_a = 502: lld_a >=nb_a, 1. reserved desca( 7 ) reserved for future use type_a = 502: lld_a >=nb_a, 1. reserved desca( 7 ) reserved for future use ===================================================================== type_a = 502: lld_a >=nb_a, 1. reserved desca( 7 ) reserved for future use type_a = 502: lld_a >=nb_a, 1. reserved desca( 7 ) reserved for future use ignored desca( 6 ) ignored for tridiagonal matrices. reserved desca( 7 ) reserved for future use ignored desca( 6 ) ignored for tridiagonal matrices. reserved desca( 7 ) reserved for future use since the user cannot know a priori what value nsplit will have, n words must be reserved for isplit. work (local workspace) real array, dimension ( max( 5*n, 7 ) ) type_a = 502: lld_a >=nb_a, 1. reserved desca( 7 ) reserved for future use type_a = 502: lld_a >=nb_a, 1. reserved desca( 7 ) reserved for future use ignored desca( 6 ) ignored for tridiagonal matrices. reserved desca( 7 ) reserved for future use ignored desca( 6 ) ignored for tridiagonal matrices. reserved desca( 7 ) reserved for future use type_a = 502: lld_a >=nb_a, 1. reserved desca( 7 ) reserved for future use type_a = 502: lld_a >=nb_a, 1. reserved desca( 7 ) reserved for future use type_a = 502: lld_a >=nb_a, 1. reserved desca( 7 ) reserved for future use type_a = 502: lld_a >=nb_a, 1. reserved desca( 7 ) reserved for future use ignored desca( 6 ) ignored for tridiagonal matrices. reserved desca( 7 ) reserved for future use ignored desca( 6 ) ignored for tridiagonal matrices. reserved desca( 7 ) reserved for future use |
| Reset Reset Reset b Reset local indices so we can find rowmax Reset local indices so we can find rowmax Reset b Reset local indices so we can find rowmax Reset b Reset local indices so we can find rowmax Reset b Reset local indices so we can find rowmax Reset local indices so we can find rowmax |
| resides resides dimension ( ldzi, nvs(iam) ) the eigenvectors on input. each eigenvector resides entirel nvs(iam) eigenvectors. the first eigenvector which the dimension ( ldzi, nvs(iam) ) the eigenvectors on input. each eigenvector resides entirel nvs(iam) eigenvectors. the first eigenvector which the dimension ( ldzi, nvs(iam) ) the eigenvectors on input. each eigenvector resides entirel nvs(iam) eigenvectors. the first eigenvector which the dimension ( ldzi, nvs(iam) ) the eigenvectors on input. each eigenvector resides entirel nvs(iam) eigenvectors. the first eigenvector which the |
| residual residual of sub( b ) contain the least squares solution vectors; the residual sum of squares for the solution in each column i column; if trans = 'n' and m < n, rows 1 to n of sub( b ) of sub( b ) contain the least squares solution vectors; the residual sum of squares for the solution in each column i column; if trans = 'n' and m < n, rows 1 to n of sub( b ) of sub( b ) contain the least squares solution vectors; the residual sum of squares for the solution in each column i column; if trans = 'n' and m < n, rows 1 to n of sub( b ) of sub( b ) contain the least squares solution vectors; the residual sum of squares for the solution in each column i column; if trans = 'n' and m < n, rows 1 to n of sub( b ) |
| resp resp vector. this vector stores the information required to establish the mapping between an object element and its corresponding proces vector. this vector stores the information required to establish the mapping between an object element and its corresponding proces vector. this vector stores the information required to establish the mapping between an object element and its corresponding proces vector. this vector stores the information required to establish the mapping between an object element and its corresponding proces vector. this vector stores the information required to establish the mapping between an object element and its corresponding proces vector. this vector stores the information required to establish the mapping between an object element and its corresponding proces vector. this vector stores the information required to establish the mapping between an object element and its corresponding proces vector. this vector stores the information required to establish the mapping between an object element and its corresponding proces vector. this vector stores the information required to establish the mapping between an object element and its corresponding proces vector. this vector stores the information required to establish the mapping between an object element and its corresponding proces vector. this vector stores the information required to establish the mapping between an object element and its corresponding proces vector. this vector stores the information required to establish the mapping between an object element and its corresponding proces vector. this vector stores the information required to establish the mapping between an object element and its corresponding proces vector. this vector stores the information required to establish the mapping between an object element and its corresponding proces vector. this vector stores the information required to establish the mapping between an object element and its corresponding proces vector. this vector stores the information required to establish the mapping between an object element and its corresponding proces |
| respect respect sub( a ) = a(ia:ia+n-1,ja:ja+n-1) and reduce its condition number (with respect to the two-norm). sr and sc contain the scal buted matrix b with elements b(i,j) = s(i)*a(i,j)*s(j) has ones on sub( a ) = a(ia:ia+n-1,ja:ja+n-1) and reduce its condition number (with respect to the two-norm). sr and sc contain the scal buted matrix b with elements b(i,j) = s(i)*a(i,j)*s(j) has ones on sub( a ) = a(ia:ia+n-1,ja:ja+n-1) and reduce its condition number (with respect to the two-norm). sr and sc contain the scal buted matrix b with elements b(i,j) = s(i)*a(i,j)*s(j) has ones on sub( a ) = a(ia:ia+n-1,ja:ja+n-1) and reduce its condition number (with respect to the two-norm). sr and sc contain the scal buted matrix b with elements b(i,j) = s(i)*a(i,j)*s(j) has ones on |
| respectively respectively which is about to be factorized. the number of rows in the partitioning are jb, i2, i3 respectively, and the number and the subdiagonal elements of a31 lie outside the band. which is about to be factorized. the number of rows in the partitioning are jb, i2, i3 respectively, and the number and the subdiagonal elements of a31 lie outside the band. in the following comments, sub( a ), sub( x ) and sub( b ) denote respectively a(ia:ia+n-1,ja:ja+n-1), x(ix:ix+n-1,jx:jx+nrhs-1) an are the singular values of a and the columns of u and v are the corresponding right and left singular vectors, respectively. th only the first min(m,n) columns of u and rows of vt = v**t are scond (global input) real ratio of the smallest sr(i) (respectively sc(j)) to th and ja <= j <= ja+n-1. scale and sumsq must be supplied in scale and sumsq respectively in the following comments, sub( a ), sub( x ) and sub( b ) denote respectively a(ia:ia+n-1,ja:ja+n-1), x(ix:ix+n-1,jx:jx+nrhs-1) an in the following comments, sub( a ), sub( x ) and sub( b ) denote respectively a(ia:ia+n-1,ja:ja+n-1), x(ix:ix+n-1,jx:jx+nrhs-1) an bidiagonal form: a(ia:*,ja:*) = q * b * p**h. q and p**h are defined as products of elementary reflectors h(i) and g(i) respectively let nq = m if side = 'l' and nq = n if side = 'r'. thus nq is the in the following comments, sub( a ), sub( x ) and sub( b ) denote respectively a(ia:ia+n-1,ja:ja+n-1), x(ix:ix+n-1,jx:jx+nrhs-1) an are the singular values of a and the columns of u and v are the corresponding right and left singular vectors, respectively. th only the first min(m,n) columns of u and rows of vt = v**t are scond (global input) double precision ratio of the smallest sr(i) (respectively sc(j)) to th and ja <= j <= ja+n-1. scale and sumsq must be supplied in scale and sumsq respectively bidiagonal form: a(ia:*,ja:*) = q * b * p**t. q and p**t are defined as products of elementary reflectors h(i) and g(i) respectively let nq = m if side = 'l' and nq = n if side = 'r'. thus nq is the in the following comments, sub( a ), sub( x ) and sub( b ) denote respectively a(ia:ia+n-1,ja:ja+n-1), x(ix:ix+n-1,jx:jx+nrhs-1) an in the following comments, sub( a ), sub( x ) and sub( b ) denote respectively a(ia:ia+n-1,ja:ja+n-1), x(ix:ix+n-1,jx:jx+nrhs-1) an in the following comments, sub( a ), sub( x ) and sub( b ) denote respectively a(ia:ia+n-1,ja:ja+n-1), x(ix:ix+n-1,jx:jx+nrhs-1) an are the singular values of a and the columns of u and v are the corresponding right and left singular vectors, respectively. th only the first min(m,n) columns of u and rows of vt = v**t are scond (global input) real ratio of the smallest sr(i) (respectively sc(j)) to th and ja <= j <= ja+n-1. scale and sumsq must be supplied in scale and sumsq respectively bidiagonal form: a(ia:*,ja:*) = q * b * p**t. q and p**t are defined as products of elementary reflectors h(i) and g(i) respectively let nq = m if side = 'l' and nq = n if side = 'r'. thus nq is the in the following comments, sub( a ), sub( x ) and sub( b ) denote respectively a(ia:ia+n-1,ja:ja+n-1), x(ix:ix+n-1,jx:jx+nrhs-1) an in the following comments, sub( a ), sub( x ) and sub( b ) denote respectively a(ia:ia+n-1,ja:ja+n-1), x(ix:ix+n-1,jx:jx+nrhs-1) an in the following comments, sub( a ), sub( x ) and sub( b ) denote respectively a(ia:ia+n-1,ja:ja+n-1), x(ix:ix+n-1,jx:jx+nrhs-1) an are the singular values of a and the columns of u and v are the corresponding right and left singular vectors, respectively. th only the first min(m,n) columns of u and rows of vt = v**t are scond (global input) double precision ratio of the smallest sr(i) (respectively sc(j)) to th and ja <= j <= ja+n-1. scale and sumsq must be supplied in scale and sumsq respectively in the following comments, sub( a ), sub( x ) and sub( b ) denote respectively a(ia:ia+n-1,ja:ja+n-1), x(ix:ix+n-1,jx:jx+nrhs-1) an in the following comments, sub( a ), sub( x ) and sub( b ) denote respectively a(ia:ia+n-1,ja:ja+n-1), x(ix:ix+n-1,jx:jx+nrhs-1) an bidiagonal form: a(ia:*,ja:*) = q * b * p**h. q and p**h are defined as products of elementary reflectors h(i) and g(i) respectively let nq = m if side = 'l' and nq = n if side = 'r'. thus nq is the which is about to be factorized. the number of rows in the partitioning are jb, i2, i3 respectively, and the number and the subdiagonal elements of a31 lie outside the band. which is about to be factorized. the number of rows in the partitioning are jb, i2, i3 respectively, and the number and the subdiagonal elements of a31 lie outside the band. |
| rest rest truea( index, index:n ) = a( index, index:n ) the rest of a is untouched after the current block column of a is updated, the first nb rows and columns of the matrix are overwritten; the rest of the distributed matrix sub( a ) is unchanged columns, with the array tauq, represent the unitary k = 3. the elements equal to 1 are not stored; the corresponding array elements are modified but restored on exit. the rest of th k = 3. the elements equal to 1 are not stored; the corresponding array elements are modified but restored on exit. the rest of th the first nb rows and columns of the matrix are overwritten; the rest of the distributed matrix sub( a ) is unchanged columns, with the array tauq, represent the orthogonal k = 3. the elements equal to 1 are not stored; the corresponding array elements are modified but restored on exit. the rest of th k = 3. the elements equal to 1 are not stored; the corresponding array elements are modified but restored on exit. the rest of th truea( index, index:n ) = a( index, index:n ) the rest of a is untouched after the current block column of a is updated, the first nb rows and columns of the matrix are overwritten; the rest of the distributed matrix sub( a ) is unchanged columns, with the array tauq, represent the orthogonal k = 3. the elements equal to 1 are not stored; the corresponding array elements are modified but restored on exit. the rest of th k = 3. the elements equal to 1 are not stored; the corresponding array elements are modified but restored on exit. the rest of th truea( index, index:n ) = a( index, index:n ) the rest of a is untouched after the current block column of a is updated, truea( index, index:n ) = a( index, index:n ) the rest of a is untouched after the current block column of a is updated, the first nb rows and columns of the matrix are overwritten; the rest of the distributed matrix sub( a ) is unchanged columns, with the array tauq, represent the unitary k = 3. the elements equal to 1 are not stored; the corresponding array elements are modified but restored on exit. the rest of th k = 3. the elements equal to 1 are not stored; the corresponding array elements are modified but restored on exit. the rest of th |
| Restore Restore each subsequent iteration determines a reflection g to Restore the hessenberg form in the (k-1)th column, and thu submatrix. nr is the order of g Restore saved input parameter Restore saved input parameter Restore saved input parameter Restore saved input parameter Restore saved input parameter Restore saved input parameter each subsequent iteration determines a reflection g to Restore the hessenberg form in the (k-1)th column, and thu submatrix. nr is the order of g |
| restored restored k = 3. the elements equal to 1 are not stored; the corresponding array elements are modified but restored on exit. the rest of th k = 3. the elements equal to 1 are not stored; the corresponding array elements are modified but restored on exit. the rest of th (desct(lld_),*) the upper triangular matrix t. t is modified, but restored argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k = 3. the elements equal to 1 are not stored; the corresponding array elements are modified but restored on exit. the rest of th k = 3. the elements equal to 1 are not stored; the corresponding array elements are modified but restored on exit. the rest of th argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k = 3. the elements equal to 1 are not stored; the corresponding array elements are modified but restored on exit. the rest of th k = 3. the elements equal to 1 are not stored; the corresponding array elements are modified but restored on exit. the rest of th argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k = 3. the elements equal to 1 are not stored; the corresponding array elements are modified but restored on exit. the rest of th k = 3. the elements equal to 1 are not stored; the corresponding array elements are modified but restored on exit. the rest of th (desct(lld_),*) the upper triangular matrix t. t is modified, but restored argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o |
| restricted restricted r(i) and c(j) are restricted to be between smlnum = smallest saf factors is not guaranteed to reduce the condition number of the tailored codes place no restrictions on ia, ja, mb or nb. at present, ia, ja, mb and nb are restricted to those values allowe documented below. (search for "restrictions".) r(i) and c(j) are restricted to be between smlnum = smallest saf factors is not guaranteed to reduce the condition number of the tailored codes place no restrictions on ia, ja, mb or nb. at present, ia, ja, mb and nb are restricted to those values allowe documented below. (search for "restrictions".) r(i) and c(j) are restricted to be between smlnum = smallest saf factors is not guaranteed to reduce the condition number of the tailored codes place no restrictions on ia, ja, mb or nb. at present, ia, ja, mb and nb are restricted to those values allowe documented below. (search for "restrictions".) r(i) and c(j) are restricted to be between smlnum = smallest saf factors is not guaranteed to reduce the condition number of the tailored codes place no restrictions on ia, ja, mb or nb. at present, ia, ja, mb and nb are restricted to those values allowe documented below. (search for "restrictions".) |
| restriction restriction restriction restriction these are alignment restrictions that may or may not be remove restriction restriction these are alignment restrictions that may or may not be remove restriction restriction restriction restriction these are alignment restrictions that may or may not be remove restriction restriction these are alignment restrictions that may or may not be remove restriction restriction these are alignment restrictions that may or may not be remove restriction restriction these are alignment restrictions that may or may not be remove restriction restriction restriction restriction these are alignment restrictions that may or may not be remove restriction restriction these are alignment restrictions that may or may not be remove restriction restriction these are alignment restrictions that may or may not be remove restriction restriction these are alignment restrictions that may or may not be remove restriction restriction restriction restriction these are alignment restrictions that may or may not be remove restriction restriction these are alignment restrictions that may or may not be remove restriction restriction these are alignment restrictions that may or may not be remove restriction restriction these are alignment restrictions that may or may not be remove restriction restriction restriction restriction these are alignment restrictions that may or may not be remove restriction restriction these are alignment restrictions that may or may not be remove |
| restrictions restrictions restrictions restrictions these are alignment restrictions that may or may not be remove restrictions restrictions these are alignment restrictions that may or may not be remove restrictions restrictions the tailored codes place no restrictions on ia, ja, mb or nb by pchetrd to keep the interface simple. these restrictions are restrictions restrictions restrictions these are alignment restrictions that may or may not be remove restrictions restrictions these are alignment restrictions that may or may not be remove restrictions restrictions these are alignment restrictions that may or may not be remove restrictions restrictions these are alignment restrictions that may or may not be remove restrictions restrictions restrictions restrictions restrictions these are alignment restrictions that may or may not be remove restrictions restrictions these are alignment restrictions that may or may not be remove the tailored codes place no restrictions on ia, ja, mb or nb by pdsytrd to keep the interface simple. these restrictions are restrictions restrictions these are alignment restrictions that may or may not be remove restrictions restrictions these are alignment restrictions that may or may not be remove restrictions restrictions restrictions restrictions restrictions these are alignment restrictions that may or may not be remove restrictions restrictions these are alignment restrictions that may or may not be remove the tailored codes place no restrictions on ia, ja, mb or nb by pssytrd to keep the interface simple. these restrictions are restrictions restrictions these are alignment restrictions that may or may not be remove restrictions restrictions these are alignment restrictions that may or may not be remove restrictions restrictions the tailored codes place no restrictions on ia, ja, mb or nb by pzhetrd to keep the interface simple. these restrictions are restrictions restrictions restrictions these are alignment restrictions that may or may not be remove restrictions restrictions these are alignment restrictions that may or may not be remove |
| result result conjugate transpose resulting block to its locatio values in this array correspond to the clusters indicated by the array iclustr. as a result, the dot product betwee as ( c * n ) / gap(i) where c is a small constant. values in this array correspond to the clusters indicated by the array iclustr. as a result, the dot product betwee as ( c * n ) / gap(i) where c is a small constant. gather the result on process (iarow,iacol) gather the result on process (iarow,iacol) denoting a(ia:ia+m-1,ja:ja+n-1) by the real scalar cto/cfrom. this is done without over/underflow as long as the final result sub( a ) may be full, upper triangular, lower triangular or upper the result are only available in the scope of sub( x ), i.e i only available in this process row of the grid. similarly if sub( x ) pclatra computes the trace of an n-by-n distributed matrix sub( a ) denoting a( ia:ia+n-1, ja:ja+n-1 ). the result is left on ever if uplo = 'u' or 'u' then the upper triangle of the result is stored if uplo = 'l' or 'l' then the lower triangle of the result is stored, if uplo = 'u' or 'u' then the upper triangle of the result is stored if uplo = 'l' or 'l' then the lower triangle of the result is stored, when the result of a vector-oriented pblas call is a scalar, it wil being operated on. let x be a generic term for the input vector(s). values in this array correspond to the info/(m+1) clusters indicated by the array iclustr. as a result, the dot produc as high as ( o(n)*macheps ) / gap(i). transpose resulting block to its locatio gather the result on process (iarow,iacol) denoting a(ia:ia+m-1,ja:ja+n-1) by the real scalar cto/cfrom. this is done without over/underflow as long as the final result sub( a ) may be full, upper triangular, lower triangular or upper the result are only available in the scope of sub( x ), i.e i only available in this process row of the grid. similarly if sub( x ) pdlatra computes the trace of an n-by-n distributed matrix sub( a ) denoting a( ia:ia+n-1, ja:ja+n-1 ). the result is left on ever if uplo = 'u' or 'u' then the upper triangle of the result is stored if uplo = 'l' or 'l' then the lower triangle of the result is stored, if uplo = 'u' or 'u' then the upper triangle of the result is stored if uplo = 'l' or 'l' then the lower triangle of the result is stored, the real scalar 1/a. this is done without overflow or underflow as long as the final result sub( x )/a does not overflow or underflow where sub( x ) denotes x(ix:ix+n-1,jx:jx), if incx = 1, values in this array correspond to the info/(m+1) clusters indicated by the array iclustr. as a result, the dot produc as high as ( o(n)*macheps ) / gap(i). values in this array correspond to the clusters indicated by the array iclustr. as a result, the dot product betwee as ( c * n ) / gap(i) where c is a small constant. values in this array correspond to the clusters indicated by the array iclustr. as a result, the dot product betwee as ( c * n ) / gap(i) where c is a small constant. when the result of a vector-oriented pblas call is a scalar, it wil being operated on. let x be a generic term for the input vector(s). when the result of a vector-oriented pblas call is a scalar, it wil being operated on. let x be a generic term for the input vector(s). transpose resulting block to its locatio gather the result on process (iarow,iacol) denoting a(ia:ia+m-1,ja:ja+n-1) by the real scalar cto/cfrom. this is done without over/underflow as long as the final result sub( a ) may be full, upper triangular, lower triangular or upper the result are only available in the scope of sub( x ), i.e i only available in this process row of the grid. similarly if sub( x ) pslatra computes the trace of an n-by-n distributed matrix sub( a ) denoting a( ia:ia+n-1, ja:ja+n-1 ). the result is left on ever if uplo = 'u' or 'u' then the upper triangle of the result is stored if uplo = 'l' or 'l' then the lower triangle of the result is stored, if uplo = 'u' or 'u' then the upper triangle of the result is stored if uplo = 'l' or 'l' then the lower triangle of the result is stored, the real scalar 1/a. this is done without overflow or underflow as long as the final result sub( x )/a does not overflow or underflow where sub( x ) denotes x(ix:ix+n-1,jx:jx), if incx = 1, values in this array correspond to the info/(m+1) clusters indicated by the array iclustr. as a result, the dot produc as high as ( o(n)*macheps ) / gap(i). values in this array correspond to the clusters indicated by the array iclustr. as a result, the dot product betwee as ( c * n ) / gap(i) where c is a small constant. values in this array correspond to the clusters indicated by the array iclustr. as a result, the dot product betwee as ( c * n ) / gap(i) where c is a small constant. conjugate transpose resulting block to its locatio values in this array correspond to the clusters indicated by the array iclustr. as a result, the dot product betwee as ( c * n ) / gap(i) where c is a small constant. values in this array correspond to the clusters indicated by the array iclustr. as a result, the dot product betwee as ( c * n ) / gap(i) where c is a small constant. gather the result on process (iarow,iacol) gather the result on process (iarow,iacol) denoting a(ia:ia+m-1,ja:ja+n-1) by the real scalar cto/cfrom. this is done without over/underflow as long as the final result sub( a ) may be full, upper triangular, lower triangular or upper the result are only available in the scope of sub( x ), i.e i only available in this process row of the grid. similarly if sub( x ) pzlatra computes the trace of an n-by-n distributed matrix sub( a ) denoting a( ia:ia+n-1, ja:ja+n-1 ). the result is left on ever if uplo = 'u' or 'u' then the upper triangle of the result is stored if uplo = 'l' or 'l' then the lower triangle of the result is stored, if uplo = 'u' or 'u' then the upper triangle of the result is stored if uplo = 'l' or 'l' then the lower triangle of the result is stored, when the result of a vector-oriented pblas call is a scalar, it wil being operated on. let x be a generic term for the input vector(s). values in this array correspond to the info/(m+1) clusters indicated by the array iclustr. as a result, the dot produc as high as ( o(n)*macheps ) / gap(i). |
| resulting resulting + need not be set on entry, but are required by the routine to store elements of u, because of fill-in resulting from the ro + need not be set on entry, but are required by the routine to store elements of u, because of fill-in resulting from the ro on exit, the diagonal blocks of s have been rewritten to pair the eigenvalues. the resulting matrix is no longe conjugate transpose resulting block to its locatio or inv( p ) to a general m-by-n distributed matrix sub( a ) = a(ia:ia+m-1,ja:ja+n-1), resulting in row or colum or a column. the pivot vector should be aligned with the distributed or inv( p ) to a m-by-n distributed matrix sub( a ) denoting a(ia:ia+m-1,ja:ja+n-1), resulting in row or column pivoting. th pivoting the rows of sub( a ), ipiv should be distributed along a conjugate transpose resulting block to its locatio transpose resulting block to its locatio or inv( p ) to a general m-by-n distributed matrix sub( a ) = a(ia:ia+m-1,ja:ja+n-1), resulting in row or colum or a column. the pivot vector should be aligned with the distributed or inv( p ) to a m-by-n distributed matrix sub( a ) denoting a(ia:ia+m-1,ja:ja+n-1), resulting in row or column pivoting. th pivoting the rows of sub( a ), ipiv should be distributed along a transpose resulting block to its locatio transpose resulting block to its locatio or inv( p ) to a general m-by-n distributed matrix sub( a ) = a(ia:ia+m-1,ja:ja+n-1), resulting in row or colum or a column. the pivot vector should be aligned with the distributed or inv( p ) to a m-by-n distributed matrix sub( a ) denoting a(ia:ia+m-1,ja:ja+n-1), resulting in row or column pivoting. th pivoting the rows of sub( a ), ipiv should be distributed along a transpose resulting block to its locatio conjugate transpose resulting block to its locatio or inv( p ) to a general m-by-n distributed matrix sub( a ) = a(ia:ia+m-1,ja:ja+n-1), resulting in row or colum or a column. the pivot vector should be aligned with the distributed or inv( p ) to a m-by-n distributed matrix sub( a ) denoting a(ia:ia+m-1,ja:ja+n-1), resulting in row or column pivoting. th pivoting the rows of sub( a ), ipiv should be distributed along a conjugate transpose resulting block to its locatio + need not be set on entry, but are required by the routine to store elements of u, because of fill-in resulting from the ro on exit, the diagonal blocks of s have been rewritten to pair the eigenvalues. the resulting matrix is no longe + need not be set on entry, but are required by the routine to store elements of u, because of fill-in resulting from the ro |
| results results different processes. because of this, it is possible that a heterogeneous system may return incorrect results without any erro gather the intermediate results to process (0,0) gather the intermediate results to process (0,0) the result are only available in the scope of sub( x ), i.e if sub( x ) is distributed along a process row, the correct results ar is distributed along a process column, the correct results are only use a level 1 pblas solve, scaling intermediate results gather the intermediate results to process (0,0) gather the intermediate results to process (0,0) the result are only available in the scope of sub( x ), i.e if sub( x ) is distributed along a process row, the correct results ar is distributed along a process column, the correct results are only static partitioning of work is done at the beginning of pdstebz which results in all processes finding an (almost) equal number o the different processes. because of this, it is possible that a heterogeneous system may return incorrect results without any erro the different processes. because of this, it is possible that a heterogeneous system may return incorrect results without any erro gather the intermediate results to process (0,0) gather the intermediate results to process (0,0) the result are only available in the scope of sub( x ), i.e if sub( x ) is distributed along a process row, the correct results ar is distributed along a process column, the correct results are only static partitioning of work is done at the beginning of psstebz which results in all processes finding an (almost) equal number o the different processes. because of this, it is possible that a heterogeneous system may return incorrect results without any erro the different processes. because of this, it is possible that a heterogeneous system may return incorrect results without any erro different processes. because of this, it is possible that a heterogeneous system may return incorrect results without any erro gather the intermediate results to process (0,0) gather the intermediate results to process (0,0) the result are only available in the scope of sub( x ), i.e if sub( x ) is distributed along a process row, the correct results ar is distributed along a process column, the correct results are only use a level 1 pblas solve, scaling intermediate results |
| retrieve retrieve in the calling subroutine. for example, pjlaenv is used to retrieve the optimal blocksize for strtri as follows nb = pjlaenv( 1, 'strtri', uplo // diag, n, -1, -1, -1 ) |
| return return quick return if possibl quick return if possibl quick return if possibl quick return if possibl quick return if possibl quick return if possibl quick return if possibl quick return if possibl quick return if possibl quick return if possibl quick return if possibl quick return if possibl if fact = 'n', then af(iaf:iaf+n-1,jaf:jaf+n-1) is an output argument and on exit returns the factors l and u from th matrix a(ia:ia+n-1,ja:ja+n-1). different processes. because of this, it is possible that a heterogeneous system may return incorrect results without any erro if range='i', the index (from smallest to largest) of the smallest eigenvalue to be returned. il >= 1 if range='i', the index (from smallest to largest) of the smallest eigenvalue to be returned. il >= 1 memory to an array of dimension locr(n+mod(iv-1,mb_v)). on the final return, v = a*w, where est = norm(v)/norm(w quick return if possibl quick return if possibl quick return if possibl quick return if possibl quick return if possibl quick return if possibl quick return if possibl quick return if possibl if fact = 'n', then af is an output argument and on exit returns the triangular factor u or l from the cholesk matrix a. quick return if possibl quick return if possibl and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin if all eigenvectors are requested, the routine may either return th products q*x and/or q*y, where q is an input unitary quick return if possibl quick return if possibl quick return if possibl quick return if possibl quick return if possibl if fact = 'n', then af(iaf:iaf+n-1,jaf:jaf+n-1) is an output argument and on exit returns the factors l and u from th matrix a(ia:ia+n-1,ja:ja+n-1). memory to an array of dimension locr(n+mod(iv-1,mb_v)). on the final return, v = a*w, where est = norm(v)/norm(w quick return if possibl quick return if possibl quick return if possibl quick return if possibl quick return if possibl if fact = 'n', then af is an output argument and on exit returns the triangular factor u or l from the cholesk matrix a. quick return if possibl quick return if possibl and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin the different processes. because of this, it is possible that a heterogeneous system may return incorrect results without any erro the different processes. because of this, it is possible that a heterogeneous system may return incorrect results without any erro if range='i', the index (from smallest to largest) of the smallest eigenvalue to be returned. il >= 1 if range='i', the index (from smallest to largest) of the smallest eigenvalue to be returned. il >= 1 ispec (global input) integer specifies the parameter to be returned as the value o = 1: the data layout blocksize; quick return if possibl quick return if possibl quick return if possibl quick return if possibl quick return if possibl if fact = 'n', then af(iaf:iaf+n-1,jaf:jaf+n-1) is an output argument and on exit returns the factors l and u from th matrix a(ia:ia+n-1,ja:ja+n-1). memory to an array of dimension locr(n+mod(iv-1,mb_v)). on the final return, v = a*w, where est = norm(v)/norm(w quick return if possibl quick return if possibl quick return if possibl quick return if possibl quick return if possibl if fact = 'n', then af is an output argument and on exit returns the triangular factor u or l from the cholesk matrix a. quick return if possibl quick return if possibl and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin the different processes. because of this, it is possible that a heterogeneous system may return incorrect results without any erro the different processes. because of this, it is possible that a heterogeneous system may return incorrect results without any erro if range='i', the index (from smallest to largest) of the smallest eigenvalue to be returned. il >= 1 if range='i', the index (from smallest to largest) of the smallest eigenvalue to be returned. il >= 1 quick return if possibl quick return if possibl quick return if possibl quick return if possibl quick return if possibl if fact = 'n', then af(iaf:iaf+n-1,jaf:jaf+n-1) is an output argument and on exit returns the factors l and u from th matrix a(ia:ia+n-1,ja:ja+n-1). different processes. because of this, it is possible that a heterogeneous system may return incorrect results without any erro if range='i', the index (from smallest to largest) of the smallest eigenvalue to be returned. il >= 1 if range='i', the index (from smallest to largest) of the smallest eigenvalue to be returned. il >= 1 memory to an array of dimension locr(n+mod(iv-1,mb_v)). on the final return, v = a*w, where est = norm(v)/norm(w quick return if possibl quick return if possibl quick return if possibl quick return if possibl quick return if possibl quick return if possibl quick return if possibl quick return if possibl if fact = 'n', then af is an output argument and on exit returns the triangular factor u or l from the cholesk matrix a. quick return if possibl quick return if possibl and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin if all eigenvectors are requested, the routine may either return th products q*x and/or q*y, where q is an input unitary quick return if possibl quick return if possibl quick return if possibl quick return if possibl quick return if possibl quick return if possibl quick return if possibl |
| returned returned note that permutations are performed on the matrix, so that the factors returned are different from those returne nb*(bwl+bwu)+6*max(bwl,bwu)*max(bwl,bwu) if laf is not large enough, an error code will be returned if lwork is too small, the minimal acceptable size will be returned in work(1) and an error code is returned. lwork> +max(10*npcol+4*nrhs, 8*npcol) 2*(nb+2) if laf is not large enough, an error code will be returned note that permutations are performed on the matrix, so that the factors returned are different from those returne (nb+bwu)*(bwl+bwu)+6*(bwl+bwu)*(bwl+2*bwu) if laf is not large enough, an error code will be returned and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin if m >= n, sub( a ) is overwritten by details of its qr factorization as returned by pcgeqrf factorization as returned by pcgelqf. and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin corresponding right and left singular vectors, respectively. the singular values are returned in array s in decreasing order an computed. and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin query is assumed; the routine only calculates the minimum size for the work array. the required workspace is returned by pxerbla. query is assumed; the routine calculates the size for all work arrays. each of these values is returned in the firs is issued by pxerbla. if range='i', the index (from smallest to largest) of the smallest eigenvalue to be returned. il >= 1 this array contains the local pieces of the triangular factor from the cholesky factorization of sub( b ), as returned b this array contains the local pieces of the triangular factor from the cholesky factorization of sub( b ), as returned b if range='i', the index (from smallest to largest) of the smallest eigenvalue to be returned. il >= 1 this array contains the local pieces of the triangular factor from the cholesky factorization of sub( b ), as returned b and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin the final return, v = a*w, where est = norm(v)/norm(w) (w is not returned) iv (global input) integer ii (global input) integer by using rev 0 & 1, data can be sent out and returned again receiving the replicated b. norm (global input) character specifies the value to be returned in pclange as describe q is a product of k elementary reflectors as returned by pctzrzf currently, only storev = 'r' and direct = 'b' are supported. h of order > n, which is defined as a product of k elementary reflectors as returned by pctzrzf if direct = 'f', h = h(1) h(2) . . . h(k) and t is upper triangular; the scalar tau is returned in the kth element of tau and the vecto are in a( k, m + 1 ), ..., a( k, n ). the elements of r are returned pcmax1 computes the global index of the maximum element in absolute value of a distributed vector sub( x ). the global index is returned note that permutations are performed on the matrix, so that the factors returned are different from those returne (nb+2*bw)*bw if laf is not large enough, an error code will be returned and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin if lwork is too small, the minimal acceptable size will be returned in work(1) and an error code is returned. lwork> +max((10+2*min(100,nrhs))*npcol+4*nrhs, 8*npcol) (nb+2) if laf is not large enough, an error code will be returned and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin contain an n-by-n matrix q (usually the unitary matrix q of schur vectors returned by chseqr) if howmny = 'a', the matrix y of left eigenvectors of t; and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin as returned by pcgeqlf notes as returned by pcgeqrf notes as returned by pcgelqf notes as returned by pcgelqf notes as returned by pcgeqlf notes as returned by pcgeqrf notes as returned by pcgerqf notes as returned by pcgerqf notes as returned by pcgeqlf. q is of order m if side = 'l' and of order as returned by pcgeqrf. q is of order m if side = 'l' and of order define the elementary reflectors h(i) and g(i), whose products determine the matrices q and p, as returned b if vect = 'q', lld_a >= max(1,locr(ia+nq-1)); nq = m if side = 'l' and nq = n if side = 'r'. q is defined as the product of ihi-ilo elementary reflectors, as returned by pcgehrd q = h(ilo) h(ilo+1) . . . h(ihi-1). as returned by pcgelqf. q is of order m if side = 'l' and of order as returned by pcgelqf. q is of order m if side = 'l' and of order as returned by pcgeqlf. q is of order m if side = 'l' and of order as returned by pcgeqrf. q is of order m if side = 'l' and of order as returned by pcgerqf. q is of order m if side = 'l' and of order as returned by pctzrzf. q is of order m if side = 'l' and of order as returned by pcgerqf. q is of order m if side = 'l' and of order as returned by pctzrzf. q is of order m if side = 'l' and of order nq = m if side = 'l' and nq = n if side = 'r'. q is defined as the product of nq-1 elementary reflectors, as returned by pchetrd if uplo = 'u', q = h(nq-1) . . . h(2) h(1); note that permutations are performed on the matrix, so that the factors returned are different from those returne nb*(bwl+bwu)+6*max(bwl,bwu)*max(bwl,bwu) if laf is not large enough, an error code will be returned if lwork is too small, the minimal acceptable size will be returned in work(1) and an error code is returned. lwork> +max(10*npcol+4*nrhs, 8*npcol) 2*(nb+2) if laf is not large enough, an error code will be returned note that permutations are performed on the matrix, so that the factors returned are different from those returne (nb+bwu)*(bwl+bwu)+6*(bwl+bwu)*(bwl+2*bwu) if laf is not large enough, an error code will be returned and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin if m >= n, sub( a ) is overwritten by details of its qr factorization as returned by pdgeqrf factorization as returned by pdgelqf. and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin corresponding right and left singular vectors, respectively. the singular values are returned in array s in decreasing order an computed. and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin the final return, v = a*w, where est = norm(v)/norm(w) (w is not returned) iv (global input) integer ii (global input) integer by using rev 0 & 1, data can be sent out and returned again receiving the replicated b. cmach (global input) character*1 specifies the value to be returned by pdlamch = 's' or 's , pdlamch := sfmin norm (global input) character specifies the value to be returned in pdlange as describe q is a product of k elementary reflectors as returned by pdtzrzf currently, only storev = 'r' and direct = 'b' are supported. h of order > n, which is defined as a product of k elementary reflectors as returned by pdtzrzf if direct = 'f', h = h(1) h(2) . . . h(k) and t is upper triangular; the scalar tau is returned in the kth element of tau and the vecto are in a( k, m + 1 ), ..., a( k, n ). the elements of r are returned as returned by pdgeqlf notes as returned by pdgeqrf notes as returned by pdgelqf notes as returned by pdgelqf notes as returned by pdgeqlf notes as returned by pdgeqrf notes as returned by pdgerqf notes as returned by pdgerqf notes as returned by pdgeqlf. q is of order m if side = 'l' and of order as returned by pdgeqrf. q is of order m if side = 'l' and of order define the elementary reflectors h(i) and g(i), whose products determine the matrices q and p, as returned b if vect = 'q', lld_a >= max(1,locr(ia+nq-1)); nq = m if side = 'l' and nq = n if side = 'r'. q is defined as the product of ihi-ilo elementary reflectors, as returned by pdgehrd q = h(ilo) h(ilo+1) . . . h(ihi-1). as returned by pdgelqf. q is of order m if side = 'l' and of order as returned by pdgelqf. q is of order m if side = 'l' and of order as returned by pdgeqlf. q is of order m if side = 'l' and of order as returned by pdgeqrf. q is of order m if side = 'l' and of order as returned by pdgerqf. q is of order m if side = 'l' and of order as returned by pdtzrzf. q is of order m if side = 'l' and of order as returned by pdgerqf. q is of order m if side = 'l' and of order as returned by pdtzrzf. q is of order m if side = 'l' and of order nq = m if side = 'l' and nq = n if side = 'r'. q is defined as the product of nq-1 elementary reflectors, as returned by pdsytrd if uplo = 'u', q = h(nq-1) . . . h(2) h(1); note that permutations are performed on the matrix, so that the factors returned are different from those returne (nb+2*bw)*bw if laf is not large enough, an error code will be returned and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin if lwork is too small, the minimal acceptable size will be returned in work(1) and an error code is returned. lwork> +max((10+2*min(100,nrhs))*npcol+4*nrhs, 8*npcol) (nb+2) if laf is not large enough, an error code will be returned for eigenvalues. eigenvalues less than vl will not be returned. not referenced if range='a' or 'i' vu (global input) double precision query is assumed; the routine only calculates the minimum size for the work array. the required workspace is returned by pxerbla. and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin query is assumed; the routine only calculates the minimum size for the work array. the required workspace is returned by pxerbla. query is assumed; the routine only calculates the minimum size for the work array. the required workspace is returned by pxerbla. if range='i', the index (from smallest to largest) of the smallest eigenvalue to be returned. il >= 1 this array contains the local pieces of the triangular factor from the cholesky factorization of sub( b ), as returned b this array contains the local pieces of the triangular factor from the cholesky factorization of sub( b ), as returned b if range='i', the index (from smallest to largest) of the smallest eigenvalue to be returned. il >= 1 this array contains the local pieces of the triangular factor from the cholesky factorization of sub( b ), as returned b and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin ispec (global input) integer specifies the parameter to be returned as the value o = 1: the data layout blocksize; note that permutations are performed on the matrix, so that the factors returned are different from those returne nb*(bwl+bwu)+6*max(bwl,bwu)*max(bwl,bwu) if laf is not large enough, an error code will be returned if lwork is too small, the minimal acceptable size will be returned in work(1) and an error code is returned. lwork> +max(10*npcol+4*nrhs, 8*npcol) 2*(nb+2) if laf is not large enough, an error code will be returned note that permutations are performed on the matrix, so that the factors returned are different from those returne (nb+bwu)*(bwl+bwu)+6*(bwl+bwu)*(bwl+2*bwu) if laf is not large enough, an error code will be returned and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin if m >= n, sub( a ) is overwritten by details of its qr factorization as returned by psgeqrf factorization as returned by psgelqf. and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin corresponding right and left singular vectors, respectively. the singular values are returned in array s in decreasing order an computed. and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin the final return, v = a*w, where est = norm(v)/norm(w) (w is not returned) iv (global input) integer ii (global input) integer by using rev 0 & 1, data can be sent out and returned again receiving the replicated b. cmach (global input) character*1 specifies the value to be returned by pslamch = 's' or 's , pslamch := sfmin norm (global input) character specifies the value to be returned in pslange as describe q is a product of k elementary reflectors as returned by pstzrzf currently, only storev = 'r' and direct = 'b' are supported. h of order > n, which is defined as a product of k elementary reflectors as returned by pstzrzf if direct = 'f', h = h(1) h(2) . . . h(k) and t is upper triangular; the scalar tau is returned in the kth element of tau and the vecto are in a( k, m + 1 ), ..., a( k, n ). the elements of r are returned as returned by psgeqlf notes as returned by psgeqrf notes as returned by psgelqf notes as returned by psgelqf notes as returned by psgeqlf notes as returned by psgeqrf notes as returned by psgerqf notes as returned by psgerqf notes as returned by psgeqlf. q is of order m if side = 'l' and of order as returned by psgeqrf. q is of order m if side = 'l' and of order define the elementary reflectors h(i) and g(i), whose products determine the matrices q and p, as returned b if vect = 'q', lld_a >= max(1,locr(ia+nq-1)); nq = m if side = 'l' and nq = n if side = 'r'. q is defined as the product of ihi-ilo elementary reflectors, as returned by psgehrd q = h(ilo) h(ilo+1) . . . h(ihi-1). as returned by psgelqf. q is of order m if side = 'l' and of order as returned by psgelqf. q is of order m if side = 'l' and of order as returned by psgeqlf. q is of order m if side = 'l' and of order as returned by psgeqrf. q is of order m if side = 'l' and of order as returned by psgerqf. q is of order m if side = 'l' and of order as returned by pstzrzf. q is of order m if side = 'l' and of order as returned by psgerqf. q is of order m if side = 'l' and of order as returned by pstzrzf. q is of order m if side = 'l' and of order nq = m if side = 'l' and nq = n if side = 'r'. q is defined as the product of nq-1 elementary reflectors, as returned by pssytrd if uplo = 'u', q = h(nq-1) . . . h(2) h(1); note that permutations are performed on the matrix, so that the factors returned are different from those returne (nb+2*bw)*bw if laf is not large enough, an error code will be returned and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin if lwork is too small, the minimal acceptable size will be returned in work(1) and an error code is returned. lwork> +max((10+2*min(100,nrhs))*npcol+4*nrhs, 8*npcol) (nb+2) if laf is not large enough, an error code will be returned for eigenvalues. eigenvalues less than vl will not be returned. not referenced if range='a' or 'i' vu (global input) real query is assumed; the routine only calculates the minimum size for the work array. the required workspace is returned by pxerbla. and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin query is assumed; the routine only calculates the minimum size for the work array. the required workspace is returned by pxerbla. query is assumed; the routine only calculates the minimum size for the work array. the required workspace is returned by pxerbla. if range='i', the index (from smallest to largest) of the smallest eigenvalue to be returned. il >= 1 this array contains the local pieces of the triangular factor from the cholesky factorization of sub( b ), as returned b this array contains the local pieces of the triangular factor from the cholesky factorization of sub( b ), as returned b if range='i', the index (from smallest to largest) of the smallest eigenvalue to be returned. il >= 1 this array contains the local pieces of the triangular factor from the cholesky factorization of sub( b ), as returned b and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin note that permutations are performed on the matrix, so that the factors returned are different from those returne nb*(bwl+bwu)+6*max(bwl,bwu)*max(bwl,bwu) if laf is not large enough, an error code will be returned if lwork is too small, the minimal acceptable size will be returned in work(1) and an error code is returned. lwork> +max(10*npcol+4*nrhs, 8*npcol) 2*(nb+2) if laf is not large enough, an error code will be returned note that permutations are performed on the matrix, so that the factors returned are different from those returne (nb+bwu)*(bwl+bwu)+6*(bwl+bwu)*(bwl+2*bwu) if laf is not large enough, an error code will be returned and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin if m >= n, sub( a ) is overwritten by details of its qr factorization as returned by pzgeqrf factorization as returned by pzgelqf. and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin corresponding right and left singular vectors, respectively. the singular values are returned in array s in decreasing order an computed. and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin query is assumed; the routine only calculates the minimum size for the work array. the required workspace is returned by pxerbla. query is assumed; the routine calculates the size for all work arrays. each of these values is returned in the firs is issued by pxerbla. if range='i', the index (from smallest to largest) of the smallest eigenvalue to be returned. il >= 1 this array contains the local pieces of the triangular factor from the cholesky factorization of sub( b ), as returned b this array contains the local pieces of the triangular factor from the cholesky factorization of sub( b ), as returned b if range='i', the index (from smallest to largest) of the smallest eigenvalue to be returned. il >= 1 this array contains the local pieces of the triangular factor from the cholesky factorization of sub( b ), as returned b and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin the final return, v = a*w, where est = norm(v)/norm(w) (w is not returned) iv (global input) integer ii (global input) integer by using rev 0 & 1, data can be sent out and returned again receiving the replicated b. norm (global input) character specifies the value to be returned in pzlange as describe q is a product of k elementary reflectors as returned by pztzrzf currently, only storev = 'r' and direct = 'b' are supported. h of order > n, which is defined as a product of k elementary reflectors as returned by pztzrzf if direct = 'f', h = h(1) h(2) . . . h(k) and t is upper triangular; the scalar tau is returned in the kth element of tau and the vecto are in a( k, m + 1 ), ..., a( k, n ). the elements of r are returned pzmax1 computes the global index of the maximum element in absolute value of a distributed vector sub( x ). the global index is returned note that permutations are performed on the matrix, so that the factors returned are different from those returne (nb+2*bw)*bw if laf is not large enough, an error code will be returned and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin if lwork is too small, the minimal acceptable size will be returned in work(1) and an error code is returned. lwork> +max((10+2*min(100,nrhs))*npcol+4*nrhs, 8*npcol) (nb+2) if laf is not large enough, an error code will be returned and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin contain an n-by-n matrix q (usually the unitary matrix q of schur vectors returned by zhseqr) if howmny = 'a', the matrix y of left eigenvectors of t; and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin and optimal size for all work arrays. each of these values is returned in the first entry of the correspondin as returned by pzgeqlf notes as returned by pzgeqrf notes as returned by pzgelqf notes as returned by pzgelqf notes as returned by pzgeqlf notes as returned by pzgeqrf notes as returned by pzgerqf notes as returned by pzgerqf notes as returned by pzgeqlf. q is of order m if side = 'l' and of order as returned by pzgeqrf. q is of order m if side = 'l' and of order define the elementary reflectors h(i) and g(i), whose products determine the matrices q and p, as returned b if vect = 'q', lld_a >= max(1,locr(ia+nq-1)); nq = m if side = 'l' and nq = n if side = 'r'. q is defined as the product of ihi-ilo elementary reflectors, as returned by pzgehrd q = h(ilo) h(ilo+1) . . . h(ihi-1). as returned by pzgelqf. q is of order m if side = 'l' and of order as returned by pzgelqf. q is of order m if side = 'l' and of order as returned by pzgeqlf. q is of order m if side = 'l' and of order as returned by pzgeqrf. q is of order m if side = 'l' and of order as returned by pzgerqf. q is of order m if side = 'l' and of order as returned by pztzrzf. q is of order m if side = 'l' and of order as returned by pzgerqf. q is of order m if side = 'l' and of order as returned by pztzrzf. q is of order m if side = 'l' and of order nq = m if side = 'l' and nq = n if side = 'r'. q is defined as the product of nq-1 elementary reflectors, as returned by pzhetrd if uplo = 'u', q = h(nq-1) . . . h(2) h(1); |
| returning returning mq0 = numroc( max( neig, nb, 2 ), nb, 0, 0, npcol ) iceil( x, y ) is a scalapack function returning mq0 = numroc( max( neig, nb, 2 ), nb, 0, 0, npcol ) iceil( x, y ) is a scalapack function returning mq0 = numroc( max( neig, nb, 2 ), nb, 0, 0, npcol ) iceil( x, y ) is a scalapack function returning mq0 = numroc( max( neig, nb, 2 ), nb, 0, 0, npcol ) iceil( x, y ) is a scalapack function returning mq0 = numroc( max( neig, nb, 2 ), nb, 0, 0, npcol ) iceil( x, y ) is a scalapack function returning mq0 = numroc( max( neig, nb, 2 ), nb, 0, 0, npcol ) iceil( x, y ) is a scalapack function returning mq0 = numroc( max( neig, nb, 2 ), nb, 0, 0, npcol ) iceil( x, y ) is a scalapack function returning mq0 = numroc( max( neig, nb, 2 ), nb, 0, 0, npcol ) iceil( x, y ) is a scalapack function returning |
| returns returns dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work( 1 ) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer m-by-n distributed matrix sub( a ) = a(ia:ia+n-1,ja:ja:ja+n-1) and reduce its condition number. r returns the row scale factors and each row and column of the distributed matrix b with elements dimension (lwork) on exit, work( 1 ) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work( 1 ) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer (lwork) on exit, if info = 0, work(1) returns the optimal lwork lwork (local input) integer if fact = 'n', then af(iaf:iaf+n-1,jaf:jaf+n-1) is an output argument and on exit returns the factors l and u from th matrix a(ia:ia+n-1,ja:ja+n-1). dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on output, work(1) returns the workspace needed to guarante may also be incorrect. dimension (lwork) on output, work(1) returns the workspace needed for th set to twice the underflow threshold 2*pslamch('s') not zero.
if this routine returns with ((mod(info,2).ne.0) .or
eigenvectors did not converge, try setting abstol to
set to twice the underflow threshold 2*pslamch('s') not zero.
if this routine returns with ((mod(info,2).ne.0) .or
eigenvectors did not converge, try setting abstol to
dimension (lwork) on exit, work( 1 ) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work( 1 ) returns the optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work( 1 ) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work( 1 ) returns the minimal and optimal lwork lwork (local or global input) integer work (local workspace) complex array, dimension (lwork) on exit, work( 1 ) returns the minimal and optimal workspac lwork (local input) integer or lower bidiagonal form by an unitary transformation q' * a * p, and returns the matrices x and y which are needed to apply the transfor performed by an unitary similarity transformation q' * a * q. the routine returns the matrices v and t which determine q as a bloc pclange returns the value of the one norm, or the frobenius norm distributed matrix sub( a ) = a(ia:ia+m-1, ja:ja+n-1). pclassq returns the values scl and smsq such tha ( scl**2 )*smsq = x( 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq, tridiagonal form by an unitary similarity transformation q' * sub( a ) * q, and returns the matrices v and w which ar dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer if fact = 'n', then af is an output argument and on exit returns the triangular factor u or l from the cholesk matrix a. dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work( 1 ) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer m-by-n distributed matrix sub( a ) = a(ia:ia+n-1,ja:ja:ja+n-1) and reduce its condition number. r returns the row scale factors and each row and column of the distributed matrix b with elements dimension (lwork) on exit, work( 1 ) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work( 1 ) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer (lwork) on exit, if info = 0, work(1) returns the optimal lwork lwork (local input) integer if fact = 'n', then af(iaf:iaf+n-1,jaf:jaf+n-1) is an output argument and on exit returns the factors l and u from th matrix a(ia:ia+n-1,ja:ja+n-1). dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer pdlabad takes as input the values computed by pdlamch for underflow and overflow, and returns the square root of each of these values i to identify machines with a large exponent range, such as the crays, or lower bidiagonal form by an orthogonal transformation q' * a * p, and returns the matrices x and y which are needed to apply th k-th subdiagonal are zero. the reduction is performed by an orthogo- nal similarity transformation q' * a * q. the routine returns th and also the matrix y = a * v * t. pdlange returns the value of the one norm, or the frobenius norm distributed matrix sub( a ) = a(ia:ia+m-1, ja:ja+n-1). pdlassq returns the values scl and smsq such tha ( scl**2 )*smsq = x( 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq, form by an orthogonal similarity transformation q' * sub( a ) * q, and returns the matrices v and w which are needed to apply th dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer if fact = 'n', then af is an output argument and on exit returns the triangular factor u or l from the cholesk matrix a. dimension (lwork) on output, work(1) returns the workspace needed lwork (local input/output) integer, dimension (lwork) version 1.0: on output, work(1) returns the workspac if the input parameters are incorrect, work(1) may also be dimension (lwork) on output, work(1) returns the workspace required lwork (local input) integer set to twice the underflow threshold 2*pdlamch('s') not zero.
if this routine returns with ((mod(info,2).ne.0) .or
eigenvectors did not converge, try setting abstol to
set to twice the underflow threshold 2*pdlamch('s') not zero.
if this routine returns with ((mod(info,2).ne.0) .or
eigenvectors did not converge, try setting abstol to
dimension (lwork) on exit, work( 1 ) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work( 1 ) returns the optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work( 1 ) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work( 1 ) returns the minimal and optimal lwork lwork (local or global input) integer work (local workspace) double precision array, dimension (lwork) on exit, work( 1 ) returns the minimal and optimal workspac lwork (local input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer pdzsum1 returns the sum of absolute values of a comple pscsum1 returns the sum of absolute values of a comple dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work( 1 ) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer m-by-n distributed matrix sub( a ) = a(ia:ia+n-1,ja:ja:ja+n-1) and reduce its condition number. r returns the row scale factors and each row and column of the distributed matrix b with elements dimension (lwork) on exit, work( 1 ) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work( 1 ) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer (lwork) on exit, if info = 0, work(1) returns the optimal lwork lwork (local input) integer if fact = 'n', then af(iaf:iaf+n-1,jaf:jaf+n-1) is an output argument and on exit returns the factors l and u from th matrix a(ia:ia+n-1,ja:ja+n-1). dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer pslabad takes as input the values computed by pslamch for underflow and overflow, and returns the square root of each of these values i to identify machines with a large exponent range, such as the crays, or lower bidiagonal form by an orthogonal transformation q' * a * p, and returns the matrices x and y which are needed to apply th k-th subdiagonal are zero. the reduction is performed by an orthogo- nal similarity transformation q' * a * q. the routine returns th and also the matrix y = a * v * t. pslange returns the value of the one norm, or the frobenius norm distributed matrix sub( a ) = a(ia:ia+m-1, ja:ja+n-1). pslassq returns the values scl and smsq such tha ( scl**2 )*smsq = x( 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq, form by an orthogonal similarity transformation q' * sub( a ) * q, and returns the matrices v and w which are needed to apply th dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer if fact = 'n', then af is an output argument and on exit returns the triangular factor u or l from the cholesk matrix a. dimension (lwork) on output, work(1) returns the workspace needed lwork (local input/output) integer, dimension (lwork) version 1.0: on output, work(1) returns the workspac if the input parameters are incorrect, work(1) may also be dimension (lwork) on output, work(1) returns the workspace required lwork (local input) integer set to twice the underflow threshold 2*pslamch('s') not zero.
if this routine returns with ((mod(info,2).ne.0) .or
eigenvectors did not converge, try setting abstol to
set to twice the underflow threshold 2*pslamch('s') not zero.
if this routine returns with ((mod(info,2).ne.0) .or
eigenvectors did not converge, try setting abstol to
dimension (lwork) on exit, work( 1 ) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work( 1 ) returns the optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work( 1 ) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work( 1 ) returns the minimal and optimal lwork lwork (local or global input) integer work (local workspace) real array, dimension (lwork) on exit, work( 1 ) returns the minimal and optimal workspac lwork (local input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work( 1 ) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer m-by-n distributed matrix sub( a ) = a(ia:ia+n-1,ja:ja:ja+n-1) and reduce its condition number. r returns the row scale factors and each row and column of the distributed matrix b with elements dimension (lwork) on exit, work( 1 ) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work( 1 ) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer (lwork) on exit, if info = 0, work(1) returns the optimal lwork lwork (local input) integer if fact = 'n', then af(iaf:iaf+n-1,jaf:jaf+n-1) is an output argument and on exit returns the factors l and u from th matrix a(ia:ia+n-1,ja:ja+n-1). dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on output, work(1) returns the workspace needed to guarante may also be incorrect. dimension (lwork) on output, work(1) returns the workspace needed for th set to twice the underflow threshold 2*pdlamch('s') not zero.
if this routine returns with ((mod(info,2).ne.0) .or
eigenvectors did not converge, try setting abstol to
set to twice the underflow threshold 2*pdlamch('s') not zero.
if this routine returns with ((mod(info,2).ne.0) .or
eigenvectors did not converge, try setting abstol to
dimension (lwork) on exit, work( 1 ) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work( 1 ) returns the optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work( 1 ) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work( 1 ) returns the minimal and optimal lwork lwork (local or global input) integer work (local workspace) complex*16 array, dimension (lwork) on exit, work( 1 ) returns the minimal and optimal workspac lwork (local input) integer or lower bidiagonal form by an unitary transformation q' * a * p, and returns the matrices x and y which are needed to apply the transfor performed by an unitary similarity transformation q' * a * q. the routine returns the matrices v and t which determine q as a bloc pzlange returns the value of the one norm, or the frobenius norm distributed matrix sub( a ) = a(ia:ia+m-1, ja:ja+n-1). pzlassq returns the values scl and smsq such tha ( scl**2 )*smsq = x( 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq, tridiagonal form by an unitary similarity transformation q' * sub( a ) * q, and returns the matrices v and w which ar dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer if fact = 'n', then af is an output argument and on exit returns the triangular factor u or l from the cholesk matrix a. dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer dimension (lwork) on exit, work(1) returns the minimal and optimal lwork lwork (local or global input) integer |
| reused reused ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size ******************************** values reused throughout routin user-input value of partition size |
| REV REV on entry, the parallel matrix to be copied into or from. on exit, if REV=1, the copied data on entry, the parallel matrix to be copied into or from. on exit, if REV=1, the copied data on entry, the parallel matrix to be copied into or from. on exit, if REV=1, the copied data on entry, the parallel matrix to be copied into or from. on exit, if REV=1, the copied data |
| Reverse Reverse pclacon estimates the 1-norm of a square, complex distributed matrix a. Reverse communication is used for evaluating matrix-vecto information is implicitly contained within iv, ix, descv, and descx. pdlacon estimates the 1-norm of a square, real distributed matrix a. Reverse communication is used for evaluating matrix-vector products is implicitly contained within iv, ix, descv, and descx. pslacon estimates the 1-norm of a square, real distributed matrix a. Reverse communication is used for evaluating matrix-vector products is implicitly contained within iv, ix, descv, and descx. pzlacon estimates the 1-norm of a square, complex distributed matrix a. Reverse communication is used for evaluating matrix-vecto information is implicitly contained within iv, ix, descv, and descx. |
| rewritten rewritten on entry, a matrix already in schur form. on exit, the diagonal blocks of s have been rewritten to pai similar to the input. on entry, a matrix already in schur form. on exit, the diagonal blocks of s have been rewritten to pai similar to the input. |
| RHO RHO t = q(in) ( d(in) + RHO * z*z' ) q'(in) = q(out) * d(out) * q'(out where z = q'u, u is a vector of length n with ones in the RHO (global input/output) double precisio cut which originally split the two submatrices which are now pdlaed3 finds the roots of the secular equation, as defined by the values in d, w, and RHO, between 1 and k. it makes th t = q(in) ( d(in) + RHO * z*z' ) q'(in) = q(out) * d(out) * q'(out where z = q'u, u is a vector of length n with ones in the RHO (global input/output) rea cut which originally split the two submatrices which are now pslaed3 finds the roots of the secular equation, as defined by the values in d, w, and RHO, between 1 and k. it makes th |
| RHS RHS first copy and multiply it into temporary storage, then use it on RHS use offdiagonal block to calculate modification to RHS store first copy and multiply it into temporary storage, then use it on RHS use offdiagonal block to calculate modification to RHS store first copy and multiply it into temporary storage, then use it on RHS use offdiagonal block to calculate modification to RHS store first copy and multiply it into temporary storage, then use it on RHS use offdiagonal block to calculate modification to RHS store first copy and multiply it into temporary storage, then use it on RHS use offdiagonal block to calculate modification to RHS store first copy and multiply it into temporary storage, then use it on RHS use offdiagonal block to calculate modification to RHS store first copy and multiply it into temporary storage, then use it on RHS use offdiagonal block to calculate modification to RHS store first copy and multiply it into temporary storage, then use it on RHS use offdiagonal block to calculate modification to RHS store |
| right right nrhs (input) integer the number of right hand sides, i.e., the number of column the first iteration of this loop determines a reflection g from the vector v and applies it from left and right to h nrhs (input) integer the number of right hand sides, i.e., the number of column nrhs (input) integer the number of right hand sides, i.e., the number of column nrhs (input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. where sub( b ) denotes b( ib:ib+m-1, jb:jb+nrhs-1 ) when trans = 'n' and b( ib:ib+n-1, jb:jb+nrhs-1 ) otherwise. several right hand sid when trans = 'n', the solution vectors are stored as the columns of nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column pcgesvd computes the singular value decomposition (svd) of an m-by-n matrix a, optionally computing the left and/or right nrhs (global input) integer the number of right-hand sides, i.e., the number of column x(ix:ix+n-1,jx:jx+nrhs-1). nrhs >= 0. this is the right-looking parallel level 2 blas version of th this is the right-looking parallel level 3 blas version of th nrhs (global input) integer the number of right hand sides, i.e., the number of column square blocks. there are 5 buffers that each node stores these values: a buffer to send diagonally down and right, a buffe up and left and a buffer to send right. each of these buffers transpose q**h to a complex m-by-n distributed matrix sub( c ) denoting c(ic:ic+m-1,jc:jc+n-1), from the left or the right notes transpose q**h to a complex m-by-n distributed matrix sub( c ) denoting c(ic:ic+m-1,jc:jc+n-1), from the left or the right q is a product of k elementary reflectors as returned by pctzrzf. nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape pctrevc computes some or all of the right and/or left eigenvectors o nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column = 'l': apply q or q**h from the left; = 'r': apply q or q**h from the right trans (global input) character = 'l': apply q or q**h from the left; = 'r': apply q or q**h from the right trans (global input) character = 'l': apply q, q**h, p or p**h from the left; = 'r': apply q, q**h, p or p**h from the right trans (global input) character = 'l': apply q or q**h from the left; = 'r': apply q or q**h from the right trans (global input) character = 'l': apply q or q**h from the left; = 'r': apply q or q**h from the right trans (global input) character = 'l': apply q or q**h from the left; = 'r': apply q or q**h from the right trans (global input) character = 'l': apply q or q**h from the left; = 'r': apply q or q**h from the right trans (global input) character = 'l': apply q or q**h from the left; = 'r': apply q or q**h from the right trans (global input) character = 'l': apply q or q**h from the left; = 'r': apply q or q**h from the right trans (global input) character = 'l': apply q or q**h from the left; = 'r': apply q or q**h from the right trans (global input) character = 'l': apply q or q**h from the left; = 'r': apply q or q**h from the right trans (global input) character = 'l': apply q or q**h from the left; = 'r': apply q or q**h from the right trans (global input) character = 'l': apply q or q**h from the left; = 'r': apply q or q**h from the right uplo (global input) character nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. where sub( b ) denotes b( ib:ib+m-1, jb:jb+nrhs-1 ) when trans = 'n' and b( ib:ib+n-1, jb:jb+nrhs-1 ) otherwise. several right hand sid when trans = 'n', the solution vectors are stored as the columns of nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column pdgesvd computes the singular value decomposition (svd) of an m-by-n matrix a, optionally computing the left and/or right nrhs (global input) integer the number of right-hand sides, i.e., the number of column x(ix:ix+n-1,jx:jx+nrhs-1). nrhs >= 0. this is the right-looking parallel level 2 blas version of th this is the right-looking parallel level 3 blas version of th nrhs (global input) integer the number of right hand sides, i.e., the number of column square blocks. there are 5 buffers that each node stores these values: a buffer to send diagonally down and right, a buffe up and left and a buffer to send right. each of these buffers the endpoints of the intervals. intvl(2*j-1) is the left endpoint of the j-th interval, and intvl(2*j) is the right in general, be modified, split and reordered by the the endpoints of the intervals. intvl(2*j-1) is the left oendpoint f the j-th interval, and intvl(2*j) is the right in general, be reordered on output. real distributed m-by-n matrix sub( c ) = c(ic:ic+m-1,jc:jc+n-1) from the left or the right notes a real distributed m-by-n matrix sub( c ) = c(ic:ic+m-1,jc:jc+n-1) from the left or the right q is a product of k elementary reflectors as returned by pdtzrzf. = 'l': apply q or q**t from the left; = 'r': apply q or q**t from the right trans (global input) character = 'l': apply q or q**t from the left; = 'r': apply q or q**t from the right trans (global input) character = 'l': apply q, q**t, p or p**t from the left; = 'r': apply q, q**t, p or p**t from the right trans (global input) character = 'l': apply q or q**t from the left; = 'r': apply q or q**t from the right trans (global input) character = 'l': apply q or q**t from the left; = 'r': apply q or q**t from the right trans (global input) character = 'l': apply q or q**t from the left; = 'r': apply q or q**t from the right trans (global input) character = 'l': apply q or q**t from the left; = 'r': apply q or q**t from the right trans (global input) character = 'l': apply q or q**t from the left; = 'r': apply q or q**t from the right trans (global input) character = 'l': apply q or q**t from the left; = 'r': apply q or q**t from the right trans (global input) character = 'l': apply q or q**t from the left; = 'r': apply q or q**t from the right trans (global input) character = 'l': apply q or q**t from the left; = 'r': apply q or q**t from the right trans (global input) character = 'l': apply q or q**t from the left; = 'r': apply q or q**t from the right trans (global input) character = 'l': apply q or q**t from the left; = 'r': apply q or q**t from the right uplo (global input) character nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. where sub( b ) denotes b( ib:ib+m-1, jb:jb+nrhs-1 ) when trans = 'n' and b( ib:ib+n-1, jb:jb+nrhs-1 ) otherwise. several right hand sid when trans = 'n', the solution vectors are stored as the columns of nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column psgesvd computes the singular value decomposition (svd) of an m-by-n matrix a, optionally computing the left and/or right nrhs (global input) integer the number of right-hand sides, i.e., the number of column x(ix:ix+n-1,jx:jx+nrhs-1). nrhs >= 0. this is the right-looking parallel level 2 blas version of th this is the right-looking parallel level 3 blas version of th nrhs (global input) integer the number of right hand sides, i.e., the number of column square blocks. there are 5 buffers that each node stores these values: a buffer to send diagonally down and right, a buffe up and left and a buffer to send right. each of these buffers the endpoints of the intervals. intvl(2*j-1) is the left endpoint of the j-th interval, and intvl(2*j) is the right in general, be modified, split and reordered by the the endpoints of the intervals. intvl(2*j-1) is the left oendpoint f the j-th interval, and intvl(2*j) is the right in general, be reordered on output. real distributed m-by-n matrix sub( c ) = c(ic:ic+m-1,jc:jc+n-1) from the left or the right notes a real distributed m-by-n matrix sub( c ) = c(ic:ic+m-1,jc:jc+n-1) from the left or the right q is a product of k elementary reflectors as returned by pstzrzf. = 'l': apply q or q**t from the left; = 'r': apply q or q**t from the right trans (global input) character = 'l': apply q or q**t from the left; = 'r': apply q or q**t from the right trans (global input) character = 'l': apply q, q**t, p or p**t from the left; = 'r': apply q, q**t, p or p**t from the right trans (global input) character = 'l': apply q or q**t from the left; = 'r': apply q or q**t from the right trans (global input) character = 'l': apply q or q**t from the left; = 'r': apply q or q**t from the right trans (global input) character = 'l': apply q or q**t from the left; = 'r': apply q or q**t from the right trans (global input) character = 'l': apply q or q**t from the left; = 'r': apply q or q**t from the right trans (global input) character = 'l': apply q or q**t from the left; = 'r': apply q or q**t from the right trans (global input) character = 'l': apply q or q**t from the left; = 'r': apply q or q**t from the right trans (global input) character = 'l': apply q or q**t from the left; = 'r': apply q or q**t from the right trans (global input) character = 'l': apply q or q**t from the left; = 'r': apply q or q**t from the right trans (global input) character = 'l': apply q or q**t from the left; = 'r': apply q or q**t from the right trans (global input) character = 'l': apply q or q**t from the left; = 'r': apply q or q**t from the right uplo (global input) character nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. where sub( b ) denotes b( ib:ib+m-1, jb:jb+nrhs-1 ) when trans = 'n' and b( ib:ib+n-1, jb:jb+nrhs-1 ) otherwise. several right hand sid when trans = 'n', the solution vectors are stored as the columns of nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column pzgesvd computes the singular value decomposition (svd) of an m-by-n matrix a, optionally computing the left and/or right nrhs (global input) integer the number of right-hand sides, i.e., the number of column x(ix:ix+n-1,jx:jx+nrhs-1). nrhs >= 0. this is the right-looking parallel level 2 blas version of th this is the right-looking parallel level 3 blas version of th nrhs (global input) integer the number of right hand sides, i.e., the number of column square blocks. there are 5 buffers that each node stores these values: a buffer to send diagonally down and right, a buffe up and left and a buffer to send right. each of these buffers transpose q**h to a complex m-by-n distributed matrix sub( c ) denoting c(ic:ic+m-1,jc:jc+n-1), from the left or the right notes transpose q**h to a complex m-by-n distributed matrix sub( c ) denoting c(ic:ic+m-1,jc:jc+n-1), from the left or the right q is a product of k elementary reflectors as returned by pztzrzf. nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. convert descriptor into standard form for easy access to parameters, check that grid is of right shape pztrevc computes some or all of the right and/or left eigenvectors o nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column = 'l': apply q or q**h from the left; = 'r': apply q or q**h from the right trans (global input) character = 'l': apply q or q**h from the left; = 'r': apply q or q**h from the right trans (global input) character = 'l': apply q, q**h, p or p**h from the left; = 'r': apply q, q**h, p or p**h from the right trans (global input) character = 'l': apply q or q**h from the left; = 'r': apply q or q**h from the right trans (global input) character = 'l': apply q or q**h from the left; = 'r': apply q or q**h from the right trans (global input) character = 'l': apply q or q**h from the left; = 'r': apply q or q**h from the right trans (global input) character = 'l': apply q or q**h from the left; = 'r': apply q or q**h from the right trans (global input) character = 'l': apply q or q**h from the left; = 'r': apply q or q**h from the right trans (global input) character = 'l': apply q or q**h from the left; = 'r': apply q or q**h from the right trans (global input) character = 'l': apply q or q**h from the left; = 'r': apply q or q**h from the right trans (global input) character = 'l': apply q or q**h from the left; = 'r': apply q or q**h from the right trans (global input) character = 'l': apply q or q**h from the left; = 'r': apply q or q**h from the right trans (global input) character = 'l': apply q or q**h from the left; = 'r': apply q or q**h from the right uplo (global input) character nrhs (input) integer the number of right hand sides, i.e., the number of column nrhs (input) integer the number of right hand sides, i.e., the number of column nrhs (input) integer the number of right hand sides, i.e., the number of column the first iteration of this loop determines a reflection g from the vector v and applies it from left and right to h nrhs (input) integer the number of right hand sides, i.e., the number of column |
| righthand righthand normalize and scale the righthand side vector pb if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. use the "spike" fillin to calculate contribution to previous processor's righthand-side if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. use the "spike" fillin to calculate contribution to previous processor's righthand-side if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. use the "spike" fillin to calculate contribution to previous processor's righthand-side if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. use the "spike" fillin to calculate contribution to previous processor's righthand-side if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. use the "spike" fillin to calculate contribution to previous processor's righthand-side if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. use the "spike" fillin to calculate contribution to previous processor's righthand-side if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. use the "spike" fillin to calculate contribution to previous processor's righthand-side if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. use the "spike" fillin to calculate contribution to previous processor's righthand-side if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. use the "spike" fillin to calculate contribution to previous processor's righthand-side if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. use the "spike" fillin to calculate contribution to previous processor's righthand-side if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. use the "spike" fillin to calculate contribution to previous processor's righthand-side if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. use the "spike" fillin to calculate contribution to previous processor's righthand-side if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. use the "spike" fillin to calculate contribution to previous processor's righthand-side if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. use the "spike" fillin to calculate contribution to previous processor's righthand-side if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. use the "spike" fillin to calculate contribution to previous processor's righthand-side if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. if the factorization routine and the solve routine are to be called separately (to solve various sets of righthand sides using the sam between calls to the factorization routine and the solve routine. use the "spike" fillin to calculate contribution to previous processor's righthand-side normalize and scale the righthand side vector pb |
| rization rization hermitian positive definite distributed matrix using the cholesky factorization sub( a ) = u**h*u or l*l**h computed by pcpotrf symmetric positive definite distributed matrix using the cholesky factorization sub( a ) = u**t*u or l*l**t computed by pdpotrf symmetric positive definite distributed matrix using the cholesky factorization sub( a ) = u**t*u or l*l**t computed by pspotrf hermitian positive definite distributed matrix using the cholesky factorization sub( a ) = u**h*u or l*l**h computed by pzpotrf |
| rmax rmax = 'l' or 'l', pdlamch := emax = 'o' or 'o', pdlamch := rmax where = 'l' or 'l', pslamch := emax = 'o' or 'o', pslamch := rmax where |
| rmin rmin pdlamch determines double precision machine parameters arguments pslamch determines single precision machine parameters arguments |
| rnd rnd = 'n' or 'n', pdlamch := t = 'r' or 'r', pdlamch := rnd = 'u' or 'u', pdlamch := rmin = 'n' or 'n', pslamch := t = 'r' or 'r', pslamch := rnd = 'u' or 'u', pslamch := rmin |
| robust robust substitution. it is the hope that scaling would be used to make the the code robust against possible overflow. but scaling has not ye the triangular systems. pclattrs just calls pctrsv. substitution. it is the hope that scaling would be used to make the the code robust against possible overflow. but scaling has not ye the triangular systems. pzlattrs just calls pztrsv. |
| root root normi denotes the infinity norm of a matrix (maximum row sum) and normf denotes the frobenius norm of a matrix (square root of sum o pdlabad takes as input the values computed by pdlamch for underflow and overflow, and returns the square root of each of these values i to identify machines with a large exponent range, such as the crays, normi denotes the infinity norm of a matrix (maximum row sum) and normf denotes the frobenius norm of a matrix (square root of sum o pslabad takes as input the values computed by pslamch for underflow and overflow, and returns the square root of each of these values i to identify machines with a large exponent range, such as the crays, normi denotes the infinity norm of a matrix (maximum row sum) and normf denotes the frobenius norm of a matrix (square root of sum o normi denotes the infinity norm of a matrix (maximum row sum) and normf denotes the frobenius norm of a matrix (square root of sum o |
| roots roots to identify machines with a large exponent range, such as the crays, and redefine the underflow and overflow limits to be the square roots pdlamch does not compensate for poor arithmetic in the upper half of the second stage consists of calculating the updated eigenvalues. this is done by finding the roots of the secula this routine also calculates the eigenvectors of the current pdlaed3 finds the roots of the secular equation, as defined by th appropriate calls to slaed4 real roots: use wilkinson's shift twic to identify machines with a large exponent range, such as the crays, and redefine the underflow and overflow limits to be the square roots pslamch does not compensate for poor arithmetic in the upper half of the second stage consists of calculating the updated eigenvalues. this is done by finding the roots of the secula this routine also calculates the eigenvectors of the current pslaed3 finds the roots of the secular equation, as defined by th appropriate calls to slaed4 real roots: use wilkinson's shift twic |
| rotation rotation sn (output) complex parameters of the rotation matrix further details sn (output) complex*16 parameters of the rotation matrix further details |
| rotations rotations if eigenvectors are desired, then save rotations if eigenvectors are desired, then save rotations if eigenvectors are desired, then save rotations if eigenvectors are desired, then save rotations |
| ROTN ROTN find a value for ROTN find a value for ROTN find a value for ROTN find a value for ROTN |
| round round test if processor is active in next round test if processor is active in next round test if processor is active in next round test if processor is active in next round |
| rounding rounding t = number of (base) digits in the mantissa rnd = 1.0 when rounding occurs in addition, 0.0 otherwis rmin = underflow threshold - base**(emin-1) t = number of (base) digits in the mantissa rnd = 1.0 when rounding occurs in addition, 0.0 otherwis rmin = underflow threshold - base**(emin-1) |
| roundoff roundoff determine the unit roundoff and over/underflow thresholds determine the unit roundoff and over/underflow thresholds |
| routine routine array elements marked * are not used by the routine; elements marke elements of u, because of fill-in resulting from the row go through, n should be at least 4*nbulge+2. otherwise, nbulge may be reduced by this routine ulp (local input) real level 2 blas routine array elements marked * are not used by the routine; elements marke elements of u, because of fill-in resulting from the row go through, n should be at least 4*nbulge+2. otherwise, nbulge may be reduced by this routine ulp (local input) double precision since every 2nd subdiagonal is guaranteed to be zero. this routine does no parallel work arguments level 2 blas routine complex temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. .. .. external subroutines . .. external functions .. routine pcdbtrf must be called first ===================================================================== .. .. external subroutines . .. external functions .. complex temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. .. .. external subroutines . .. external functions .. routine pcdttrf must be called first ===================================================================== .. .. external subroutines . .. external functions .. complex temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. .. .. external subroutines . .. external functions .. routine pcgbtrf must be called first ===================================================================== myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace tool function numroc; nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace this routine requires square block decomposition ( mb_a = nb_a ) arguments if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu as the first element of work and no error message is issued if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding this routine requires n <= nb_a-mod(ja-1, nb_a) and square bloc this routine requires square block decomposition ( mb_a = nb_a ) arguments if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding this routine requires square block data decomposition ( mb_a=nb_a ) arguments myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace of a real symmetric matrix a by calling the recommended sequence of scalapack routines in its present form, pcheev assumes a homogeneous system and makes if lwork = -1, then lwork is global input and a workspace query is assumed; the routine calculates the size for al entry of the corresponding work array, and no error message of a complex hermitian matrix a by calling the recommended sequence of scalapack routines. eigenvalues/vectors can be selected b eigenvalues. amount by which the eigenvalues should be scaled to compensate for the scaling performed in this routine returned here to allow for future enhancement. set to twice the underflow threshold 2*pslamch('s') not zero.
if this routine returns with ((mod(info,2).ne.0) .or
eigenvectors did not converge, try setting abstol to
amount by which the eigenvalues should be scaled to compensate for the scaling performed in this routine returned here to allow for future enhancement. if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace this is an auxiliary routine called by pcgebrd notes this routine does a global maximum and must be called by al pclacp3 is an auxiliary routine that copies from a global paralle the entire submatrix that is copied gets placed on one node or .. .. external subroutines . .. intrinsic functions .. performed by an unitary similarity transformation q' * a * q. the routine returns the matrices v and t which determine q as a bloc this is an auxiliary routine called by pchetrd to redistribute d, or a column. the pivot vector should be aligned with the distributed matrix a. this routine will transpose the pivot vector if necessary sub( a ), pass rowcol='c' and pivroc='c'. this routine does a global maximum and must be called by al the routine makes only one pass through the vector sub( x ) notes interchange is initiated for each of rows or columns k1 trough k2 of sub( a ). this routine assumes that the pivoting information ha also note that this routine will only work for k1-k2 being in the this is an auxiliary routine called by pchetrd notes .. .. external subroutines . .. intrinsic functions .. this is the unblocked form of the algorithm, calling level 2 blas. no communication is performed by this routine, the matrix to operat complex temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. .. .. external subroutines . .. external functions .. routine pcpbtrf must be called first ===================================================================== .. .. external subroutines . .. external functions .. if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding this routine requires square block decomposition ( mb_a = nb_a ) arguments if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding this routine requires n <= nb_a-mod(ja-1, nb_a) and square bloc this routine requires square block decomposition ( mb_a = nb_a ) arguments this routine requires square block decomposition ( mb_a = nb_a ) arguments complex temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. .. .. external subroutines . .. external functions .. routine pcpttrf must be called first ===================================================================== .. .. external subroutines . .. external functions .. process. pcstein decides on the allocation of work among the processes and then calls sstein2 (modified lapack routine) on eac expected orthogonalization may not be done. if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if all eigenvectors are requested, the routine may either return th products q*x and/or q*y, where q is an input unitary the solution matrix x must be computed by pctrtrs or some other means before entering this routine. pctrrfs does not do iterativ myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace double precision temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. .. .. external subroutines . .. external functions .. routine pddbtrf must be called first ===================================================================== .. .. external subroutines . .. external functions .. double precision temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. .. .. external subroutines . .. external functions .. routine pddttrf must be called first ===================================================================== .. .. external subroutines . .. external functions .. double precision temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. .. .. external subroutines . .. external functions .. routine pdgbtrf must be called first ===================================================================== myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace tool function numroc; nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace this routine requires square block decomposition ( mb_a = nb_a ) arguments if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu as the first element of work and no error message is issued if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding this routine requires n <= nb_a-mod(ja-1, nb_a) and square bloc this routine requires square block decomposition ( mb_a = nb_a ) arguments if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding this routine requires square block data decomposition ( mb_a=nb_a ) arguments myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace and overflow, and returns the square root of each of these values if the log of large is sufficiently large. this subroutine is intende and redefine the underflow and overflow limits to be the square roots this is an auxiliary routine called by pdgebrd notes this routine does a global maximum and must be called by al pdlacp3 is an auxiliary routine that copies from a global paralle the entire submatrix that is copied gets placed on one node or secular equation problem is reduced by one. this stage is performed by the routine pdlaed2 the second stage consists of calculating the updated .. .. external subroutines . .. intrinsic functions .. k-th subdiagonal are zero. the reduction is performed by an orthogo- nal similarity transformation q' * a * q. the routine returns th and also the matrix y = a * v * t. this is an auxiliary routine called by pdsytrd to redistribute d, or a column. the pivot vector should be aligned with the distributed matrix a. this routine will transpose the pivot vector if necessary sub( a ), pass rowcol='c' and pivroc='c'. this routine does a global maximum and must be called by al the routine makes only one pass through the vector sub( x ) notes interchange is initiated for each of rows or columns k1 trough k2 of sub( a ). this routine assumes that the pivoting information ha also note that this routine will only work for k1-k2 being in the this is an auxiliary routine called by pdsytrd notes this is the unblocked form of the algorithm, calling level 2 blas. no communication is performed by this routine, the matrix to operat myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace double precision temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. .. .. external subroutines . .. external functions .. routine pdpbtrf must be called first ===================================================================== .. .. external subroutines . .. external functions .. if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding this routine requires square block decomposition ( mb_a = nb_a ) arguments if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding this routine requires n <= nb_a-mod(ja-1, nb_a) and square bloc this routine requires square block decomposition ( mb_a = nb_a ) arguments this routine requires square block decomposition ( mb_a = nb_a ) arguments double precision temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. .. .. external subroutines . .. external functions .. routine pdpttrf must be called first ===================================================================== .. .. external subroutines . .. external functions .. if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, the lwork is global input and a workspace query is assumed; the routine only calculates the minimu as the first element of work and no error message is issued process. pdstein decides on the allocation of work among the processes and then calls dstein2 (modified lapack routine) on eac expected orthogonalization may not be done. of a real symmetric matrix a by calling the recommended sequence of scalapack routines in its present form, pdsyev assumes a homogeneous system and makes of a real symmetric matrix a by calling the recommended sequence of scalapack routines in its present form, pdsyevd assumes a homogeneous system and makes of a real symmetric matrix a by calling the recommended sequence of scalapack routines. eigenvalues/vectors can be selected b eigenvalues. amount by which the eigenvalues should be scaled to compensate for the scaling performed in this routine returned here to allow for future enhancement. set to twice the underflow threshold 2*pdlamch('s') not zero.
if this routine returns with ((mod(info,2).ne.0) .or
eigenvectors did not converge, try setting abstol to
amount by which the eigenvalues should be scaled to compensate for the scaling performed in this routine returned here to allow for future enhancement. if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding the solution matrix x must be computed by pdtrtrs or some other means before entering this routine. pdtrrfs does not do iterativ myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace the serial version of this routine was originally contributed b pjlaenv is called from the scalapack symmetric and hermitian tailored eigen-routines to choos for a description of the parameters. the serial version of this routine was originally contributed b real temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. .. .. external subroutines . .. external functions .. routine psdbtrf must be called first ===================================================================== .. .. external subroutines . .. external functions .. real temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. .. .. external subroutines . .. external functions .. routine psdttrf must be called first ===================================================================== .. .. external subroutines . .. external functions .. real temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. .. .. external subroutines . .. external functions .. routine psgbtrf must be called first ===================================================================== myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace tool function numroc; nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace this routine requires square block decomposition ( mb_a = nb_a ) arguments if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu as the first element of work and no error message is issued if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding this routine requires n <= nb_a-mod(ja-1, nb_a) and square bloc this routine requires square block decomposition ( mb_a = nb_a ) arguments if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding this routine requires square block data decomposition ( mb_a=nb_a ) arguments myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace and overflow, and returns the square root of each of these values if the log of large is sufficiently large. this subroutine is intende and redefine the underflow and overflow limits to be the square roots this is an auxiliary routine called by psgebrd notes this routine does a global maximum and must be called by al pslacp3 is an auxiliary routine that copies from a global paralle the entire submatrix that is copied gets placed on one node or secular equation problem is reduced by one. this stage is performed by the routine pslaed2 the second stage consists of calculating the updated .. .. external subroutines . .. intrinsic functions .. k-th subdiagonal are zero. the reduction is performed by an orthogo- nal similarity transformation q' * a * q. the routine returns th and also the matrix y = a * v * t. this is an auxiliary routine called by pssytrd to redistribute d, or a column. the pivot vector should be aligned with the distributed matrix a. this routine will transpose the pivot vector if necessary sub( a ), pass rowcol='c' and pivroc='c'. this routine does a global maximum and must be called by al the routine makes only one pass through the vector sub( x ) notes interchange is initiated for each of rows or columns k1 trough k2 of sub( a ). this routine assumes that the pivoting information ha also note that this routine will only work for k1-k2 being in the this is an auxiliary routine called by pssytrd notes this is the unblocked form of the algorithm, calling level 2 blas. no communication is performed by this routine, the matrix to operat myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace real temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. .. .. external subroutines . .. external functions .. routine pspbtrf must be called first ===================================================================== .. .. external subroutines . .. external functions .. if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding this routine requires square block decomposition ( mb_a = nb_a ) arguments if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding this routine requires n <= nb_a-mod(ja-1, nb_a) and square bloc this routine requires square block decomposition ( mb_a = nb_a ) arguments this routine requires square block decomposition ( mb_a = nb_a ) arguments real temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. .. .. external subroutines . .. external functions .. routine pspttrf must be called first ===================================================================== .. .. external subroutines . .. external functions .. if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, the lwork is global input and a workspace query is assumed; the routine only calculates the minimu as the first element of work and no error message is issued process. psstein decides on the allocation of work among the processes and then calls sstein2 (modified lapack routine) on eac expected orthogonalization may not be done. of a real symmetric matrix a by calling the recommended sequence of scalapack routines in its present form, pssyev assumes a homogeneous system and makes of a real symmetric matrix a by calling the recommended sequence of scalapack routines in its present form, pssyevd assumes a homogeneous system and makes of a real symmetric matrix a by calling the recommended sequence of scalapack routines. eigenvalues/vectors can be selected b eigenvalues. amount by which the eigenvalues should be scaled to compensate for the scaling performed in this routine returned here to allow for future enhancement. set to twice the underflow threshold 2*pslamch('s') not zero.
if this routine returns with ((mod(info,2).ne.0) .or
eigenvectors did not converge, try setting abstol to
amount by which the eigenvalues should be scaled to compensate for the scaling performed in this routine returned here to allow for future enhancement. if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding the solution matrix x must be computed by pstrtrs or some other means before entering this routine. pstrrfs does not do iterativ myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace complex*16 temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. .. .. external subroutines . .. external functions .. routine pzdbtrf must be called first ===================================================================== .. .. external subroutines . .. external functions .. complex*16 temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. .. .. external subroutines . .. external functions .. routine pzdttrf must be called first ===================================================================== .. .. external subroutines . .. external functions .. complex*16 temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. .. .. external subroutines . .. external functions .. routine pzgbtrf must be called first ===================================================================== myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace tool function numroc; nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace this routine requires square block decomposition ( mb_a = nb_a ) arguments if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu as the first element of work and no error message is issued if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding this routine requires n <= nb_a-mod(ja-1, nb_a) and square bloc this routine requires square block decomposition ( mb_a = nb_a ) arguments if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding this routine requires square block data decomposition ( mb_a=nb_a ) arguments myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace of a real symmetric matrix a by calling the recommended sequence of scalapack routines in its present form, pzheev assumes a homogeneous system and makes if lwork = -1, then lwork is global input and a workspace query is assumed; the routine calculates the size for al entry of the corresponding work array, and no error message of a complex hermitian matrix a by calling the recommended sequence of scalapack routines. eigenvalues/vectors can be selected b eigenvalues. amount by which the eigenvalues should be scaled to compensate for the scaling performed in this routine returned here to allow for future enhancement. set to twice the underflow threshold 2*pdlamch('s') not zero.
if this routine returns with ((mod(info,2).ne.0) .or
eigenvectors did not converge, try setting abstol to
amount by which the eigenvalues should be scaled to compensate for the scaling performed in this routine returned here to allow for future enhancement. if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace this is an auxiliary routine called by pzgebrd notes this routine does a global maximum and must be called by al pzlacp3 is an auxiliary routine that copies from a global paralle the entire submatrix that is copied gets placed on one node or .. .. external subroutines . .. intrinsic functions .. performed by an unitary similarity transformation q' * a * q. the routine returns the matrices v and t which determine q as a bloc this is an auxiliary routine called by pzhetrd to redistribute d, or a column. the pivot vector should be aligned with the distributed matrix a. this routine will transpose the pivot vector if necessary sub( a ), pass rowcol='c' and pivroc='c'. this routine does a global maximum and must be called by al the routine makes only one pass through the vector sub( x ) notes interchange is initiated for each of rows or columns k1 trough k2 of sub( a ). this routine assumes that the pivoting information ha also note that this routine will only work for k1-k2 being in the this is an auxiliary routine called by pzhetrd notes .. .. external subroutines . .. intrinsic functions .. this is the unblocked form of the algorithm, calling level 2 blas. no communication is performed by this routine, the matrix to operat complex*16 temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. .. .. external subroutines . .. external functions .. routine pzpbtrf must be called first ===================================================================== .. .. external subroutines . .. external functions .. if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding this routine requires square block decomposition ( mb_a = nb_a ) arguments if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding this routine requires n <= nb_a-mod(ja-1, nb_a) and square bloc this routine requires square block decomposition ( mb_a = nb_a ) arguments this routine requires square block decomposition ( mb_a = nb_a ) arguments complex*16 temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. .. .. external subroutines . .. external functions .. routine pzpttrf must be called first ===================================================================== .. .. external subroutines . .. external functions .. process. pzstein decides on the allocation of work among the processes and then calls dstein2 (modified lapack routine) on eac expected orthogonalization may not be done. if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if all eigenvectors are requested, the routine may either return th products q*x and/or q*y, where q is an input unitary the solution matrix x must be computed by pztrtrs or some other means before entering this routine. pztrrfs does not do iterativ myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). argument a(ia:*,ja:ja+k-1). a(ia:*,ja:ja+k-1) is modified by the routine but restored on exit if side = 'r', lld_a >= max( 1, locr(ia+n-1) ). k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o k rows of its distributed matrix argument a(ia:ia+k-1,ja:*). a(ia:ia+k-1,ja:*) is modified by the routine but restored o myrow, mycol, nprow and npcol can be determined by calling the subroutine blacs_gridinfo if lwork = -1, then lwork is global input and a workspace array elements marked * are not used by the routine; elements marke elements of u, because of fill-in resulting from the row go through, n should be at least 4*nbulge+2. otherwise, nbulge may be reduced by this routine ulp (local input) real since every 2nd subdiagonal is guaranteed to be zero. this routine does no parallel work arguments level 2 blas routine array elements marked * are not used by the routine; elements marke elements of u, because of fill-in resulting from the row go through, n should be at least 4*nbulge+2. otherwise, nbulge may be reduced by this routine ulp (local input) double precision level 2 blas routine |
| routines routines complex temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. complex temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. complex temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. complex temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. complex temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. complex temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. of a real symmetric matrix a by calling the recommended sequence of scalapack routines in its present form, pcheev assumes a homogeneous system and makes of a complex hermitian matrix a by calling the recommended sequence of scalapack routines. eigenvalues/vectors can be selected b eigenvalues. complex temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. complex temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. complex temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. complex temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. double precision temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. double precision temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. double precision temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. double precision temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. double precision temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. double precision temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. double precision temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. double precision temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. double precision temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. double precision temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. of a real symmetric matrix a by calling the recommended sequence of scalapack routines in its present form, pdsyev assumes a homogeneous system and makes of a real symmetric matrix a by calling the recommended sequence of scalapack routines in its present form, pdsyevd assumes a homogeneous system and makes of a real symmetric matrix a by calling the recommended sequence of scalapack routines. eigenvalues/vectors can be selected b eigenvalues. pjlaenv is called from the scalapack symmetric and hermitian tailored eigen-routines to choos for a description of the parameters. real temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. real temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. real temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. real temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. real temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. real temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. real temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. real temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. real temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. real temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. of a real symmetric matrix a by calling the recommended sequence of scalapack routines in its present form, pssyev assumes a homogeneous system and makes of a real symmetric matrix a by calling the recommended sequence of scalapack routines in its present form, pssyevd assumes a homogeneous system and makes of a real symmetric matrix a by calling the recommended sequence of scalapack routines. eigenvalues/vectors can be selected b eigenvalues. complex*16 temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. complex*16 temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. complex*16 temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. complex*16 temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. complex*16 temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. complex*16 temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. of a real symmetric matrix a by calling the recommended sequence of scalapack routines in its present form, pzheev assumes a homogeneous system and makes of a complex hermitian matrix a by calling the recommended sequence of scalapack routines. eigenvalues/vectors can be selected b eigenvalues. complex*16 temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. complex*16 temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. complex*16 temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. complex*16 temporary workspace. this space may be overwritten in between calls to routines. work must b on exit, work( 1 ) contains the minimal lwork. |
| row row cdbtrf computes an lu factorization of a real m-by-n band matrix a without using partial pivoting with row interchanges this is the unblocked version of the algorithm, calling level 2 blas. i1 and i2 are the indices of the first row and last column of being computed, i1 and i2 are set inside the main loop. on entry, the local matrix to apply the shifts on. h should be aligned so that the starting row is 2 to one or two matrices (if column is specified) on either their rows or columns arguments ddbtrf computes an lu factorization of a real m-by-n band matrix a without using partial pivoting with row interchanges this is the unblocked version of the algorithm, calling level 2 blas. on entry, the local matrix to apply the shifts on. h should be aligned so that the starting row is 2 to one or two matrices (if column is specified) on either their rows or columns arguments n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th note that for mycol > 0 one has lower triangular blocks! lm is the number of rows which is usually nb except fo is nr+bwu where nr is the number of columns on the last processor n (global input) integer the number of rows and columns to be operated on, i.e. th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pcgeequ computes row and column scalings intended to equilibrate a reduce its condition number. r returns the row scale factors and c value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global the lu decomposition with partial pivoting and row interchanges i tation matrix, l is unit lower triangular, and u is upper triangular. singular values are returned in array s in decreasing order and only the first min(m,n) columns of u and rows of vt = v**t ar value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global distributed matrix sub( a ) = a(ia:ia+m-1,ja:ja+n-1) using partial pivoting with row interchanges the factorization has the form sub( a ) = p * l * u, where p is a matrix sub( a ) = (ia:ia+m-1,ja:ja+n-1) using partial pivoting with row interchanges the factorization has the form sub( a ) = p * l * u, where p is a value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the distribute n_a (global) desca( n_ ) the number of columns in the distri- np = the number of rows local to a given process value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pclabrd reduces the first nb rows and columns of a complex genera or lower bidiagonal form by an unitary transformation q' * a * p, and value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global more. the receiving node can be specified precisely, or all nodes can receive, or just one row or column of nodes notes value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global i1 and i2 are the indices of the first row and last column of being computed, i1 and i2 are set inside the main loop. n (global input) integer the number of rows and columns to be operated on, i.e. th n >= 0. pclamr1d redistributes a one-dimensional row vector from one dat where norm1 denotes the one norm of a matrix (maximum column sum), normi denotes the infinity norm of a matrix (maximum row sum) an squares). note that max(abs(a(i,j))) is not a matrix norm. if the matrix is hermitian, we address only a triangular portion of the matrix. a sum of row (column) i of the complete matri triangular matrix, stopping/starting at the diagonal, which is only one process row if the matrix is symmetric, we address only a triangular portion of the matrix. a sum of row (column) i of the complete matri triangular matrix, stopping/starting at the diagonal, which is find sum of global matrix columns and store on row 0 o or inv( p ) to a general m-by-n distributed matrix sub( a ) = a(ia:ia+m-1,ja:ja+n-1), resulting in row or colum or a column. the pivot vector should be aligned with the distributed or inv( p ) to a m-by-n distributed matrix sub( a ) denoting a(ia:ia+m-1,ja:ja+n-1), resulting in row or column pivoting. th pivoting the rows of sub( a ), ipiv should be distributed along a pclaqge equilibrates a general m-by-n distributed matrix sub( a ) = a(ia:ia+m-1,ja:ja+n-1) using the row and scalin value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global is sub( c ) only distributed over a process row value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global is sub( c ) only distributed over a process row value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global if storev = 'r', the vector which defines the elementary reflector h(i) is stored in the i-th row of the distributed matrix v, an h = i - v' * t * v is sub( c ) only distributed over a process row value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global is sub( c ) only distributed over a process row if storev = 'r', the vector which defines the elementary reflector h(i) is stored in the i-th row of the array v, an h = i - v' * t * v value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pclaswp performs a series of row or column interchanges o interchange is initiated for each of rows or columns k1 trough k2 of value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pclatrd reduces nb rows and columns of a complex hermitia tridiagonal form by an unitary similarity transformation value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pclawil gets the transform given by h44,h33, & h43h34 into v starting at row m notes value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pcpoequ computes row and column scalings intended t sub( a ) = a(ia:ia+n-1,ja:ja+n-1) and reduce its condition number value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th value) may vary. m_a (global) desca[ m_ ] the number of rows in the globa n_a (global) desca[ n_ ] the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pcungl2 generates an m-by-n complex distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined a pcunglq generates an m-by-n complex distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined a value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pcungr2 generates an m-by-n complex distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as th pcungrq generates an m-by-n complex distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th note that for mycol > 0 one has lower triangular blocks! lm is the number of rows which is usually nb except fo is nr+bwu where nr is the number of columns on the last processor n (global input) integer the number of rows and columns to be operated on, i.e. th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pdgeequ computes row and column scalings intended to equilibrate a reduce its condition number. r returns the row scale factors and c value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global the lu decomposition with partial pivoting and row interchanges i tation matrix, l is unit lower triangular, and u is upper triangular. singular values are returned in array s in decreasing order and only the first min(m,n) columns of u and rows of vt = v**t ar value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global distributed matrix sub( a ) = a(ia:ia+m-1,ja:ja+n-1) using partial pivoting with row interchanges the factorization has the form sub( a ) = p * l * u, where p is a matrix sub( a ) = (ia:ia+m-1,ja:ja+n-1) using partial pivoting with row interchanges the factorization has the form sub( a ) = p * l * u, where p is a value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pdlabrd reduces the first nb rows and columns of a real genera or lower bidiagonal form by an orthogonal transformation q' * a * p, value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global more. the receiving node can be specified precisely, or all nodes can receive, or just one row or column of nodes notes value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global iq (global input) integer q's global row index, which points to the beginning of th id (global input) integer q's global row/col index, which points to the beginnin drow (global input) intege distributed. 0 <= drow < nprow. drow (global input) intege distributed. 0 <= drow < nprow. form z1 which consist of the last row of q value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global i1 and i2 are the indices of the first row and last column of being computed, i1 and i2 are set inside the main loop. n (global input) integer the number of rows and columns to be operated on, i.e. th n >= 0. pdlamr1d redistributes a one-dimensional row vector from one dat where norm1 denotes the one norm of a matrix (maximum column sum), normi denotes the infinity norm of a matrix (maximum row sum) an squares). note that max(abs(a(i,j))) is not a matrix norm. only one process row if the matrix is symmetric, we address only a triangular portion of the matrix. a sum of row (column) i of the complete matri triangular matrix, stopping/starting at the diagonal, which is find sum of global matrix columns and store on row 0 o or inv( p ) to a general m-by-n distributed matrix sub( a ) = a(ia:ia+m-1,ja:ja+n-1), resulting in row or colum or a column. the pivot vector should be aligned with the distributed or inv( p ) to a m-by-n distributed matrix sub( a ) denoting a(ia:ia+m-1,ja:ja+n-1), resulting in row or column pivoting. th pivoting the rows of sub( a ), ipiv should be distributed along a pdlaqge equilibrates a general m-by-n distributed matrix sub( a ) = a(ia:ia+m-1,ja:ja+n-1) using the row and scalin value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global it assumes that the input array, bycol, is distributed across rows and that all process columns contain the same copy o and will contain the entire array. it assumes that the input array, byrow, is distributed acros byrow. the output array, byall, will be identical on all processes is sub( c ) only distributed over a process row value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global if storev = 'r', the vector which defines the elementary reflector h(i) is stored in the i-th row of the distributed matrix v, an h = i - v' * t * v is sub( c ) only distributed over a process row value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global if storev = 'r', the vector which defines the elementary reflector h(i) is stored in the i-th row of the array v, an h = i - v' * t * v value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global iq (global input) integer the row index in the global array a indicating the firs value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pdlaswp performs a series of row or column interchanges o interchange is initiated for each of rows or columns k1 trough k2 of value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pdlatrd reduces nb rows and columns of a real symmetric distribute form by an orthogonal similarity transformation q' * sub( a ) * q, value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pdlawil gets the transform given by h44,h33, & h43h34 into v starting at row m notes value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pdorgl2 generates an m-by-n real distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined a pdorglq generates an m-by-n real distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined a value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pdorgr2 generates an m-by-n real distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as th pdorgrq generates an m-by-n real distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pdpoequ computes row and column scalings intended t sub( a ) = a(ia:ia+n-1,ja:ja+n-1) and reduce its condition number value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th value) may vary. m_a (global) desca[ m_ ] the number of rows in the globa n_a (global) desca[ n_ ] the number of columns in the global iblock (global output) integer array, dimension (n) at each row/column j where e(j) is zero or small, th matrix. on exit iblock(i) specifies which block (from 1 iq (global input) integer q's global row index, which points to the beginning of th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the distribute n_a (global) desca( n_ ) the number of columns in the distri- np = the number of rows local to a given process value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th note that for mycol > 0 one has lower triangular blocks! lm is the number of rows which is usually nb except fo is nr+bwu where nr is the number of columns on the last processor n (global input) integer the number of rows and columns to be operated on, i.e. th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global psgeequ computes row and column scalings intended to equilibrate a reduce its condition number. r returns the row scale factors and c value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global the lu decomposition with partial pivoting and row interchanges i tation matrix, l is unit lower triangular, and u is upper triangular. singular values are returned in array s in decreasing order and only the first min(m,n) columns of u and rows of vt = v**t ar value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global distributed matrix sub( a ) = a(ia:ia+m-1,ja:ja+n-1) using partial pivoting with row interchanges the factorization has the form sub( a ) = p * l * u, where p is a matrix sub( a ) = (ia:ia+m-1,ja:ja+n-1) using partial pivoting with row interchanges the factorization has the form sub( a ) = p * l * u, where p is a value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pslabrd reduces the first nb rows and columns of a real genera or lower bidiagonal form by an orthogonal transformation q' * a * p, value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global more. the receiving node can be specified precisely, or all nodes can receive, or just one row or column of nodes notes value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global iq (global input) integer q's global row index, which points to the beginning of th id (global input) integer q's global row/col index, which points to the beginnin drow (global input) intege distributed. 0 <= drow < nprow. drow (global input) intege distributed. 0 <= drow < nprow. form z1 which consist of the last row of q value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global i1 and i2 are the indices of the first row and last column of being computed, i1 and i2 are set inside the main loop. n (global input) integer the number of rows and columns to be operated on, i.e. th n >= 0. pslamr1d redistributes a one-dimensional row vector from one dat where norm1 denotes the one norm of a matrix (maximum column sum), normi denotes the infinity norm of a matrix (maximum row sum) an squares). note that max(abs(a(i,j))) is not a matrix norm. only one process row if the matrix is symmetric, we address only a triangular portion of the matrix. a sum of row (column) i of the complete matri triangular matrix, stopping/starting at the diagonal, which is find sum of global matrix columns and store on row 0 o or inv( p ) to a general m-by-n distributed matrix sub( a ) = a(ia:ia+m-1,ja:ja+n-1), resulting in row or colum or a column. the pivot vector should be aligned with the distributed or inv( p ) to a m-by-n distributed matrix sub( a ) denoting a(ia:ia+m-1,ja:ja+n-1), resulting in row or column pivoting. th pivoting the rows of sub( a ), ipiv should be distributed along a pslaqge equilibrates a general m-by-n distributed matrix sub( a ) = a(ia:ia+m-1,ja:ja+n-1) using the row and scalin value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global it assumes that the input array, bycol, is distributed across rows and that all process columns contain the same copy o and will contain the entire array. it assumes that the input array, byrow, is distributed acros byrow. the output array, byall, will be identical on all processes is sub( c ) only distributed over a process row value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global if storev = 'r', the vector which defines the elementary reflector h(i) is stored in the i-th row of the distributed matrix v, an h = i - v' * t * v is sub( c ) only distributed over a process row value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global if storev = 'r', the vector which defines the elementary reflector h(i) is stored in the i-th row of the array v, an h = i - v' * t * v value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global iq (global input) integer the row index in the global array a indicating the firs value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pslaswp performs a series of row or column interchanges o interchange is initiated for each of rows or columns k1 trough k2 of value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pslatrd reduces nb rows and columns of a real symmetric distribute form by an orthogonal similarity transformation q' * sub( a ) * q, value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pslawil gets the transform given by h44,h33, & h43h34 into v starting at row m notes value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global psorgl2 generates an m-by-n real distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined a psorglq generates an m-by-n real distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined a value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global psorgr2 generates an m-by-n real distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as th psorgrq generates an m-by-n real distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pspoequ computes row and column scalings intended t sub( a ) = a(ia:ia+n-1,ja:ja+n-1) and reduce its condition number value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th value) may vary. m_a (global) desca[ m_ ] the number of rows in the globa n_a (global) desca[ n_ ] the number of columns in the global iblock (global output) integer array, dimension (n) at each row/column j where e(j) is zero or small, th matrix. on exit iblock(i) specifies which block (from 1 iq (global input) integer q's global row index, which points to the beginning of th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the distribute n_a (global) desca( n_ ) the number of columns in the distri- np = the number of rows local to a given process value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th value) may vary. m_a (global) desca[ m_ ] the number of rows in the globa n_a (global) desca[ n_ ] the number of columns in the global n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th note that for mycol > 0 one has lower triangular blocks! lm is the number of rows which is usually nb except fo is nr+bwu where nr is the number of columns on the last processor n (global input) integer the number of rows and columns to be operated on, i.e. th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pzgeequ computes row and column scalings intended to equilibrate a reduce its condition number. r returns the row scale factors and c value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global the lu decomposition with partial pivoting and row interchanges i tation matrix, l is unit lower triangular, and u is upper triangular. singular values are returned in array s in decreasing order and only the first min(m,n) columns of u and rows of vt = v**t ar value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global distributed matrix sub( a ) = a(ia:ia+m-1,ja:ja+n-1) using partial pivoting with row interchanges the factorization has the form sub( a ) = p * l * u, where p is a matrix sub( a ) = (ia:ia+m-1,ja:ja+n-1) using partial pivoting with row interchanges the factorization has the form sub( a ) = p * l * u, where p is a value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the distribute n_a (global) desca( n_ ) the number of columns in the distri- np = the number of rows local to a given process value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pzlabrd reduces the first nb rows and columns of a complex genera or lower bidiagonal form by an unitary transformation q' * a * p, and value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global more. the receiving node can be specified precisely, or all nodes can receive, or just one row or column of nodes notes value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global i1 and i2 are the indices of the first row and last column of being computed, i1 and i2 are set inside the main loop. n (global input) integer the number of rows and columns to be operated on, i.e. th n >= 0. pzlamr1d redistributes a one-dimensional row vector from one dat where norm1 denotes the one norm of a matrix (maximum column sum), normi denotes the infinity norm of a matrix (maximum row sum) an squares). note that max(abs(a(i,j))) is not a matrix norm. if the matrix is hermitian, we address only a triangular portion of the matrix. a sum of row (column) i of the complete matri triangular matrix, stopping/starting at the diagonal, which is only one process row if the matrix is symmetric, we address only a triangular portion of the matrix. a sum of row (column) i of the complete matri triangular matrix, stopping/starting at the diagonal, which is find sum of global matrix columns and store on row 0 o or inv( p ) to a general m-by-n distributed matrix sub( a ) = a(ia:ia+m-1,ja:ja+n-1), resulting in row or colum or a column. the pivot vector should be aligned with the distributed or inv( p ) to a m-by-n distributed matrix sub( a ) denoting a(ia:ia+m-1,ja:ja+n-1), resulting in row or column pivoting. th pivoting the rows of sub( a ), ipiv should be distributed along a pzlaqge equilibrates a general m-by-n distributed matrix sub( a ) = a(ia:ia+m-1,ja:ja+n-1) using the row and scalin value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global is sub( c ) only distributed over a process row value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global is sub( c ) only distributed over a process row value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global if storev = 'r', the vector which defines the elementary reflector h(i) is stored in the i-th row of the distributed matrix v, an h = i - v' * t * v is sub( c ) only distributed over a process row value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global is sub( c ) only distributed over a process row if storev = 'r', the vector which defines the elementary reflector h(i) is stored in the i-th row of the array v, an h = i - v' * t * v value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pzlaswp performs a series of row or column interchanges o interchange is initiated for each of rows or columns k1 trough k2 of value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pzlatrd reduces nb rows and columns of a complex hermitia tridiagonal form by an unitary similarity transformation value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pzlawil gets the transform given by h44,h33, & h43h34 into v starting at row m notes value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pzpoequ computes row and column scalings intended t sub( a ) = a(ia:ia+n-1,ja:ja+n-1) and reduce its condition number value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pzungl2 generates an m-by-n complex distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined a pzunglq generates an m-by-n complex distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined a value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pzungr2 generates an m-by-n complex distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as th pzungrq generates an m-by-n complex distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global sdbtrf computes an lu factorization of a real m-by-n band matrix a without using partial pivoting with row interchanges this is the unblocked version of the algorithm, calling level 2 blas. on entry, the local matrix to apply the shifts on. h should be aligned so that the starting row is 2 to one or two matrices (if column is specified) on either their rows or columns arguments zdbtrf computes an lu factorization of a real m-by-n band matrix a without using partial pivoting with row interchanges this is the unblocked version of the algorithm, calling level 2 blas. i1 and i2 are the indices of the first row and last column of being computed, i1 and i2 are set inside the main loop. on entry, the local matrix to apply the shifts on. h should be aligned so that the starting row is 2 to one or two matrices (if column is specified) on either their rows or columns arguments |
| ROWCND ROWCND ROWCND (global output) rea the smallest r(i) to the largest r(i) (ia <= i <= ia+m-1). ROWCND (global input) rea ia <= i <= ia+m-1. ROWCND (global output) double precisio the smallest r(i) to the largest r(i) (ia <= i <= ia+m-1). ROWCND (global input) double precisio ia <= i <= ia+m-1. ROWCND (global output) rea the smallest r(i) to the largest r(i) (ia <= i <= ia+m-1). ROWCND (global input) rea ia <= i <= ia+m-1. ROWCND (global output) double precisio the smallest r(i) to the largest r(i) (ia <= i <= ia+m-1). ROWCND (global input) double precisio ia <= i <= ia+m-1. |
| ROWCOL ROWCOL for example if the row pivots should be applied to the columns of sub( a ), pass ROWCOL='c' and pivroc='c' notes ROWCOL (global input) characte = 'r' rows will be permuted, ROWCOL (global input) characte = 'r' (rows) for example if the row pivots should be applied to the columns of sub( a ), pass ROWCOL='c' and pivroc='c' notes ROWCOL (global input) characte = 'r' rows will be permuted, ROWCOL (global input) characte = 'r' (rows) for example if the row pivots should be applied to the columns of sub( a ), pass ROWCOL='c' and pivroc='c' notes ROWCOL (global input) characte = 'r' rows will be permuted, ROWCOL (global input) characte = 'r' (rows) for example if the row pivots should be applied to the columns of sub( a ), pass ROWCOL='c' and pivroc='c' notes ROWCOL (global input) characte = 'r' rows will be permuted, ROWCOL (global input) characte = 'r' (rows) |
| ROWMAXS ROWMAXS reset local indices so we can find ROWMAXS reset local indices so we can find ROWMAXS reset local indices so we can find ROWMAXS reset local indices so we can find ROWMAXS reset local indices so we can find ROWMAXS reset local indices so we can find ROWMAXS |
| ROWPIV ROWPIV ipiv must always be a distributed vector (not a matrix). thus: if( ROWPIV .eq. 'c' ) the else ipiv must always be a distributed vector (not a matrix). thus: if( ROWPIV .eq. 'c' ) the else ipiv must always be a distributed vector (not a matrix). thus: if( ROWPIV .eq. 'c' ) the else ipiv must always be a distributed vector (not a matrix). thus: if( ROWPIV .eq. 'c' ) the else |
| rows rows m (input) integer the number of rows of the matrix a. m >= 0 n (input) integer here a11, a21 and a31 denote the current block of jb columns which is about to be factorized. the number of rows in th of columns are jb, j2, j3. the superdiagonal elements of a13 ihi to ilo in steps of 1 or 2. each iteration of the loop works with the active submatrix in rows and columns l to i h(l,l-1) is negligible so that the matrix splits. to one or two matrices (if column is specified) on either their rows or columns arguments m (input) integer the number of rows of the matrix a. m >= 0 n (input) integer here a11, a21 and a31 denote the current block of jb columns which is about to be factorized. the number of rows in th of columns are jb, j2, j3. the superdiagonal elements of a13 to one or two matrices (if column is specified) on either their rows or columns arguments scale submatrix in rows and columns l to len n (global input) integer the number of rows and columns to be operated on, i.e. th copy matrix hu_i (the last bwl rows of gu_i) to afl storag since we have gu_i stored, n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th note that for mycol > 0 one has lower triangular blocks! lm is the number of rows which is usually nb except fo is nr+bwu where nr is the number of columns on the last processor n (global input) integer the number of rows and columns to be operated on, i.e. th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global singular values are returned in array s in decreasing order and only the first min(m,n) columns of u and rows of vt = v**t ar value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the distribute n_a (global) desca( n_ ) the number of columns in the distri- np = the number of rows local to a given process value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pclabrd reduces the first nb rows and columns of a complex genera or lower bidiagonal form by an unitary transformation q' * a * p, and value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global ihi to ilo in steps of our schur block size (<=2*iblk). each iteration of the loop works with the active submatrix in rows converged. either l = ilo or the global a(l,l-1) is negligible n (global input) integer the number of rows and columns to be operated on, i.e. th n >= 0. value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global the point of reflection. the pictures below demonstrate this. in the following code, the row sums created by --- rows below ar to as colsums. infinity-norm = 1-norm = rowsums+colsums. find sum of global matrix rows and store on column 0 o the point of reflection. the pictures below demonstrate this. in the following code, the row sums created by --- rows below ar to as colsums. infinity-norm = 1-norm = rowsums+colsums. find sum of global matrix rows and store on column 0 o value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pivot vector should be aligned with the distributed matrix a. for pivoting the rows of sub( a ), ipiv should be distributed along ipiv should be distributed along a process row and replicated over value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global the distributed matrix sub( a ) = a(ia:ia+m-1,ja:ja+n-1). one interchange is initiated for each of rows or columns k1 trough k2 o already been broadcast along the process row or column. value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pclatrd reduces nb rows and columns of a complex hermitia tridiagonal form by an unitary similarity transformation value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global the scaling factor are stored along process rows in sr and alon greatly the application of the factors. value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th value) may vary. m_a (global) desca[ m_ ] the number of rows in the globa n_a (global) desca[ n_ ] the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pcungl2 generates an m-by-n complex distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined a pcunglq generates an m-by-n complex distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined a value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pcungr2 generates an m-by-n complex distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as th pcungrq generates an m-by-n complex distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global n (global input) integer the number of rows and columns to be operated on, i.e. th copy matrix hu_i (the last bwl rows of gu_i) to afl storag since we have gu_i stored, n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th note that for mycol > 0 one has lower triangular blocks! lm is the number of rows which is usually nb except fo is nr+bwu where nr is the number of columns on the last processor n (global input) integer the number of rows and columns to be operated on, i.e. th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global singular values are returned in array s in decreasing order and only the first min(m,n) columns of u and rows of vt = v**t ar value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pdlabrd reduces the first nb rows and columns of a real genera or lower bidiagonal form by an orthogonal transformation q' * a * p, value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global eigenvalue while working on the submatrix lying in global rows and columns mod(info,n+1) ===================================================================== value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global ihi to ilo in steps of our schur block size (<=2*iblk). each iteration of the loop works with the active submatrix in rows converged. either l = ilo or the global a(l,l-1) is negligible n (global input) integer the number of rows and columns to be operated on, i.e. th n >= 0. value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global find sum of global matrix rows and store on column 0 o the point of reflection. the pictures below demonstrate this. in the following code, the row sums created by --- rows below ar to as colsums. infinity-norm = 1-norm = rowsums+colsums. find sum of global matrix rows and store on column 0 o value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pivot vector should be aligned with the distributed matrix a. for pivoting the rows of sub( a ), ipiv should be distributed along ipiv should be distributed along a process row and replicated over value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global it assumes that the input array, bycol, is distributed across rows and that all process columns contain the same copy o and will contain the entire array. it assumes that the input array, byrow, is distributed across columns and that all process rows contain the same copy o and will contain the entire array. value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global the distributed matrix sub( a ) = a(ia:ia+m-1,ja:ja+n-1). one interchange is initiated for each of rows or columns k1 trough k2 o already been broadcast along the process row or column. value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pdlatrd reduces nb rows and columns of a real symmetric distribute form by an orthogonal similarity transformation q' * sub( a ) * q, value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pdorgl2 generates an m-by-n real distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined a pdorglq generates an m-by-n real distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined a value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pdorgr2 generates an m-by-n real distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as th pdorgrq generates an m-by-n real distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global the scaling factor are stored along process rows in sr and alon greatly the application of the factors. value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th value) may vary. m_a (global) desca[ m_ ] the number of rows in the globa n_a (global) desca[ n_ ] the number of columns in the global the splitting points, at which t breaks up into submatrices. the first submatrix consists of rows/columns 1 to isplit(1) etc., and the nsplit-th consists of rows/columns eigenvalue while working on the submatrix lying in global rows and columns mod(info,n+1) further details value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the distribute n_a (global) desca( n_ ) the number of columns in the distri- np = the number of rows local to a given process value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global n (global input) integer the number of rows and columns to be operated on, i.e. th copy matrix hu_i (the last bwl rows of gu_i) to afl storag since we have gu_i stored, n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th note that for mycol > 0 one has lower triangular blocks! lm is the number of rows which is usually nb except fo is nr+bwu where nr is the number of columns on the last processor n (global input) integer the number of rows and columns to be operated on, i.e. th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global singular values are returned in array s in decreasing order and only the first min(m,n) columns of u and rows of vt = v**t ar value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pslabrd reduces the first nb rows and columns of a real genera or lower bidiagonal form by an orthogonal transformation q' * a * p, value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global eigenvalue while working on the submatrix lying in global rows and columns mod(info,n+1) ===================================================================== value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global ihi to ilo in steps of our schur block size (<=2*iblk). each iteration of the loop works with the active submatrix in rows converged. either l = ilo or the global a(l,l-1) is negligible n (global input) integer the number of rows and columns to be operated on, i.e. th n >= 0. value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global find sum of global matrix rows and store on column 0 o the point of reflection. the pictures below demonstrate this. in the following code, the row sums created by --- rows below ar to as colsums. infinity-norm = 1-norm = rowsums+colsums. find sum of global matrix rows and store on column 0 o value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pivot vector should be aligned with the distributed matrix a. for pivoting the rows of sub( a ), ipiv should be distributed along ipiv should be distributed along a process row and replicated over value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global it assumes that the input array, bycol, is distributed across rows and that all process columns contain the same copy o and will contain the entire array. it assumes that the input array, byrow, is distributed across columns and that all process rows contain the same copy o and will contain the entire array. value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global the distributed matrix sub( a ) = a(ia:ia+m-1,ja:ja+n-1). one interchange is initiated for each of rows or columns k1 trough k2 o already been broadcast along the process row or column. value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pslatrd reduces nb rows and columns of a real symmetric distribute form by an orthogonal similarity transformation q' * sub( a ) * q, value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global psorgl2 generates an m-by-n real distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined a psorglq generates an m-by-n real distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined a value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global psorgr2 generates an m-by-n real distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as th psorgrq generates an m-by-n real distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global the scaling factor are stored along process rows in sr and alon greatly the application of the factors. value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th value) may vary. m_a (global) desca[ m_ ] the number of rows in the globa n_a (global) desca[ n_ ] the number of columns in the global the splitting points, at which t breaks up into submatrices. the first submatrix consists of rows/columns 1 to isplit(1) etc., and the nsplit-th consists of rows/columns eigenvalue while working on the submatrix lying in global rows and columns mod(info,n+1) further details value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the distribute n_a (global) desca( n_ ) the number of columns in the distri- np = the number of rows local to a given process value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global n (global input) integer the number of rows and columns to be operated on, i.e. th copy matrix hu_i (the last bwl rows of gu_i) to afl storag since we have gu_i stored, n (global input) integer the number of rows and columns to be operated on, i.e. th value) may vary. m_a (global) desca[ m_ ] the number of rows in the globa n_a (global) desca[ n_ ] the number of columns in the global n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th note that for mycol > 0 one has lower triangular blocks! lm is the number of rows which is usually nb except fo is nr+bwu where nr is the number of columns on the last processor n (global input) integer the number of rows and columns to be operated on, i.e. th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global singular values are returned in array s in decreasing order and only the first min(m,n) columns of u and rows of vt = v**t ar value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the distribute n_a (global) desca( n_ ) the number of columns in the distri- np = the number of rows local to a given process value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pzlabrd reduces the first nb rows and columns of a complex genera or lower bidiagonal form by an unitary transformation q' * a * p, and value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global ihi to ilo in steps of our schur block size (<=2*iblk). each iteration of the loop works with the active submatrix in rows converged. either l = ilo or the global a(l,l-1) is negligible n (global input) integer the number of rows and columns to be operated on, i.e. th n >= 0. value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global the point of reflection. the pictures below demonstrate this. in the following code, the row sums created by --- rows below ar to as colsums. infinity-norm = 1-norm = rowsums+colsums. find sum of global matrix rows and store on column 0 o the point of reflection. the pictures below demonstrate this. in the following code, the row sums created by --- rows below ar to as colsums. infinity-norm = 1-norm = rowsums+colsums. find sum of global matrix rows and store on column 0 o value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pivot vector should be aligned with the distributed matrix a. for pivoting the rows of sub( a ), ipiv should be distributed along ipiv should be distributed along a process row and replicated over value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global the distributed matrix sub( a ) = a(ia:ia+m-1,ja:ja+n-1). one interchange is initiated for each of rows or columns k1 trough k2 o already been broadcast along the process row or column. value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pzlatrd reduces nb rows and columns of a complex hermitia tridiagonal form by an unitary similarity transformation value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global the scaling factor are stored along process rows in sr and alon greatly the application of the factors. value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global n (global input) integer the number of rows and columns to be operated on, i.e. th n (global input) integer the number of rows and columns to be operated on, i.e. th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pzungl2 generates an m-by-n complex distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined a pzunglq generates an m-by-n complex distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined a value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global pzungr2 generates an m-by-n complex distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as th pzungrq generates an m-by-n complex distributed matrix q denoting a(ia:ia+m-1,ja:ja+n-1) with orthonormal rows, which is defined as th value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global value) may vary. m_a (global) desca( m_ ) the number of rows in the globa n_a (global) desca( n_ ) the number of columns in the global m (input) integer the number of rows of the matrix a. m >= 0 n (input) integer here a11, a21 and a31 denote the current block of jb columns which is about to be factorized. the number of rows in th of columns are jb, j2, j3. the superdiagonal elements of a13 to one or two matrices (if column is specified) on either their rows or columns arguments scale submatrix in rows and columns l to len m (input) integer the number of rows of the matrix a. m >= 0 n (input) integer here a11, a21 and a31 denote the current block of jb columns which is about to be factorized. the number of rows in th of columns are jb, j2, j3. the superdiagonal elements of a13 ihi to ilo in steps of 1 or 2. each iteration of the loop works with the active submatrix in rows and columns l to i h(l,l-1) is negligible so that the matrix splits. to one or two matrices (if column is specified) on either their rows or columns arguments |
| ROWSUMS ROWSUMS in the following code, the row sums created by --- rows below are refered to as ROWSUMS, and the column sums shown by | are refere in the following code, the row sums created by --- rows below are refered to as ROWSUMS, and the column sums shown by | are refere in the following code, the row sums created by --- rows below are refered to as ROWSUMS, and the column sums shown by | are refere in the following code, the row sums created by --- rows below are refered to as ROWSUMS, and the column sums shown by | are refere in the following code, the row sums created by --- rows below are refered to as ROWSUMS, and the column sums shown by | are refere in the following code, the row sums created by --- rows below are refered to as ROWSUMS, and the column sums shown by | are refere |
| Rowwise Rowwise = 'c': columnwise = 'r': Rowwise m (global input) integer = 'c': columnwise = 'r': Rowwise n (global input) integer = 'c': columnwise (not supported yet) = 'r': Rowwise m (global input) integer = 'c': columnwise (not supported yet) = 'r': Rowwise n (global input) integer = 'c': columnwise = 'r': Rowwise m (global input) integer = 'c': columnwise = 'r': Rowwise n (global input) integer = 'c': columnwise (not supported yet) = 'r': Rowwise m (global input) integer = 'c': columnwise (not supported yet) = 'r': Rowwise n (global input) integer = 'c': columnwise = 'r': Rowwise m (global input) integer = 'c': columnwise = 'r': Rowwise n (global input) integer = 'c': columnwise (not supported yet) = 'r': Rowwise m (global input) integer = 'c': columnwise (not supported yet) = 'r': Rowwise n (global input) integer = 'c': columnwise = 'r': Rowwise m (global input) integer = 'c': columnwise = 'r': Rowwise n (global input) integer = 'c': columnwise (not supported yet) = 'r': Rowwise m (global input) integer = 'c': columnwise (not supported yet) = 'r': Rowwise n (global input) integer |
| RSRC_ RSRC_ the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of a. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the distribute the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which th csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the te the columns of the array. RSRC_a (global) desca[ rsrc_ ] the process row over which the firs csrc_a (global) desca[ csrc_ ] the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the te the columns of the array. RSRC_a (global) desca[ rsrc_ ] the process row over which the firs csrc_a (global) desca[ csrc_ ] the process column over which the lwork = 6*n + 2*np*nq np = numroc( n, nb, myrow, descq( RSRC_ ), nprow the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of a. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the distribute the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which th csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the te the columns of the array. RSRC_a (global) desca[ rsrc_ ] the process row over which the firs csrc_a (global) desca[ csrc_ ] the process column over which the lwork = 6*n + 2*np*nq np = numroc( n, nb, myrow, descq( RSRC_ ), nprow the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of a. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the distribute the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which th csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the te the columns of the array. RSRC_a (global) desca[ rsrc_ ] the process row over which the firs csrc_a (global) desca[ csrc_ ] the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of a. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the distribute the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which th csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_a (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the |
| RSRC_A RSRC_A the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of a. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the distribute the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which th csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the te the columns of the array. RSRC_A (global) desca[ rsrc_ ] the process row over which the firs csrc_a (global) desca[ csrc_ ] the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the te the columns of the array. RSRC_A (global) desca[ rsrc_ ] the process row over which the firs csrc_a (global) desca[ csrc_ ] the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of a. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the distribute the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which th csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the te the columns of the array. RSRC_A (global) desca[ rsrc_ ] the process row over which the firs csrc_a (global) desca[ csrc_ ] the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of a. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the distribute the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which th csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the te the columns of the array. RSRC_A (global) desca[ rsrc_ ] the process row over which the firs csrc_a (global) desca[ csrc_ ] the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of a. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the distribute the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which th csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the the columns of the array. RSRC_A (global) desca( rsrc_ ) the process row over which the firs csrc_a (global) desca( csrc_ ) the process column over which the |
| RSRC_B RSRC_B iroffb = mod( ib-1, mb_b ), icoffb = mod( jb-1, nb_b ), ibrow = indxg2p( ib, mb_b, myrow, RSRC_B, nprow ) mpb0 = numroc( m+iroffb, mb_b, myrow, ibrow, nprow ), iroffb = mod( ib-1, mb_b ), icoffb = mod( jb-1, nb_b ), ibrow = indxg2p( ib, mb_b, myrow, RSRC_B, nprow ) npb0 = numroc( n+iroffb, mb_b, myrow, ibrow, nprow ), iroffb = mod( ib-1, mb_b ), icoffb = mod( jb-1, nb_b ), ibrow = indxg2p( ib, mb_b, myrow, RSRC_B, nprow ) ppb0 = numroc( p+iroffb, mb_b, myrow, ibrow, nprow ), iroffb = mod( ib-1, mb_b ), icoffb = mod( jb-1, nb_b ), ibrow = indxg2p( ib, mb_b, myrow, RSRC_B, nprow ) mpb0 = numroc( m+iroffb, mb_b, myrow, ibrow, nprow ), iroffb = mod( ib-1, mb_b ), icoffb = mod( jb-1, nb_b ), ibrow = indxg2p( ib, mb_b, myrow, RSRC_B, nprow ) npb0 = numroc( n+iroffb, mb_b, myrow, ibrow, nprow ), iroffb = mod( ib-1, mb_b ), icoffb = mod( jb-1, nb_b ), ibrow = indxg2p( ib, mb_b, myrow, RSRC_B, nprow ) ppb0 = numroc( p+iroffb, mb_b, myrow, ibrow, nprow ), iroffb = mod( ib-1, mb_b ), icoffb = mod( jb-1, nb_b ), ibrow = indxg2p( ib, mb_b, myrow, RSRC_B, nprow ) mpb0 = numroc( m+iroffb, mb_b, myrow, ibrow, nprow ), iroffb = mod( ib-1, mb_b ), icoffb = mod( jb-1, nb_b ), ibrow = indxg2p( ib, mb_b, myrow, RSRC_B, nprow ) npb0 = numroc( n+iroffb, mb_b, myrow, ibrow, nprow ), iroffb = mod( ib-1, mb_b ), icoffb = mod( jb-1, nb_b ), ibrow = indxg2p( ib, mb_b, myrow, RSRC_B, nprow ) ppb0 = numroc( p+iroffb, mb_b, myrow, ibrow, nprow ), iroffb = mod( ib-1, mb_b ), icoffb = mod( jb-1, nb_b ), ibrow = indxg2p( ib, mb_b, myrow, RSRC_B, nprow ) mpb0 = numroc( m+iroffb, mb_b, myrow, ibrow, nprow ), iroffb = mod( ib-1, mb_b ), icoffb = mod( jb-1, nb_b ), ibrow = indxg2p( ib, mb_b, myrow, RSRC_B, nprow ) npb0 = numroc( n+iroffb, mb_b, myrow, ibrow, nprow ), iroffb = mod( ib-1, mb_b ), icoffb = mod( jb-1, nb_b ), ibrow = indxg2p( ib, mb_b, myrow, RSRC_B, nprow ) ppb0 = numroc( p+iroffb, mb_b, myrow, ibrow, nprow ), |
| RSRC_C RSRC_C iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( icc-1, mb_c ), icoffc = mod( jcc-1, nb_c ), icrow = indxg2p( icc, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( mi+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( icc-1, mb_c ), icoffc = mod( jcc-1, nb_c ), icrow = indxg2p( icc, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( mi+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( icc-1, mb_c ), icoffc = mod( jcc-1, nb_c ), icrow = indxg2p( icc, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( mi+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( icc-1, mb_c ), icoffc = mod( jcc-1, nb_c ), icrow = indxg2p( icc, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( mi+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( icc-1, mb_c ), icoffc = mod( jcc-1, nb_c ), icrow = indxg2p( icc, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( mi+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( icc-1, mb_c ), icoffc = mod( jcc-1, nb_c ), icrow = indxg2p( icc, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( mi+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( icc-1, mb_c ), icoffc = mod( jcc-1, nb_c ), icrow = indxg2p( icc, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( mi+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( icc-1, mb_c ), icoffc = mod( jcc-1, nb_c ), icrow = indxg2p( icc, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( mi+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( icc-1, mb_c ), icoffc = mod( jcc-1, nb_c ), icrow = indxg2p( icc, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( mi+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( icc-1, mb_c ), icoffc = mod( jcc-1, nb_c ), icrow = indxg2p( icc, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( mi+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( icc-1, mb_c ), icoffc = mod( jcc-1, nb_c ), icrow = indxg2p( icc, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( mi+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( ic-1, mb_c ), icoffc = mod( jc-1, nb_c ), icrow = indxg2p( ic, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( m+iroffc, mb_c, myrow, icrow, nprow ), iroffc = mod( icc-1, mb_c ), icoffc = mod( jcc-1, nb_c ), icrow = indxg2p( icc, mb_c, myrow, RSRC_C, nprow ) mpc0 = numroc( mi+iroffc, mb_c, myrow, icrow, nprow ), |
| RSRC_Q RSRC_Q nq = numroc( n, nb_q, mycol, iqcol, npcol ) iqrow = indxg2p( iq, nb_q, myrow, RSRC_Q, nprow nq = numroc( n, nb_q, mycol, iqcol, npcol ) iqrow = indxg2p( iq, nb_q, myrow, RSRC_Q, nprow |
| RSRC_V RSRC_V iroffv = mod( iv-1, mb_v ), icoffv = mod( jv-1, nb_v ), ivrow = indxg2p( iv, mb_v, myrow, RSRC_V, nprow ) mqv0 = numroc( m+icoffv, nb_v, mycol, ivcol, npcol ), iroffv = mod( iv-1, mb_v ), icoffv = mod( jv-1, nb_v ), ivrow = indxg2p( iv, mb_v, myrow, RSRC_V, nprow ) mqv0 = numroc( m+icoffv, nb_v, mycol, ivcol, npcol ), iroffv = mod( iv-1, mb_v ), icoffv = mod( jv-1, nb_v ), ivrow = indxg2p( iv, mb_v, myrow, RSRC_V, nprow ) mqv0 = numroc( m+icoffv, nb_v, mycol, ivcol, npcol ), iroffv = mod( iv-1, mb_v ), icoffv = mod( jv-1, nb_v ), ivrow = indxg2p( iv, mb_v, myrow, RSRC_V, nprow ) mqv0 = numroc( m+icoffv, nb_v, mycol, ivcol, npcol ), iroffv = mod( iv-1, mb_v ), icoffv = mod( jv-1, nb_v ), ivrow = indxg2p( iv, mb_v, myrow, RSRC_V, nprow ) mqv0 = numroc( m+icoffv, nb_v, mycol, ivcol, npcol ), iroffv = mod( iv-1, mb_v ), icoffv = mod( jv-1, nb_v ), ivrow = indxg2p( iv, mb_v, myrow, RSRC_V, nprow ) mqv0 = numroc( m+icoffv, nb_v, mycol, ivcol, npcol ), iroffv = mod( iv-1, mb_v ), icoffv = mod( jv-1, nb_v ), ivrow = indxg2p( iv, mb_v, myrow, RSRC_V, nprow ) mqv0 = numroc( m+icoffv, nb_v, mycol, ivcol, npcol ), iroffv = mod( iv-1, mb_v ), icoffv = mod( jv-1, nb_v ), ivrow = indxg2p( iv, mb_v, myrow, RSRC_V, nprow ) mqv0 = numroc( m+icoffv, nb_v, mycol, ivcol, npcol ), |
| RSRC_X RSRC_X row or process column owns the vector operand, therefore only the
process of coordinate {RSRC_X, csrc_x} receives the result
if incx = m_x, then sub( x ) is a vector distributed over a process
row or process column owns the vector operand, therefore only the
process of coordinate {RSRC_X, csrc_x} receives the result
if incx = m_x, then sub( x ) is a vector distributed over a process
row or process column owns the vector operand, therefore only the
process of coordinate {RSRC_X, csrc_x} receives the result
if incx = m_x, then sub( x ) is a vector distributed over a process
row or process column owns the vector operand, therefore only the
process of coordinate {RSRC_X, csrc_x} receives the result
if incx = m_x, then sub( x ) is a vector distributed over a process
|
| RT1 RT1 RT1 (output) comple the two eigenvalues. RT1 (output) complex*1 the two eigenvalues. |
| RT2 RT2 rt1 (output) complex RT2 (output) comple rt1 (output) complex*16 RT2 (output) complex*1 |
| Rules Rules Rules if mod(k1(ki)-1,hbl) = hbl-1 then mod(k2(ki)-1,hbl)=hbl-1 Rules if mod(k1(ki)-1,hbl) = hbl-2 then mod(k2(ki)-1,hbl)=hbl-2 Rules if mod(k1(ki)-1,hbl) = hbl-2 then mod(k2(ki)-1,hbl)=hbl-2 Rules if mod(k1(ki)-1,hbl) = hbl-1 then mod(k2(ki)-1,hbl)=hbl-1 |
| run run note : if the eigenvectors obtained are not orthogonal, increase lwork and run the code again notes note : if the eigenvectors obtained are not orthogonal, increase lwork and run the code again notes note : if the eigenvectors obtained are not orthogonal, increase lwork and run the code again notes note : if the eigenvectors obtained are not orthogonal, increase lwork and run the code again notes |
| RWORK RWORK RWORK (local workspace/local output) real array on exit, rwork(1) returns the minimal and optimal lrwork. RWORK (local workspace/local output) real array on exit, rwork(1) returns the minimal and optimal lrwork. RWORK (local workspace/local output) real array on exit, rwork(1) returns the minimal and optimal lrwork. RWORK (workspace) real array, dimension (1+4*sizeb for rwork. RWORK (local workspace/local output) real array on exit, rwork(1) returns the minimal and optimal lrwork. RWORK (local workspace/output) complex array on output rwork(1) returns the RWORK (local workspace/output) real array on output rwork(1) returns the real workspace needed to RWORK (local workspace/output) real array on return, work(1) contains the optimal amount of RWORK (local workspace/output) real array on return, rwork(1) contains the amount of workspace RWORK (local workspace/local output) complex array on exit, rwork( 1 ) returns the optimal lrwork. RWORK (local workspace) real array, dimension (lrwork lrwork (local input) integer dimension of rwork RWORK (local workspace/local output) real array on exit, rwork(1) returns the minimal and optimal lrwork. RWORK (local workspace/local output) real array on exit, rwork(1) returns the minimal and optimal lrwork. RWORK (local workspace/local output) real array on exit, rwork(1) returns the minimal and optimal lrwork. RWORK (local workspace/local output) real array on exit, rwork(1) returns the minimal and optimal lrwork. RWORK (local workspace) real array RWORK (local workspace/local output) real array on exit, rwork(1) returns the minimal and optimal lrwork. RWORK (local workspace/local output) double precision array on exit, rwork(1) returns the minimal and optimal lrwork. RWORK (local workspace/local output) double precision array on exit, rwork(1) returns the minimal and optimal lrwork. RWORK (local workspace/local output) double precision array on exit, rwork(1) returns the minimal and optimal lrwork. RWORK (workspace) real array, dimension (1+4*sizeb for rwork. RWORK (local workspace/local output) double precision array on exit, rwork(1) returns the minimal and optimal lrwork. RWORK (local workspace/output) complex*16 array on output rwork(1) returns the RWORK (local workspace/output) double precision array on output rwork(1) returns the real workspace needed to RWORK (local workspace/output) double precision array on return, work(1) contains the optimal amount of RWORK (local workspace/output) double precision array on return, rwork(1) contains the amount of workspace RWORK (local workspace/local output) complex*16 array on exit, rwork( 1 ) returns the optimal lrwork. RWORK (local workspace) double precision array, dimension (lrwork lrwork (local input) integer dimension of rwork RWORK (local workspace/local output) double precision array on exit, rwork(1) returns the minimal and optimal lrwork. RWORK (local workspace/local output) double precision array on exit, rwork(1) returns the minimal and optimal lrwork. RWORK (local workspace/local output) double precision array on exit, rwork(1) returns the minimal and optimal lrwork. RWORK (local workspace/local output) double precision array on exit, rwork(1) returns the minimal and optimal lrwork. RWORK (local workspace) double precision array RWORK (local workspace/local output) double precision array on exit, rwork(1) returns the minimal and optimal lrwork. |