Back| G- |
| G_i G_i
calculate the update block for previous proc, e_i = G_i{g_i}^
calculate the update block for previous proc, e_i = G_i{g_i}^
calculate the update block for previous proc, e_i = G_i{g_i}^
calculate the update block for previous proc, e_i = G_i{g_i}^
calculate the update block for previous proc, e_i = G_i{g_i}^
calculate the update block for previous proc, e_i = G_i{g_i}^
calculate the update block for previous proc, e_i = G_i{g_i}^
calculate the update block for previous proc, e_i = G_i{g_i}^
|
| GAP GAP GAP (global output) real array this array contains the gap between eigenvalues whose GAP (global output) real array this array contains the gap between eigenvalues whose GAP (global output) real array, dimension (p eigenvectors could not be orthogonalized. the info/m output GAP (global output) double precision array, dimension (p eigenvectors could not be orthogonalized. the info/m output GAP (global output) double precision array this array contains the gap between eigenvalues whose GAP (global output) double precision array this array contains the gap between eigenvalues whose GAP (global output) real array, dimension (p eigenvectors could not be orthogonalized. the info/m output GAP (global output) real array this array contains the gap between eigenvalues whose GAP (global output) real array this array contains the gap between eigenvalues whose GAP (global output) double precision array this array contains the gap between eigenvalues whose GAP (global output) double precision array this array contains the gap between eigenvalues whose GAP (global output) double precision array, dimension (p eigenvectors could not be orthogonalized. the info/m output |
| garbage garbage clear garbage out of workspace bloc clear garbage out of workspace bloc clear garbage out of workspace bloc clear garbage out of workspace bloc |
| Gather Gather Gather up local sections of reduced syste Gather up local sections of reduced syste Gather the result on process (iarow,iacol) Gather the intermediate results to process (0,0) Gather the result on process (iarow,iacol) Gather the intermediate results to process (0,0) Gather up local sections of reduced syste Gather up local sections of reduced syste Gather up local sections of reduced syste Gather up local sections of reduced syste Gather the intermediate results to process (0,0) Gather the result on process (iarow,iacol) Gather the intermediate results to process (0,0) Gather up local sections of reduced syste Gather up local sections of reduced syste Gather up local sections of reduced syste Gather up local sections of reduced syste Gather the intermediate results to process (0,0) Gather the result on process (iarow,iacol) Gather the intermediate results to process (0,0) Gather up local sections of reduced syste Gather up local sections of reduced syste Gather up local sections of reduced syste Gather up local sections of reduced syste Gather the result on process (iarow,iacol) Gather the intermediate results to process (0,0) Gather the result on process (iarow,iacol) Gather the intermediate results to process (0,0) Gather up local sections of reduced syste Gather up local sections of reduced syste |
| Gaussian Gaussian Gaussian elimination without pivotin of the matrix into l u. Gaussian elimination without pivotin of the matrix into l u. Gaussian elimination with pivotin of the matrix into p l u. Gaussian elimination without pivotin of the matrix into l u. Gaussian elimination without pivotin of the matrix into l u. Gaussian elimination with pivotin of the matrix into p l u. Gaussian elimination without pivotin of the matrix into l u. Gaussian elimination without pivotin of the matrix into l u. Gaussian elimination with pivotin of the matrix into p l u. Gaussian elimination without pivotin of the matrix into l u. Gaussian elimination without pivotin of the matrix into l u. Gaussian elimination with pivotin of the matrix into p l u. |
| general general 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. pcgecon estimates the reciprocal of the condition number of a general 1-norm or the infinity-norm, using the lu factorization computed by 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 where nq0 and mp0 refer, respectively, to the values obtained at mycol = 0 and myrow = 0. in general, the upper limit fo processor (0,0): pcgetf2 computes an lu factorization of a general m-by- partial pivoting with row interchanges. pcgetrf computes an lu factorization of a general m-by-n distribute row interchanges. with a general n-by-n distributed matrix sub( a ) using the l sub( a ) denotes a(ia:ia+n-1,ja:ja+n-1), op( a ) = a, a**t or a**h pclabrd reduces the first nb rows and columns of a complex general or lower bidiagonal form by an unitary transformation q' * a * p, and pclahrd reduces the first nb columns of a complex general elements below the k-th subdiagonal are zero. the reduction is pclapiv applies either p (permutation matrix indicated by ipiv) or inv( p ) to a general m-by-n distributed matri pivoting. the pivot vector may be distributed across a process row pclaqge equilibrates a general m-by-n distributed matri factors in the vectors r and c. pcunm2l overwrites the general complex m-by-n distributed matri pcunm2r overwrites the general complex m-by-n distributed matri if vect = 'q', pcunmbr overwrites the general complex distribute pcunmhr overwrites the general complex m-by-n distributed matri pcunml2 overwrites the general complex m-by-n distributed matri pcunmlq overwrites the general complex m-by-n distributed matri pcunmql overwrites the general complex m-by-n distributed matri pcunmqr overwrites the general complex m-by-n distributed matri pcunmr2 overwrites the general complex m-by-n distributed matri pcunmr3 overwrites the general complex m-by-n distributed matri pcunmrq overwrites the general complex m-by-n distributed matri pcunmrz overwrites the general complex m-by-n distributed matri pcunmtr overwrites the general complex m-by-n distributed matri 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 or the infinity-norm, using the lu factorization computed by pdgetrf. 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 where nq0 and mp0 refer, respectively, to the values obtained at mycol = 0 and myrow = 0. in general, the upper limit fo processor (0,0): pdgetf2 computes an lu factorization of a general m-by- partial pivoting with row interchanges. pdgetrf computes an lu factorization of a general m-by-n distribute row interchanges. with a general n-by-n distributed matrix sub( a ) using the l sub( a ) denotes a(ia:ia+n-1,ja:ja+n-1), op( a ) = a or a**t and pdlabrd reduces the first nb rows and columns of a real general or lower bidiagonal form by an orthogonal transformation q' * a * p, if ijob = 2, not referenced. this array will, in general, be reordered on output intvl (input/output) double precision array, dimension (2*mmax) endpoint of the j-th interval. the input intervals will, in general, be reordered on output on output, intvl contains the converged intervals, 1 thru' 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- pdlapiv applies either p (permutation matrix indicated by ipiv) or inv( p ) to a general m-by-n distributed matri pivoting. the pivot vector may be distributed across a process row pdlaqge equilibrates a general m-by-n distributed matri factors in the vectors r and c. 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 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 or the infinity-norm, using the lu factorization computed by psgetrf. 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 where nq0 and mp0 refer, respectively, to the values obtained at mycol = 0 and myrow = 0. in general, the upper limit fo processor (0,0): psgetf2 computes an lu factorization of a general m-by- partial pivoting with row interchanges. psgetrf computes an lu factorization of a general m-by-n distribute row interchanges. with a general n-by-n distributed matrix sub( a ) using the l sub( a ) denotes a(ia:ia+n-1,ja:ja+n-1), op( a ) = a or a**t and pslabrd reduces the first nb rows and columns of a real general or lower bidiagonal form by an orthogonal transformation q' * a * p, if ijob = 2, not referenced. this array will, in general, be reordered on output intvl (input/output) real array, dimension (2*mmax) endpoint of the j-th interval. the input intervals will, in general, be reordered on output on output, intvl contains the converged intervals, 1 thru' 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- pslapiv applies either p (permutation matrix indicated by ipiv) or inv( p ) to a general m-by-n distributed matri pivoting. the pivot vector may be distributed across a process row pslaqge equilibrates a general m-by-n distributed matri factors in the vectors r and c. 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 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. pzgecon estimates the reciprocal of the condition number of a general 1-norm or the infinity-norm, using the lu factorization computed by 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 where nq0 and mp0 refer, respectively, to the values obtained at mycol = 0 and myrow = 0. in general, the upper limit fo processor (0,0): pzgetf2 computes an lu factorization of a general m-by- partial pivoting with row interchanges. pzgetrf computes an lu factorization of a general m-by-n distribute row interchanges. with a general n-by-n distributed matrix sub( a ) using the l sub( a ) denotes a(ia:ia+n-1,ja:ja+n-1), op( a ) = a, a**t or a**h pzlabrd reduces the first nb rows and columns of a complex general or lower bidiagonal form by an unitary transformation q' * a * p, and pzlahrd reduces the first nb columns of a complex general elements below the k-th subdiagonal are zero. the reduction is pzlapiv applies either p (permutation matrix indicated by ipiv) or inv( p ) to a general m-by-n distributed matri pivoting. the pivot vector may be distributed across a process row pzlaqge equilibrates a general m-by-n distributed matri factors in the vectors r and c. pzunm2l overwrites the general complex m-by-n distributed matri pzunm2r overwrites the general complex m-by-n distributed matri if vect = 'q', pzunmbr overwrites the general complex distribute pzunmhr overwrites the general complex m-by-n distributed matri pzunml2 overwrites the general complex m-by-n distributed matri pzunmlq overwrites the general complex m-by-n distributed matri pzunmql overwrites the general complex m-by-n distributed matri pzunmqr overwrites the general complex m-by-n distributed matri pzunmr2 overwrites the general complex m-by-n distributed matri pzunmr3 overwrites the general complex m-by-n distributed matri pzunmrq overwrites the general complex m-by-n distributed matri pzunmrz overwrites the general complex m-by-n distributed matri pzunmtr overwrites the general complex m-by-n distributed matri |
| generalized generalized pcggqrf computes a generalized qr factorization o an n-by-p matrix sub( b ) = b(ib:ib+n-1,jb:jb+p-1): pcggrqf computes a generalized rq factorization o and a p-by-n matrix sub( b ) = b(ib:ib+p-1,jb:jb+n-1): pchegs2 reduces a complex hermitian-definite generalized eigenproble pchegst reduces a complex hermitian-definite generalized eigenproble the eigenvectors of a complex generalized hermitian-definite eigenproblem, of the for sub( b )*sub( a )*x=(lambda)*x. pchengst reduces a complex hermitian-definite generalized copy submatrix of size 2*jblk and prepare to do generalized pdggqrf computes a generalized qr factorization o an n-by-p matrix sub( b ) = b(ib:ib+n-1,jb:jb+p-1): pdggrqf computes a generalized rq factorization o and a p-by-n matrix sub( b ) = b(ib:ib+p-1,jb:jb+n-1): copy submatrix of size 2*jblk and prepare to do generalized 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. pdsyngst reduces a complex hermitian-definite generalized psggqrf computes a generalized qr factorization o an n-by-p matrix sub( b ) = b(ib:ib+n-1,jb:jb+p-1): psggrqf computes a generalized rq factorization o and a p-by-n matrix sub( b ) = b(ib:ib+p-1,jb:jb+n-1): copy submatrix of size 2*jblk and prepare to do generalized 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. pssyngst reduces a complex hermitian-definite generalized pzggqrf computes a generalized qr factorization o an n-by-p matrix sub( b ) = b(ib:ib+n-1,jb:jb+p-1): pzggrqf computes a generalized rq factorization o and a p-by-n matrix sub( b ) = b(ib:ib+p-1,jb:jb+n-1): pzhegs2 reduces a complex hermitian-definite generalized eigenproble pzhegst reduces a complex hermitian-definite generalized eigenproble the eigenvectors of a complex generalized hermitian-definite eigenproblem, of the for sub( b )*sub( a )*x=(lambda)*x. pzhengst reduces a complex hermitian-definite generalized copy submatrix of size 2*jblk and prepare to do generalized |
| generally generally be as accurate as the absolute and relative tolerances. this is generally caused by arithmeti = 2 : there is a mismatch between the number of be as accurate as the absolute and relative tolerances. this is generally caused by arithmeti = 2 : there is a mismatch between the number of |
| generate generate if jobz='v' work(1) = minimal workspace required to generate all the eigenvectors if jobz='v' work(1) = minimal workspace required to generate all the eigenvectors if jobz='v' work(1) = minimal workspace required to generate all the eigenvectors if jobz='v' work(1) = minimal workspace required to generate all the eigenvectors |
| generated generated "congested." as a remedy, when we first hit a border, a 6x6 *local* matrix is generated on one node (called smalla) an passed back and everything stays a lot simpler. mmax (input) integer the maximum number of intervals that may be generated. i quit with info = mmax+1. "congested." as a remedy, when we first hit a border, a 6x6 *local* matrix is generated on one node (called smalla) an passed back and everything stays a lot simpler. mmax (input) integer the maximum number of intervals that may be generated. i quit with info = mmax+1. "congested." as a remedy, when we first hit a border, a 6x6 *local* matrix is generated on one node (called smalla) an passed back and everything stays a lot simpler. "congested." as a remedy, when we first hit a border, a 6x6 *local* matrix is generated on one node (called smalla) an passed back and everything stays a lot simpler. |
| generates generates pclarfg generates a complex elementary reflector h of order n, suc pcung2l generates an m-by-n complex distributed matrix q denotin the last n columns of a product of k elementary reflectors of order m pcung2r generates an m-by-n complex distributed matrix q denotin the first n columns of a product of k elementary reflectors of order pcungl2 generates an m-by-n complex distributed matrix q denotin the first m rows of a product of k elementary reflectors of order n pcunglq generates an m-by-n complex distributed matrix q denotin the first m rows of a product of k elementary reflectors of order n pcungql generates an m-by-n complex distributed matrix q denotin the last n columns of a product of k elementary reflectors of order m pcungqr generates an m-by-n complex distributed matrix q denotin the first n columns of a product of k elementary reflectors of order pcungr2 generates an m-by-n complex distributed matrix q denotin last m rows of a product of k elementary reflectors of order n pcungrq generates an m-by-n complex distributed matrix q denotin last m rows of a product of k elementary reflectors of order n pdlarfg generates a real elementary reflector h of order n, suc 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 pslarfg generates a real elementary reflector h of order n, suc 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 pzlarfg generates a complex elementary reflector h of order n, suc pzung2l generates an m-by-n complex distributed matrix q denotin the last n columns of a product of k elementary reflectors of order m pzung2r generates an m-by-n complex distributed matrix q denotin the first n columns of a product of k elementary reflectors of order pzungl2 generates an m-by-n complex distributed matrix q denotin the first m rows of a product of k elementary reflectors of order n pzunglq generates an m-by-n complex distributed matrix q denotin the first m rows of a product of k elementary reflectors of order n pzungql generates an m-by-n complex distributed matrix q denotin the last n columns of a product of k elementary reflectors of order m pzungqr generates an m-by-n complex distributed matrix q denotin the first n columns of a product of k elementary reflectors of order pzungr2 generates an m-by-n complex distributed matrix q denotin last m rows of a product of k elementary reflectors of order n pzungrq generates an m-by-n complex distributed matrix q denotin last m rows of a product of k elementary reflectors of order n |
| generator generator initialize seed for random number generator dlarnv initialize seed for random number generator slarnv |
| generic generic let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as in the following comments, the character _ should be read as "of the distributed matrix". let a be a generic term for any 2 let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distribute such a global array has an associated description vector desca. let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as in the following comments, the character _ should be read as "of the distributed matrix". let a be a generic term for any 2 let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distribute such a global array has an associated description vector desca. let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as in the following comments, the character _ should be read as "of the distributed matrix". let a be a generic term for any 2 let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distribute such a global array has an associated description vector desca. let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as in the following comments, the character _ should be read as "of the distributed matrix". let a be a generic term for any 2 let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distribute such a global array has an associated description vector desca. let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as let a be a generic term for any 2d block cyclicly distributed array in the following comments, the character _ should be read as |
| genuine genuine based on pcamax from level 1 pblas. the change is to use the 'genuine' absolute value the serial version was contributed to lapack by nick higham for use based on pdzasum from the level 1 pblas. the change is to use the 'genuine' absolute value the serial version of this routine was originally contributed by based on pscasum from the level 1 pblas. the change is to use the 'genuine' absolute value the serial version of this routine was originally contributed by based on pzamax from level 1 pblas. the change is to use the 'genuine' absolute value the serial version was contributed to lapack by nick higham for use |
| Gershgorin Gershgorin eigenvalues output and the number desired. = 3 : range='i', and the Gershgorin interval initiall probable cause: your machine has sloppy floating eigenvalues output and the number desired. = 3 : range='i', and the Gershgorin interval initiall probable cause: your machine has sloppy floating |
| Get Get Get machine constants Get values out of descriptor for use in code Get values out of descriptor for use in code Get values out of descriptor for use in code Get values out of descriptor for use in code Get values out of descriptor for use in code insufficient space and pcheevx is not able to detect this before beginning computation. to Get all the eigenvector space to hold the eigenvectors in z (m .le. descz(n_)) insufficient space and pchegvx is not able to detect this before beginning computation. to Get all the eigenvector space to hold the eigenvectors in z (m .le. descz(n_)) Get first transform on node who owns m+2,m+ Get grid parameters and local indexes Get grid parameters Get grid parameters and local indexes Get grid parameter Get grid parameters Get grid parameters Get grid parameters Get grid parameters Get grid parameter Get values out of descriptor for use in code Get values out of descriptor for use in code Get values out of descriptor for use in code Get values out of descriptor for use in code Get values out of descriptor for use in code Get values out of descriptor for use in code Get values out of descriptor for use in code Get values out of descriptor for use in code Get values out of descriptor for use in code Get first transform on node who owns m+2,m+ Get grid parameters Get grid parameters and local indexes Get grid parameter Get grid parameters Get grid parameters Get grid parameter Get values out of descriptor for use in code Get values out of descriptor for use in code Get values out of descriptor for use in code Get values out of descriptor for use in code insufficient space and pdsyevx is not able to detect this before beginning computation. to Get all the eigenvector space to hold the eigenvectors in z (m .le. descz(n_)) insufficient space and pdsygvx is not able to detect this before beginning computation. to Get all the eigenvector space to hold the eigenvectors in z (m .le. descz(n_)) Get values out of descriptor for use in code Get values out of descriptor for use in code Get values out of descriptor for use in code Get values out of descriptor for use in code Get values out of descriptor for use in code Get first transform on node who owns m+2,m+ Get grid parameters Get grid parameters and local indexes Get grid parameter Get grid parameters Get grid parameters Get grid parameter Get values out of descriptor for use in code Get values out of descriptor for use in code Get values out of descriptor for use in code Get values out of descriptor for use in code insufficient space and pssyevx is not able to detect this before beginning computation. to Get all the eigenvector space to hold the eigenvectors in z (m .le. descz(n_)) insufficient space and pssygvx is not able to detect this before beginning computation. to Get all the eigenvector space to hold the eigenvectors in z (m .le. descz(n_)) Get values out of descriptor for use in code Get values out of descriptor for use in code Get values out of descriptor for use in code Get values out of descriptor for use in code Get values out of descriptor for use in code insufficient space and pzheevx is not able to detect this before beginning computation. to Get all the eigenvector space to hold the eigenvectors in z (m .le. descz(n_)) insufficient space and pzhegvx is not able to detect this before beginning computation. to Get all the eigenvector space to hold the eigenvectors in z (m .le. descz(n_)) Get first transform on node who owns m+2,m+ Get grid parameters and local indexes Get grid parameters Get grid parameters and local indexes Get grid parameter Get grid parameters Get grid parameters Get grid parameters Get grid parameters Get grid parameter Get values out of descriptor for use in code Get values out of descriptor for use in code Get values out of descriptor for use in code Get values out of descriptor for use in code Get machine constants |
| gets gets at the top of the loop, bindex gets incremented, hence where h = h( maxindex:n, 1:bindex-1 ) and array into a local replicated array or vise versa. notice that the entire submatrix that is copied gets placed on one node o can receive, or just one row or column of nodes. when we hit a border, there are row and column transforms that overlap over several processors and the code gets ver *local* matrix is generated on one node (called smalla) and pclawil gets the transform given by h44,h33, & h43h34 into array into a local replicated array or vise versa. notice that the entire submatrix that is copied gets placed on one node o can receive, or just one row or column of nodes. when we hit a border, there are row and column transforms that overlap over several processors and the code gets ver *local* matrix is generated on one node (called smalla) and pdlawil gets the transform given by h44,h33, & h43h34 into at the top of the loop, bindex gets incremented, hence where h = h( maxindex:n, 1:bindex-1 ) and array into a local replicated array or vise versa. notice that the entire submatrix that is copied gets placed on one node o can receive, or just one row or column of nodes. when we hit a border, there are row and column transforms that overlap over several processors and the code gets ver *local* matrix is generated on one node (called smalla) and pslawil gets the transform given by h44,h33, & h43h34 into at the top of the loop, bindex gets incremented, hence where h = h( maxindex:n, 1:bindex-1 ) and at the top of the loop, bindex gets incremented, hence where h = h( maxindex:n, 1:bindex-1 ) and array into a local replicated array or vise versa. notice that the entire submatrix that is copied gets placed on one node o can receive, or just one row or column of nodes. when we hit a border, there are row and column transforms that overlap over several processors and the code gets ver *local* matrix is generated on one node (called smalla) and pzlawil gets the transform given by h44,h33, & h43h34 into |
| give give the following variables give the number of rows and/or column np: the number of local rows in a( 1:n, 1:n ) the following variables give the number of rows and/or column np: the number of local rows in a( 1:n, 1:n ) this version provides a set of parameters which should give good computers. users are encouraged to modify this subroutine to set the following variables give the number of rows and/or column np: the number of local rows in a( 1:n, 1:n ) the following variables give the number of rows and/or column np: the number of local rows in a( 1:n, 1:n ) |
| given given their data from the vecs array. if .false., apply the single reflector given by v2, v3 their data from the vecs array. if .false., apply the single reflector given by v2, v3 be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork residual sum of squares for the solution in each column is given by the sum of squares of elements n+1 to m in tha contain the minimum norm solution vectors; if trans = 'c' at mycol = 0 and myrow = 0. in general, the upper limit for the workspace is given by a workspace required o a(ia:ia+n-1,ja:ja+n-1) has been equilibrated with scaling factors given by r and c and ipiv are not modified. np = the number of rows local to a given process np = the number of rows local to a given process np = the number of rows local to a given process let truea be the value that a would have at a given point in an unblocked code and seeing the effect of starting a double shift qr iteration given by h44, h33, & h43h34 and see if this would make np = the number of rows local to a given process smlnum (global input) real on entry, a "small number" for the given matrix transformation matrix, z( k ), whose conjugate transpose is used to introduce zeros into the (m - k + 1)th row of sub( a ), is given i pclawil gets the transform given by h44,h33, & h43h34 into be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork if equed = 'y', the matrix a has been equilibrated with scaling factors given by s. a and af will no = 'n': the matrix a will be copied to af and factored. be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork transformation matrix, z( k ), whose conjugate transpose is used to introduce zeros into the (m - k + 1)th row of sub( a ), is given i be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork residual sum of squares for the solution in each column is given by the sum of squares of elements n+1 to m in tha contain the minimum norm solution vectors; if trans = 't' at mycol = 0 and myrow = 0. in general, the upper limit for the workspace is given by a workspace required o a(ia:ia+n-1,ja:ja+n-1) has been equilibrated with scaling factors given by r and c and ipiv are not modified. seeing the effect of starting a double shift qr iteration given by h44, h33, & h43h34 and see if this would make np = the number of rows local to a given process smlnum (global input) double precision on entry, a "small number" for the given matrix transformation matrix, z( k ), which is used to introduce zeros into the (m - k + 1)th row of sub( a ), is given in the for z( k ) = ( i 0 ), pdlawil gets the transform given by h44,h33, & h43h34 into be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork if equed = 'y', the matrix a has been equilibrated with scaling factors given by s. a and af will no = 'n': the matrix a will be copied to af and factored. be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork np = the number of rows local to a given process np = the number of rows local to a given process np = the number of rows local to a given process let truea be the value that a would have at a given point in an unblocked code and transformation matrix, z( k ), which is used to introduce zeros into the (m - k + 1)th row of sub( a ), is given in the for z( k ) = ( i 0 ), be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork residual sum of squares for the solution in each column is given by the sum of squares of elements n+1 to m in tha contain the minimum norm solution vectors; if trans = 't' at mycol = 0 and myrow = 0. in general, the upper limit for the workspace is given by a workspace required o a(ia:ia+n-1,ja:ja+n-1) has been equilibrated with scaling factors given by r and c and ipiv are not modified. seeing the effect of starting a double shift qr iteration given by h44, h33, & h43h34 and see if this would make np = the number of rows local to a given process smlnum (global input) real on entry, a "small number" for the given matrix transformation matrix, z( k ), which is used to introduce zeros into the (m - k + 1)th row of sub( a ), is given in the for z( k ) = ( i 0 ), pslawil gets the transform given by h44,h33, & h43h34 into be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork if equed = 'y', the matrix a has been equilibrated with scaling factors given by s. a and af will no = 'n': the matrix a will be copied to af and factored. be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork np = the number of rows local to a given process np = the number of rows local to a given process np = the number of rows local to a given process let truea be the value that a would have at a given point in an unblocked code and transformation matrix, z( k ), which is used to introduce zeros into the (m - k + 1)th row of sub( a ), is given in the for z( k ) = ( i 0 ), be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork residual sum of squares for the solution in each column is given by the sum of squares of elements n+1 to m in tha contain the minimum norm solution vectors; if trans = 'c' at mycol = 0 and myrow = 0. in general, the upper limit for the workspace is given by a workspace required o a(ia:ia+n-1,ja:ja+n-1) has been equilibrated with scaling factors given by r and c and ipiv are not modified. np = the number of rows local to a given process np = the number of rows local to a given process np = the number of rows local to a given process let truea be the value that a would have at a given point in an unblocked code and seeing the effect of starting a double shift qr iteration given by h44, h33, & h43h34 and see if this would make np = the number of rows local to a given process smlnum (global input) double precision on entry, a "small number" for the given matrix transformation matrix, z( k ), whose conjugate transpose is used to introduce zeros into the (m - k + 1)th row of sub( a ), is given i pzlawil gets the transform given by h44,h33, & h43h34 into be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork if equed = 'y', the matrix a has been equilibrated with scaling factors given by s. a and af will no = 'n': the matrix a will be copied to af and factored. be overwritten in between calls to routines. work must be the size given in lwork be overwritten in between calls to routines. work must be the size given in lwork transformation matrix, z( k ), whose conjugate transpose is used to introduce zeros into the (m - k + 1)th row of sub( a ), is given i their data from the vecs array. if .false., apply the single reflector given by v2, v3 their data from the vecs array. if .false., apply the single reflector given by v2, v3 |
| gives gives in particular, if sub( b ) is square and nonsingular, the gqr factorization of sub( a ) and sub( b ) implicitly gives the q in particular, if sub( b ) is square and nonsingular, the grq factorization of sub( a ) and sub( b ) implicitly gives the r dimension ( lwork ) on output, work(1) gives a lower bound on th orthogonalization (see orfac). in particular, if sub( b ) is square and nonsingular, the gqr factorization of sub( a ) and sub( b ) implicitly gives the q in particular, if sub( b ) is square and nonsingular, the grq factorization of sub( a ) and sub( b ) implicitly gives the r dimension ( lwork ) on output, work(1) gives a lower bound on th orthogonalization (see orfac). in particular, if sub( b ) is square and nonsingular, the gqr factorization of sub( a ) and sub( b ) implicitly gives the q in particular, if sub( b ) is square and nonsingular, the grq factorization of sub( a ) and sub( b ) implicitly gives the r dimension ( lwork ) on output, work(1) gives a lower bound on th orthogonalization (see orfac). in particular, if sub( b ) is square and nonsingular, the gqr factorization of sub( a ) and sub( b ) implicitly gives the q in particular, if sub( b ) is square and nonsingular, the grq factorization of sub( a ) and sub( b ) implicitly gives the r dimension ( lwork ) on output, work(1) gives a lower bound on th orthogonalization (see orfac). |
| GL_i GL_i
calculate the update block for previous proc, e_i = GL_i{gu_i
calculate the update block for previous proc, e_i = GL_i{gu_i
calculate the update block for previous proc, e_i = GL_i{gu_i
calculate the update block for previous proc, e_i = GL_i{gu_i
calculate the update block for previous proc, e_i = GL_i{gu_i
calculate the update block for previous proc, e_i = GL_i{gu_i
calculate the update block for previous proc, e_i = GL_i{gu_i
calculate the update block for previous proc, e_i = GL_i{gu_i
|
| glo glo n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. trans (global input) characte = 'c': solve with conjugate_transpose( a(1:n, ja:ja+n-1) ); n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. trans (global input) characte = 'c': solve with conjugate_transpose( a(1:n, ja:ja+n-1) ); n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. trans (global input) characte = 'c': solve with conjugate_transpose( a(1:n, ja:ja+n-1) ); each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process ===== each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process --------------- -------------- -------------------------------------- dtype_a(global) desca( dtype_) the descriptor type the blacs process grid a is distribu- each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process pclacp3 is an auxiliary routine that copies from a global paralle the entire submatrix that is copied gets placed on one node or each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process pcmax1 computes the global index of the maximum element in absolut in indx and the value is returned in amax, uplo (global input) characte = 'l': lower triangle of a(1:n, ja:ja+n-1) is stored. uplo (global input) characte = 'l': lower triangle of a(1:n, ja:ja+n-1) is stored. each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process uplo (global input) characte = 'l': lower triangle of a(1:n, ja:ja+n-1) is stored. uplo (global input) characte = 'l': lower triangle of a(1:n, ja:ja+n-1) is stored. each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. trans (global input) characte = 't' or 'c': solve with a(1:n, ja:ja+n-1)^t; n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. trans (global input) characte = 't' or 'c': solve with a(1:n, ja:ja+n-1)^t; n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. trans (global input) characte = 't' or 'c': solve with a(1:n, ja:ja+n-1)^t; each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process ===== each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process pdlacp3 is an auxiliary routine that copies from a global paralle the entire submatrix that is copied gets placed on one node or each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process uplo (global input) characte = 'l': lower triangle of a(1:n, ja:ja+n-1) is stored. uplo (global input) characte = 'l': lower triangle of a(1:n, ja:ja+n-1) is stored. each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process --------------- -------------- -------------------------------------- dtype_a(global) desca( dtype_) the descriptor type the blacs process grid a is distribu- each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. trans (global input) characte = 't' or 'c': solve with a(1:n, ja:ja+n-1)^t; n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. trans (global input) characte = 't' or 'c': solve with a(1:n, ja:ja+n-1)^t; n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. trans (global input) characte = 't' or 'c': solve with a(1:n, ja:ja+n-1)^t; each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process ===== each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process pslacp3 is an auxiliary routine that copies from a global paralle the entire submatrix that is copied gets placed on one node or each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process uplo (global input) characte = 'l': lower triangle of a(1:n, ja:ja+n-1) is stored. uplo (global input) characte = 'l': lower triangle of a(1:n, ja:ja+n-1) is stored. each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process --------------- -------------- -------------------------------------- dtype_a(global) desca( dtype_) the descriptor type the blacs process grid a is distribu- each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. trans (global input) characte = 'c': solve with conjugate_transpose( a(1:n, ja:ja+n-1) ); each global data object is described by an associated descriptio the mapping between an object element and its corresponding process n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. trans (global input) characte = 'c': solve with conjugate_transpose( a(1:n, ja:ja+n-1) ); n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. trans (global input) characte = 'c': solve with conjugate_transpose( a(1:n, ja:ja+n-1) ); each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process ===== each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process --------------- -------------- -------------------------------------- dtype_a(global) desca( dtype_) the descriptor type the blacs process grid a is distribu- each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process pzlacp3 is an auxiliary routine that copies from a global paralle the entire submatrix that is copied gets placed on one node or each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process pzmax1 computes the global index of the maximum element in absolut in indx and the value is returned in amax, uplo (global input) characte = 'l': lower triangle of a(1:n, ja:ja+n-1) is stored. uplo (global input) characte = 'l': lower triangle of a(1:n, ja:ja+n-1) is stored. each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process uplo (global input) characte = 'l': lower triangle of a(1:n, ja:ja+n-1) is stored. uplo (global input) characte = 'l': lower triangle of a(1:n, ja:ja+n-1) is stored. each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process |
| global global dimension 2. the first maximum absolute value element and its global index. v1(1) = amax, v1(2) = indx v2 (local input) complex array of dimension 2. type (global input) character* (apply from left) type (global input) character* (apply from left) n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. pack params and positions into arrays for global consistency chec trans (global input) characte = 'c': solve with conjugate_transpose( a(1:n, ja:ja+n-1) ); pack params and positions into arrays for global consistency chec n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. pack params and positions into arrays for global consistency chec trans (global input) characte = 'c': solve with conjugate_transpose( a(1:n, ja:ja+n-1) ); pack params and positions into arrays for global consistency chec n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. pack params and positions into arrays for global consistency chec trans (global input) characte = 'c': solve with conjugate_transpose( a(1:n, ja:ja+n-1) ); each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process ===== each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process --------------- -------------- -------------------------------------- dtype_a(global) desca( dtype_) the descriptor type the blacs process grid a is distribu- uplo (global input) character* symmetric matrix a is stored: each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process pclacp3 is an auxiliary routine that copies from a global paralle the entire submatrix that is copied gets placed on one node or each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process and columns l to i. eigenvalues i+1 to ihi have already converged. either l = ilo or the global a(l,l-1) is negligibl n (global input) intege order of the distributed submatrix sub( a ). n (global input) intege each global data object is described by an associated descriptio the mapping between an object element and its corresponding process loop over rows/columns of global matrix find sum of global matrix columns and store on row 0 o loop over rows/columns of global matrix find sum of global matrix columns and store on row 0 o each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process pcmax1 computes the global index of the maximum element in absolut in indx and the value is returned in amax, uplo (global input) characte = 'l': lower triangle of a(1:n, ja:ja+n-1) is stored. pack params and positions into arrays for global consistency chec uplo (global input) characte = 'l': lower triangle of a(1:n, ja:ja+n-1) is stored. pack params and positions into arrays for global consistency chec each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process uplo (global input) characte = 'l': lower triangle of a(1:n, ja:ja+n-1) is stored. pack params and positions into arrays for global consistency chec uplo (global input) characte = 'l': lower triangle of a(1:n, ja:ja+n-1) is stored. pack params and positions into arrays for global consistency chec each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. pack params and positions into arrays for global consistency chec trans (global input) characte = 't' or 'c': solve with a(1:n, ja:ja+n-1)^t; pack params and positions into arrays for global consistency chec n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. pack params and positions into arrays for global consistency chec trans (global input) characte = 't' or 'c': solve with a(1:n, ja:ja+n-1)^t; pack params and positions into arrays for global consistency chec n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. pack params and positions into arrays for global consistency chec trans (global input) characte = 't' or 'c': solve with a(1:n, ja:ja+n-1)^t; each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process ===== each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process in addition, this routine performs a global minimization and maximi each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process pdlacp3 is an auxiliary routine that copies from a global paralle the entire submatrix that is copied gets placed on one node or each global data object is described by an associated descriptio the mapping between an object element and its corresponding process n (global input) intege n (global input) intege ictxt (global input) intege the operation on the matrix. the context itself is global. ictxt (global input) intege the operation on the matrix. the context itself is global. each global data object is described by an associated descriptio the mapping between an object element and its corresponding process and columns l to i. eigenvalues i+1 to ihi have already converged. either l = ilo or the global a(l,l-1) is negligibl n (global input) intege order of the distributed submatrix sub( a ). ictxt (global input) intege place. n (global input) intege each global data object is described by an associated descriptio the mapping between an object element and its corresponding process find sum of global matrix columns and store on row 0 o loop over rows/columns of global matrix find sum of global matrix columns and store on row 0 o each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process id (global input) character* = 'd': sort d in decreasing order. (not implemented yet) each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process uplo (global input) characte = 'l': lower triangle of a(1:n, ja:ja+n-1) is stored. pack params and positions into arrays for global consistency chec uplo (global input) characte = 'l': lower triangle of a(1:n, ja:ja+n-1) is stored. pack params and positions into arrays for global consistency chec each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. pack params and positions into arrays for global consistency chec n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. pack params and positions into arrays for global consistency chec each global data object is described by an associated descriptio the mapping between an object element and its corresponding process ictxt (global input) intege n (global input) intege each global data object is described by an associated descriptio the mapping between an object element and its corresponding process --------------- -------------- -------------------------------------- dtype_a(global) desca( dtype_) the descriptor type the blacs process grid a is distribu- uplo (global input) character* symmetric matrix a is stored: each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process ispec (global input) intege pjlaenv. each global data object is described by an associated descriptio the mapping between an object element and its corresponding process n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. pack params and positions into arrays for global consistency chec trans (global input) characte = 't' or 'c': solve with a(1:n, ja:ja+n-1)^t; pack params and positions into arrays for global consistency chec n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. pack params and positions into arrays for global consistency chec trans (global input) characte = 't' or 'c': solve with a(1:n, ja:ja+n-1)^t; pack params and positions into arrays for global consistency chec n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. pack params and positions into arrays for global consistency chec trans (global input) characte = 't' or 'c': solve with a(1:n, ja:ja+n-1)^t; each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process ===== each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process in addition, this routine performs a global minimization and maximi each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process pslacp3 is an auxiliary routine that copies from a global paralle the entire submatrix that is copied gets placed on one node or each global data object is described by an associated descriptio the mapping between an object element and its corresponding process n (global input) intege n (global input) intege ictxt (global input) intege the operation on the matrix. the context itself is global. ictxt (global input) intege the operation on the matrix. the context itself is global. each global data object is described by an associated descriptio the mapping between an object element and its corresponding process and columns l to i. eigenvalues i+1 to ihi have already converged. either l = ilo or the global a(l,l-1) is negligibl n (global input) intege order of the distributed submatrix sub( a ). ictxt (global input) intege place. n (global input) intege each global data object is described by an associated descriptio the mapping between an object element and its corresponding process find sum of global matrix columns and store on row 0 o loop over rows/columns of global matrix find sum of global matrix columns and store on row 0 o each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process id (global input) character* = 'd': sort d in decreasing order. (not implemented yet) each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process uplo (global input) characte = 'l': lower triangle of a(1:n, ja:ja+n-1) is stored. pack params and positions into arrays for global consistency chec uplo (global input) characte = 'l': lower triangle of a(1:n, ja:ja+n-1) is stored. pack params and positions into arrays for global consistency chec each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. pack params and positions into arrays for global consistency chec n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. pack params and positions into arrays for global consistency chec each global data object is described by an associated descriptio the mapping between an object element and its corresponding process ictxt (global input) intege n (global input) intege each global data object is described by an associated descriptio the mapping between an object element and its corresponding process --------------- -------------- -------------------------------------- dtype_a(global) desca( dtype_) the descriptor type the blacs process grid a is distribu- uplo (global input) character* symmetric matrix a is stored: each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. pack params and positions into arrays for global consistency chec trans (global input) characte = 'c': solve with conjugate_transpose( a(1:n, ja:ja+n-1) ); pack params and positions into arrays for global consistency chec each global data object is described by an associated descriptio the mapping between an object element and its corresponding process n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. pack params and positions into arrays for global consistency chec trans (global input) characte = 'c': solve with conjugate_transpose( a(1:n, ja:ja+n-1) ); pack params and positions into arrays for global consistency chec n (global input) intege order of the distributed submatrix a(1:n, ja:ja+n-1). n >= 0. pack params and positions into arrays for global consistency chec trans (global input) characte = 'c': solve with conjugate_transpose( a(1:n, ja:ja+n-1) ); each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process ===== each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process --------------- -------------- -------------------------------------- dtype_a(global) desca( dtype_) the descriptor type the blacs process grid a is distribu- uplo (global input) character* symmetric matrix a is stored: each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process pzlacp3 is an auxiliary routine that copies from a global paralle the entire submatrix that is copied gets placed on one node or each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process and columns l to i. eigenvalues i+1 to ihi have already converged. either l = ilo or the global a(l,l-1) is negligibl n (global input) intege order of the distributed submatrix sub( a ). n (global input) intege each global data object is described by an associated descriptio the mapping between an object element and its corresponding process loop over rows/columns of global matrix find sum of global matrix columns and store on row 0 o loop over rows/columns of global matrix find sum of global matrix columns and store on row 0 o each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process pzmax1 computes the global index of the maximum element in absolut in indx and the value is returned in amax, uplo (global input) characte = 'l': lower triangle of a(1:n, ja:ja+n-1) is stored. pack params and positions into arrays for global consistency chec uplo (global input) characte = 'l': lower triangle of a(1:n, ja:ja+n-1) is stored. pack params and positions into arrays for global consistency chec each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process uplo (global input) characte = 'l': lower triangle of a(1:n, ja:ja+n-1) is stored. pack params and positions into arrays for global consistency chec uplo (global input) characte = 'l': lower triangle of a(1:n, ja:ja+n-1) is stored. pack params and positions into arrays for global consistency chec each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process each global data object is described by an associated descriptio the mapping between an object element and its corresponding process type (global input) character* (apply from left) dimension 2. the first maximum absolute value element and its global index. v1(1) = amax, v1(2) = indx v2 (local input) complex*16 array of dimension 2. type (global input) character* (apply from left) |
| Globally Globally 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_ ). 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 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_ ). 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 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_ ). 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 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_ ). 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 |
| globl globl ccombamax1 finds the element having maximum real part absolute value as well as its corresponding globl index arguments zcombamax1 finds the element having maximum real part absolute value as well as its corresponding globl index arguments |
| goes goes decide which processor offdiagonal block(s) goes t necessary to scan the "tridiagonal portion of the matrix." in the lapack algorithm zlahqr, a loop of m goes from i-2 down t h(m,m),h(m+1,m+1),h(m+1,m),h(m,m+1),h(m-1,m-1),h(m,m-1), and decide which processor offdiagonal block(s) goes t decide which processor offdiagonal block(s) goes t necessary to scan the "tridiagonal portion of the matrix." in the lapack algorithm dlahqr, a loop of m goes from i-2 down t h(m,m),h(m+1,m+1),h(m+1,m),h(m,m+1),h(m-1,m-1),h(m,m-1), and decide which processor offdiagonal block(s) goes t decide which processor offdiagonal block(s) goes t necessary to scan the "tridiagonal portion of the matrix." in the lapack algorithm dlahqr, a loop of m goes from i-2 down t h(m,m),h(m+1,m+1),h(m+1,m),h(m,m+1),h(m-1,m-1),h(m,m-1), and decide which processor offdiagonal block(s) goes t decide which processor offdiagonal block(s) goes t necessary to scan the "tridiagonal portion of the matrix." in the lapack algorithm zlahqr, a loop of m goes from i-2 down t h(m,m),h(m+1,m+1),h(m+1,m),h(m,m+1),h(m-1,m-1),h(m,m-1), and decide which processor offdiagonal block(s) goes t |
| going going this is the lookahead loop, going until we hav ibulge is the number of bulges going so fa ibulge is the number of bulges going so fa ibulge is the number of bulges going so fa ibulge is the number of bulges going so fa this is the lookahead loop, going until we hav |
| good good this version provides a set of parameters which should give good computers. users are encouraged to modify this subroutine to set |
| GOTO GOTO GOTO put in by g. henry to fix alpha proble gp = ( ( oldgp+p )-( d( l )-p ) ) / [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop [end of GOTO loop GOTO put in by g. henry to fix alpha proble gp = ( ( oldgp+p )-( d( l )-p ) ) / |
| GQR GQR pcgGQRf computes a generalized qr factorization o an n-by-p matrix sub( b ) = b(ib:ib+n-1,jb:jb+p-1): pdgGQRf computes a generalized qr factorization o an n-by-p matrix sub( b ) = b(ib:ib+n-1,jb:jb+p-1): psgGQRf computes a generalized qr factorization o an n-by-p matrix sub( b ) = b(ib:ib+n-1,jb:jb+p-1): pzgGQRf computes a generalized qr factorization o an n-by-p matrix sub( b ) = b(ib:ib+n-1,jb:jb+p-1): |
| gradual gradual rnd = 1.0 when rounding occurs in addition, 0.0 otherwise emin = minimum exponent before (gradual) underflo emax = largest exponent before overflow rnd = 1.0 when rounding occurs in addition, 0.0 otherwise emin = minimum exponent before (gradual) underflo emax = largest exponent before overflow |
| Gram Gram reorthogonalize by modified Gram-schmidt if eigenvalues ar reorthogonalize by modified Gram-schmidt if eigenvalues ar |
| Greater Greater for optimal performance, Greater workspace is needed, i.e where lwork is as defined above, and for optimal performance, Greater workspace is needed, i.e nhegst_lwopt ) for optimal performance, Greater workspace is needed, i.e ictxt = desca( ctxt_ ) scale the column norms by tscal if the maximum element in cnorm is Greater than bignum/2 entries are d(2),d(4),...,d(2*n-2). to avoid overflow, the matrix must be scaled so that its largest entry is no Greater and for greatest accuracy, it should not be much smaller entries are d(2),d(4),...,d(2*n-2). to avoid overflow, the matrix must be scaled so that its largest entry is no Greater and for greatest accuracy, it should not be much smaller if range='v', the upper bound of the interval to be searched for eigenvalues. eigenvalues Greater than vu will not b range='a' or 'i'. relationship between workspace, orthogonality & performance: Greater performance can be achieved if adequate workspac performance can decrease as the workspace provided relationship between workspace, orthogonality & performance: Greater performance can be achieved if adequate workspac performance can decrease as the workspace provided for optimal performance, Greater workspace is needed, i.e ictxt = desca( ctxt_ ) entries are d(2),d(4),...,d(2*n-2). to avoid overflow, the matrix must be scaled so that its largest entry is no Greater and for greatest accuracy, it should not be much smaller entries are d(2),d(4),...,d(2*n-2). to avoid overflow, the matrix must be scaled so that its largest entry is no Greater and for greatest accuracy, it should not be much smaller if range='v', the upper bound of the interval to be searched for eigenvalues. eigenvalues Greater than vu will not b range='a' or 'i'. relationship between workspace, orthogonality & performance: Greater performance can be achieved if adequate workspac performance can decrease as the workspace provided relationship between workspace, orthogonality & performance: Greater performance can be achieved if adequate workspac performance can decrease as the workspace provided for optimal performance, Greater workspace is needed, i.e ictxt = desca( ctxt_ ) for optimal performance, Greater workspace is needed, i.e where lwork is as defined above, and for optimal performance, Greater workspace is needed, i.e nhegst_lwopt ) for optimal performance, Greater workspace is needed, i.e ictxt = desca( ctxt_ ) scale the column norms by tscal if the maximum element in cnorm is Greater than bignum/2 |
| greatest greatest than overflow**(1/2) * underflow**(1/4) in absolute value, and for greatest accuracy, it should not be much smalle than overflow**(1/2) * underflow**(1/4) in absolute value, and for greatest accuracy, it should not be much smalle entry is no greater than overflow**(1/2) * underflow**(1/4) in absolute value, and for greatest accuracy, it should no than overflow**(1/2) * underflow**(1/4) in absolute value, and for greatest accuracy, it should not be much smalle than overflow**(1/2) * underflow**(1/4) in absolute value, and for greatest accuracy, it should not be much smalle entry is no greater than overflow**(1/2) * underflow**(1/4) in absolute value, and for greatest accuracy, it should no |
| greatly greatly process columns in sc. the duplication of information simplifies greatly the application of the factors notes process columns in sc. the duplication of information simplifies greatly the application of the factors notes process columns in sc. the duplication of information simplifies greatly the application of the factors notes process columns in sc. the duplication of information simplifies greatly the application of the factors notes |
| grid grid note: banded codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: banded codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: tridiagonal codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: tridiagonal codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: banded codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: banded codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer get grid parameters and local indexes get grid parameters get grid parameters and local indexes get grid parameter ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer get grid parameters ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer get grid parameters ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer get grid parameters ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer get grid parameters ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer denoting a( ia:ia+n-1, ja:ja+n-1 ). the result is left on every process of the grid notes ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer get grid parameter ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer note: banded codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: banded codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer note: tridiagonal codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: tridiagonal codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape ctxt_a (global) desca[ ctxt_ ] the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer note: banded codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: banded codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: tridiagonal codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: tridiagonal codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: banded codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: banded codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer get grid parameters get grid parameters and local indexes get grid parameter ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer get grid parameters ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer get grid parameters ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer denoting a( ia:ia+n-1, ja:ja+n-1 ). the result is left on every process of the grid notes ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer get grid parameter ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer note: banded codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: banded codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer note: tridiagonal codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: tridiagonal codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape ctxt_a (global) desca[ ctxt_ ] the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer note: banded codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: banded codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: tridiagonal codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: tridiagonal codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: banded codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: banded codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer get grid parameters get grid parameters and local indexes get grid parameter ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer get grid parameters ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer get grid parameters ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer denoting a( ia:ia+n-1, ja:ja+n-1 ). the result is left on every process of the grid notes ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer get grid parameter ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer note: banded codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: banded codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer note: tridiagonal codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: tridiagonal codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape ctxt_a (global) desca[ ctxt_ ] the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer note: banded codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: banded codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape ctxt_a (global) desca[ ctxt_ ] the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer note: tridiagonal codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: tridiagonal codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: banded codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: banded codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer get grid parameters and local indexes get grid parameters get grid parameters and local indexes get grid parameter ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer get grid parameters ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer get grid parameters ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer get grid parameters ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer get grid parameters ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer denoting a( ia:ia+n-1, ja:ja+n-1 ). the result is left on every process of the grid notes ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer get grid parameter ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer note: banded codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: banded codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer note: tridiagonal codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape note: tridiagonal codes can use either the old two dimensional or new one-dimensional descriptors, though the processor grid i convert descriptor into standard form for easy access to parameters, check that grid is of right shape ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicating the blacs process grid a is distribu bal, but the handle (the integer |
| grids grids summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 summary of allowed descriptors, types, and blacs grids blacs grid 1xp or px1 1xp or px1 1xp px1 |
| group group receive offdiagonal block from processor to right. if this is the first group of processors, the receive come receive offdiagonal block from processor to right. if this is the first group of processors, the receive come 1.) the minimum amount of work it takes to determine a group of rotn transformations (this is o (the data is broadcast now: loops 180-240) receive offdiagonal block from processor to right. if this is the first group of processors, the receive come receive offdiagonal block from processor to right. if this is the first group of processors, the receive come receive offdiagonal block from processor to right. if this is the first group of processors, the receive come receive offdiagonal block from processor to right. if this is the first group of processors, the receive come the permutation used to arrange the columns of the deflated q matrix into three groups: the first group contains non-zer non-zero elements only below n1, and the third is dense. 1.) the minimum amount of work it takes to determine a group of rotn transformations (this is o 2.) the small work it takes so that each of the rows receive offdiagonal block from processor to right. if this is the first group of processors, the receive come receive offdiagonal block from processor to right. if this is the first group of processors, the receive come receive offdiagonal block from processor to right. if this is the first group of processors, the receive come receive offdiagonal block from processor to right. if this is the first group of processors, the receive come the permutation used to arrange the columns of the deflated q matrix into three groups: the first group contains non-zer non-zero elements only below n1, and the third is dense. 1.) the minimum amount of work it takes to determine a group of rotn transformations (this is o 2.) the small work it takes so that each of the rows receive offdiagonal block from processor to right. if this is the first group of processors, the receive come receive offdiagonal block from processor to right. if this is the first group of processors, the receive come receive offdiagonal block from processor to right. if this is the first group of processors, the receive come receive offdiagonal block from processor to right. if this is the first group of processors, the receive come 1.) the minimum amount of work it takes to determine a group of rotn transformations (this is o (the data is broadcast now: loops 180-240) receive offdiagonal block from processor to right. if this is the first group of processors, the receive come receive offdiagonal block from processor to right. if this is the first group of processors, the receive come |
| grouped grouped eigenvalues for which eigenvectors are to be computed. the eigenvalues should be grouped by split-off block and ordere w from psstebz with order='b' is expected here). this numbers are stored in w and iblock.
= 'b': ("by block") the eigenvalues will be grouped b
ordered from smallest to largest within
eigenvalues for which eigenvectors are to be computed. the eigenvalues should be grouped by split-off block and ordere w from pdstebz with order='b' is expected here). this numbers are stored in w and iblock.
= 'b': ("by block") the eigenvalues will be grouped b
ordered from smallest to largest within
eigenvalues for which eigenvectors are to be computed. the eigenvalues should be grouped by split-off block and ordere w from psstebz with order='b' is expected here). this eigenvalues for which eigenvectors are to be computed. the eigenvalues should be grouped by split-off block and ordere w from pdstebz with order='b' is expected here). this |
| groups groups the permutation used to arrange the columns of the deflated q matrix into three groups: the first group contains non-zer non-zero elements only below n1, and the third is dense. the permutation used to arrange the columns of the deflated q matrix into three groups: the first group contains non-zer non-zero elements only below n1, and the third is dense. |
| grow grow for clustersize > n/sqrt(nprow*npcol) execution time will grow as the square of the cluster size, all other factor workspace means less reorthogonalization but faster for clustersize > n/sqrt(nprow*npcol) execution time will grow as the square of the cluster size, all other factor workspace means less reorthogonalization but faster compute the growth in a * x = b for clustersize > n/sqrt(nprow*npcol) execution time will grow as the square of the cluster size, all other factor workspace means less reorthogonalization but faster for clustersize > n/sqrt(nprow*npcol) execution time will grow as the square of the cluster size, all other factor workspace means less reorthogonalization but faster for clustersize > n/sqrt(nprow*npcol) execution time will grow as the square of the cluster size, all other factor workspace means less reorthogonalization but faster for clustersize > n/sqrt(nprow*npcol) execution time will grow as the square of the cluster size, all other factor workspace means less reorthogonalization but faster for clustersize > n/sqrt(nprow*npcol) execution time will grow as the square of the cluster size, all other factor workspace means less reorthogonalization but faster for clustersize > n/sqrt(nprow*npcol) execution time will grow as the square of the cluster size, all other factor workspace means less reorthogonalization but faster compute the growth in a * x = b |
| growth growth compute the growth in a * x = b compute the growth in a * x = b |
| GRQ GRQ pcgGRQf computes a generalized rq factorization o and a p-by-n matrix sub( b ) = b(ib:ib+p-1,jb:jb+n-1): pdgGRQf computes a generalized rq factorization o and a p-by-n matrix sub( b ) = b(ib:ib+p-1,jb:jb+n-1): psgGRQf computes a generalized rq factorization o and a p-by-n matrix sub( b ) = b(ib:ib+p-1,jb:jb+n-1): pzgGRQf computes a generalized rq factorization o and a p-by-n matrix sub( b ) = b(ib:ib+p-1,jb:jb+n-1): |
| GU_i GU_i
calculate the update block for previous proc, e_i = gl_i{GU_i
calculate the update block for previous proc, e_i = gl_i{GU_i
calculate the update block for previous proc, e_i = gl_i{GU_i
calculate the update block for previous proc, e_i = gl_i{GU_i
calculate the update block for previous proc, e_i = gl_i{GU_i
calculate the update block for previous proc, e_i = gl_i{GU_i
calculate the update block for previous proc, e_i = gl_i{GU_i
calculate the update block for previous proc, e_i = gl_i{GU_i
|
| guarantee guarantee the array descriptor for the distributed matrix a. if desca( ctxt_ ) is incorrect, pcheev cannot guarantee the array descriptor for the distributed matrix a. if desca( ctxt_ ) is incorrect, pcheevd cannot guarantee the array descriptor for the distributed matrix a. if desca( ctxt_ ) is incorrect, pcheevx cannot guarantee the array descriptor for the distributed matrix a. if desca( ctxt_ ) is incorrect, pchegvx cannot guarantee the array descriptor for the distributed matrix a. if desca( ctxt_ ) is incorrect, pdsyev cannot guarantee the array descriptor for the distributed matrix a. if desca( ctxt_ ) is incorrect, pdsyevx cannot guarantee the array descriptor for the distributed matrix a. if desca( ctxt_ ) is incorrect, pdsygvx cannot guarantee the array descriptor for the distributed matrix a. if desca( ctxt_ ) is incorrect, pssyev cannot guarantee the array descriptor for the distributed matrix a. if desca( ctxt_ ) is incorrect, pssyevx cannot guarantee the array descriptor for the distributed matrix a. if desca( ctxt_ ) is incorrect, pssygvx cannot guarantee the array descriptor for the distributed matrix a. if desca( ctxt_ ) is incorrect, pzheev cannot guarantee the array descriptor for the distributed matrix a. if desca( ctxt_ ) is incorrect, pzheev cannot guarantee the array descriptor for the distributed matrix a. if desca( ctxt_ ) is incorrect, pzheevx cannot guarantee the array descriptor for the distributed matrix a. if desca( ctxt_ ) is incorrect, pzhegvx cannot guarantee |
| Guaranteed Guaranteed complex are together. this way one can employ 2x2 shifts easily since every 2nd subdiagonal is Guaranteed to be zero number and bignum = largest safe number. use of these scaling factors is not Guaranteed to reduce the condition number o the process grid. in this case, the accuracy of the results from pcheev cannot be Guaranteed alignment requirements 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 norm(inv(a)) computed in the code; if the estimate of norm(inv(a)) is accurate, the error bound is Guaranteed berr (local output) real array, dimension (loc(n_b)) eigenvectors corresponding to eigenvalue clusters of size nvec - ceil(m/p) + 1 are Guaranteed to be orthogonal ( th note : lwork must be no smaller than: number and bignum = largest safe number. use of these scaling factors is not Guaranteed to reduce the condition number o norm(inv(a)) computed in the code; if the estimate of norm(inv(a)) is accurate, the error bound is Guaranteed berr (local output) double precision array, dimension (loc(n_b)) eigenvectors corresponding to eigenvalue clusters of size nvec - ceil(m/p) + 1 are Guaranteed to be orthogonal ( th note : lwork must be no smaller than: the process grid. in this case, the accuracy of the results from pdsyev cannot be Guaranteed alignment requirements 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 number and bignum = largest safe number. use of these scaling factors is not Guaranteed to reduce the condition number o norm(inv(a)) computed in the code; if the estimate of norm(inv(a)) is accurate, the error bound is Guaranteed berr (local output) real array, dimension (loc(n_b)) eigenvectors corresponding to eigenvalue clusters of size nvec - ceil(m/p) + 1 are Guaranteed to be orthogonal ( th note : lwork must be no smaller than: the process grid. in this case, the accuracy of the results from pssyev cannot be Guaranteed alignment requirements 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 number and bignum = largest safe number. use of these scaling factors is not Guaranteed to reduce the condition number o the process grid. in this case, the accuracy of the results from pzheev cannot be Guaranteed alignment requirements 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 norm(inv(a)) computed in the code; if the estimate of norm(inv(a)) is accurate, the error bound is Guaranteed berr (local output) double precision array, dimension (loc(n_b)) eigenvectors corresponding to eigenvalue clusters of size nvec - ceil(m/p) + 1 are Guaranteed to be orthogonal ( th note : lwork must be no smaller than: complex are together. this way one can employ 2x2 shifts easily since every 2nd subdiagonal is Guaranteed to be zero |
| guarantees guarantees on output, work(1) gives a lower bound on the workspace ( lwork ) that guarantees the user desire note that this may overestimate the minimum workspace needed. on output, work(1) gives a lower bound on the workspace ( lwork ) that guarantees the user desire note that this may overestimate the minimum workspace needed. on output, work(1) gives a lower bound on the workspace ( lwork ) that guarantees the user desire note that this may overestimate the minimum workspace needed. on output, work(1) gives a lower bound on the workspace ( lwork ) that guarantees the user desire note that this may overestimate the minimum workspace needed. |
| guard guard this code makes very mild assumptions about floating point arithmetic. it will work on machines with a guard digit i which subtract like the cray x-mp, cray y-mp, cray c-90, or cray-2. this code makes very mild assumptions about floating point arithmetic. it will work on machines with a guard digit i which subtract like the cray x-mp, cray y-mp, cray c-90, or cray-2. this code makes very mild assumptions about floating point arithmetic. it will work on machines with a guard digit i which subtract like the cray x-mp, cray y-mp, cray c-90, or cray-2. this code makes very mild assumptions about floating point arithmetic. it will work on machines with a guard digit i which subtract like the cray x-mp, cray y-mp, cray c-90, or cray-2. |
| gular gular uplo (global input) character specifies whether the upper or lower triangular part of th = 'u': upper triangular 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 matrix sub( a ) = [a(ia:ia+m-1,ja:ja+m-1) a(ia:ia+m-1,ja+n-l:ja+n-1)] to upper triangular form by means of unitary transformations the upper trapezoidal matrix sub( a ) is factored as pctzrzf reduces the m-by-n ( m<=n ) complex upper trapezoidal matrix sub( a ) = a(ia:ia+m-1,ja:ja+n-1) to upper triangular form by mean uplo (global input) character specifies whether the upper or lower triangular part of th = 'u': upper triangular 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 sub( a ) = [ a(ia:ia+m-1,ja:ja+m-1) a(ia:ia+m-1,ja+n-l:ja+n-1) ] to upper triangular form by means of orthogonal transformations the upper trapezoidal matrix sub( a ) is factored as pdtzrzf reduces the m-by-n ( m<=n ) real upper trapezoidal matrix sub( a ) = a(ia:ia+m-1,ja:ja+n-1) to upper triangular form by mean uplo (global input) character specifies whether the upper or lower triangular part of th = 'u': upper triangular 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 sub( a ) = [ a(ia:ia+m-1,ja:ja+m-1) a(ia:ia+m-1,ja+n-l:ja+n-1) ] to upper triangular form by means of orthogonal transformations the upper trapezoidal matrix sub( a ) is factored as pstzrzf reduces the m-by-n ( m<=n ) real upper trapezoidal matrix sub( a ) = a(ia:ia+m-1,ja:ja+n-1) to upper triangular form by mean uplo (global input) character specifies whether the upper or lower triangular part of th = 'u': upper triangular 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 matrix sub( a ) = [a(ia:ia+m-1,ja:ja+m-1) a(ia:ia+m-1,ja+n-l:ja+n-1)] to upper triangular form by means of unitary transformations the upper trapezoidal matrix sub( a ) is factored as pztzrzf reduces the m-by-n ( m<=n ) complex upper trapezoidal matrix sub( a ) = a(ia:ia+m-1,ja:ja+n-1) to upper triangular form by mean |