Back| J- |
| JAA JAA if( (vect = 'q' and nq >= k) or (vect <> 'q' and nq > k) ), iaa=ia; JAA=ja; mi=m; ni=n; icc=ic; jcc=jc iaa=ia+1; jaa=ja; mi=m-1; ni=n; icc=ic+1; jcc=jc; iaa = ia + ilo; JAA = ja+ilo-1 mi = ihi-ilo; ni = n; icc = ic + ilo; jcc = jc; if uplo = 'u', iaa = ia, JAA = ja+1, icc = ic, jcc = jc iaa = ia+1, jaa = ja; if( (vect = 'q' and nq >= k) or (vect <> 'q' and nq > k) ), iaa=ia; JAA=ja; mi=m; ni=n; icc=ic; jcc=jc iaa=ia+1; jaa=ja; mi=m-1; ni=n; icc=ic+1; jcc=jc; iaa = ia + ilo; JAA = ja+ilo-1 mi = ihi-ilo; ni = n; icc = ic + ilo; jcc = jc; if uplo = 'u', iaa = ia, JAA = ja+1, icc = ic, jcc = jc iaa = ia+1, jaa = ja; if( (vect = 'q' and nq >= k) or (vect <> 'q' and nq > k) ), iaa=ia; JAA=ja; mi=m; ni=n; icc=ic; jcc=jc iaa=ia+1; jaa=ja; mi=m-1; ni=n; icc=ic+1; jcc=jc; iaa = ia + ilo; JAA = ja+ilo-1 mi = ihi-ilo; ni = n; icc = ic + ilo; jcc = jc; if uplo = 'u', iaa = ia, JAA = ja+1, icc = ic, jcc = jc iaa = ia+1, jaa = ja; if( (vect = 'q' and nq >= k) or (vect <> 'q' and nq > k) ), iaa=ia; JAA=ja; mi=m; ni=n; icc=ic; jcc=jc iaa=ia+1; jaa=ja; mi=m-1; ni=n; icc=ic+1; jcc=jc; iaa = ia + ilo; JAA = ja+ilo-1 mi = ihi-ilo; ni = n; icc = ic + ilo; jcc = jc; if uplo = 'u', iaa = ia, JAA = ja+1, icc = ic, jcc = jc iaa = ia+1, jaa = ja; |
| JAF JAF JAF (global input) intege first column of sub( af ). equilibrated before it is factored. = 'f': on entry, af(iaf:iaf+n-1,JAF:jaf+n-1) and ipiv con if equed is not 'n', the matrix JAF (global input) intege first column of sub( af ). JAF (global input) intege first column of sub( af ). JAF (global input) intege first column of sub( af ). equilibrated before it is factored. = 'f': on entry, af(iaf:iaf+n-1,JAF:jaf+n-1) and ipiv con if equed is not 'n', the matrix JAF (global input) intege first column of sub( af ). JAF (global input) intege first column of sub( af ). JAF (global input) intege first column of sub( af ). equilibrated before it is factored. = 'f': on entry, af(iaf:iaf+n-1,JAF:jaf+n-1) and ipiv con if equed is not 'n', the matrix JAF (global input) intege first column of sub( af ). JAF (global input) intege first column of sub( af ). JAF (global input) intege first column of sub( af ). equilibrated before it is factored. = 'f': on entry, af(iaf:iaf+n-1,JAF:jaf+n-1) and ipiv con if equed is not 'n', the matrix JAF (global input) intege first column of sub( af ). JAF (global input) intege first column of sub( af ). |
| JAFIRST JAFIRST node (iafirst,JAFIRST) owns a(1,1 node (iafirst,JAFIRST) owns a(1,1 node (iafirst,JAFIRST) owns a(1,1 node (iafirst,JAFIRST) owns a(1,1 |
| jax jax h * sub( x ) = h * ( x(iax,jax) ) = ( alpha ), h' * h = i h * sub( x ) = h * ( x(iax,jax) ) = ( alpha ), h' * h = i h * sub( x ) = h * ( x(iax,jax) ) = ( alpha ), h' * h = i h * sub( x ) = h * ( x(iax,jax) ) = ( alpha ), h' * h = i |
| JBLK JBLK on entry, the matrix of shifts. only the 2x2 diagonal of s is referenced. it is assumed that s has JBLK double shift on exit, the data is rearranged in the best order for on entry, the matrix of shifts. only the 2x2 diagonal of s is referenced. it is assumed that s has JBLK double shift on exit, the data is rearranged in the best order for copy submatrix of size 2*JBLK and prepare to do generalize copy submatrix of size 2*JBLK and prepare to do generalize copy submatrix of size 2*JBLK and prepare to do generalize copy submatrix of size 2*JBLK and prepare to do generalize on entry, the matrix of shifts. only the 2x2 diagonal of s is referenced. it is assumed that s has JBLK double shift on exit, the data is rearranged in the best order for on entry, the matrix of shifts. only the 2x2 diagonal of s is referenced. it is assumed that s has JBLK double shift on exit, the data is rearranged in the best order for |
| JCC JCC if( (vect = 'q' and nq >= k) or (vect <> 'q' and nq > k) ), iaa=ia; jaa=ja; mi=m; ni=n; icc=ic; JCC=jc iaa=ia+1; jaa=ja; mi=m-1; ni=n; icc=ic+1; jcc=jc; if side = 'l', mi = ihi-ilo; ni = n; icc = ic + ilo; JCC = jc nb_a * nb_a if uplo = 'u', iaa = ia, jaa = ja+1, icc = ic, JCC = jc iaa = ia+1, jaa = ja; if( (vect = 'q' and nq >= k) or (vect <> 'q' and nq > k) ), iaa=ia; jaa=ja; mi=m; ni=n; icc=ic; JCC=jc iaa=ia+1; jaa=ja; mi=m-1; ni=n; icc=ic+1; jcc=jc; if side = 'l', mi = ihi-ilo; ni = n; icc = ic + ilo; JCC = jc nb_a * nb_a if uplo = 'u', iaa = ia, jaa = ja+1, icc = ic, JCC = jc iaa = ia+1, jaa = ja; if( (vect = 'q' and nq >= k) or (vect <> 'q' and nq > k) ), iaa=ia; jaa=ja; mi=m; ni=n; icc=ic; JCC=jc iaa=ia+1; jaa=ja; mi=m-1; ni=n; icc=ic+1; jcc=jc; if side = 'l', mi = ihi-ilo; ni = n; icc = ic + ilo; JCC = jc nb_a * nb_a if uplo = 'u', iaa = ia, jaa = ja+1, icc = ic, JCC = jc iaa = ia+1, jaa = ja; if( (vect = 'q' and nq >= k) or (vect <> 'q' and nq > k) ), iaa=ia; jaa=ja; mi=m; ni=n; icc=ic; JCC=jc iaa=ia+1; jaa=ja; mi=m-1; ni=n; icc=ic+1; jcc=jc; if side = 'l', mi = ihi-ilo; ni = n; icc = ic + ilo; JCC = jc nb_a * nb_a if uplo = 'u', iaa = ia, jaa = ja+1, icc = ic, JCC = jc iaa = ia+1, jaa = ja; |
| JHI JHI rows ia:ia+ilo-2 and ia+ihi:ia+n-1 and columns ja:ja+jlo-2 and ja+JHI:ja+n-1. see further details. if n > 0 rows ia:ia+ilo-2 and ia+ihi:ia+n-1 and columns ja:ja+jlo-2 and ja+JHI:ja+n-1. see further details. if n > 0 rows ia:ia+ilo-2 and ia+ihi:ia+n-1 and columns ja:ja+jlo-2 and ja+JHI:ja+n-1. see further details. if n > 0 rows ia:ia+ilo-2 and ia+ihi:ia+n-1 and columns ja:ja+jlo-2 and ja+JHI:ja+n-1. see further details. if n > 0 |
| JLO JLO it is assumed that sub( a ) is already upper triangular in rows ia:ia+ilo-2 and ia+ihi:ia+n-1 and columns ja:ja+JLO- 1 <= ilo <= ihi <= n; otherwise set ilo = 1, ihi = n. it is assumed that sub( a ) is already upper triangular in rows ia:ia+ilo-2 and ia+ihi:ia+n-1 and columns ja:ja+JLO- 1 <= ilo <= ihi <= n; otherwise set ilo = 1, ihi = n. it is assumed that sub( a ) is already upper triangular in rows ia:ia+ilo-2 and ia+ihi:ia+n-1 and columns ja:ja+JLO- 1 <= ilo <= ihi <= n; otherwise set ilo = 1, ihi = n. it is assumed that sub( a ) is already upper triangular in rows ia:ia+ilo-2 and ia+ihi:ia+n-1 and columns ja:ja+JLO- 1 <= ilo <= ihi <= n; otherwise set ilo = 1, ihi = n. |
| JOBU JOBU JOBU (global input) character* = 'v': the first size columns of u (the left singular JOBU (global input) character* = 'v': the first size columns of u (the left singular JOBU (global input) character* = 'v': the first size columns of u (the left singular JOBU (global input) character* = 'v': the first size columns of u (the left singular |
| JOBVT JOBVT JOBVT (global input) character* = 'v': the first size rows of v**t (the right singular JOBVT (global input) character* = 'v': the first size rows of v**t (the right singular JOBVT (global input) character* = 'v': the first size rows of v**t (the right singular JOBVT (global input) character* = 'v': the first size rows of v**t (the right singular |
| JOBZ JOBZ JOBZ (global input) character* = 'n': compute eigenvalues only. JOBZ (input) character* = 'v': compute eigenvalues and eigenvectors. JOBZ (global input) character* = 'n': compute eigenvalues only. JOBZ (global input) character* = 'v': compute eigenvalues and eigenvectors. JOBZ (global input) character* = 'n': compute eigenvalues only. JOBZ (input) character* = 'v': compute eigenvalues and eigenvectors. JOBZ (global input) character* = 'n': compute eigenvalues only. JOBZ (global input) character* = 'v': compute eigenvalues and eigenvectors. JOBZ (global input) character* = 'n': compute eigenvalues only. JOBZ (input) character* = 'v': compute eigenvalues and eigenvectors. JOBZ (global input) character* = 'n': compute eigenvalues only. JOBZ (global input) character* = 'v': compute eigenvalues and eigenvectors. JOBZ (global input) character* = 'n': compute eigenvalues only. JOBZ (input) character* = 'v': compute eigenvalues and eigenvectors. JOBZ (global input) character* = 'n': compute eigenvalues only. JOBZ (global input) character* = 'v': compute eigenvalues and eigenvectors. |
| jpvt jpvt the matrix p is represented in jpvt as follows: i then the jth column of p is the ith canonical unit vector. the matrix p is represented in jpvt as follows: i then the jth column of p is the ith canonical unit vector. the matrix p is represented in jpvt as follows: i then the jth column of p is the ith canonical unit vector. the matrix p is represented in jpvt as follows: i then the jth column of p is the ith canonical unit vector. |
| jth jth accept iterate as jth eigenvector jpvt(j) = i then the jth column of p is the ith canonical unit vector ===================================================================== jpvt(j) = i then the jth column of p is the ith canonical unit vector ===================================================================== jpvt(j) = i then the jth column of p is the ith canonical unit vector ===================================================================== jpvt(j) = i then the jth column of p is the ith canonical unit vector ===================================================================== accept iterate as jth eigenvector |
| July July matrix", report cs41, computer science dept., stanford university, July 21, 1966 arguments matrix", report cs41, computer science dept., stanford university, July 21, 1966 arguments |
| jump jump if error was found in phase 1, processors jump here free blacs space used to hold standard-form grid. if error was found in phase 1, processors jump here free blacs space used to hold standard-form grid. if error was found in phase 1, processors jump here free blacs space used to hold standard-form grid. if error was found in phase 1, processors jump here free blacs space used to hold standard-form grid. |
| jumped jumped [processor npcol - 1 jumped to here to await next stage ****************************** [processor npcol - 1 jumped to here to await next stage ****************************** [processor npcol - 1 jumped to here to await next stage ****************************** [processor npcol - 1 jumped to here to await next stage ****************************** [processor npcol - 1 jumped to here to await next stage ****************************** [processor npcol - 1 jumped to here to await next stage ****************************** [processor npcol - 1 jumped to here to await next stage ****************************** [processor npcol - 1 jumped to here to await next stage ****************************** [processor npcol - 1 jumped to here to await next stage ****************************** [processor npcol - 1 jumped to here to await next stage ****************************** [processor npcol - 1 jumped to here to await next stage ****************************** [processor npcol - 1 jumped to here to await next stage ****************************** [processor npcol - 1 jumped to here to await next stage ****************************** [processor npcol - 1 jumped to here to await next stage ****************************** [processor npcol - 1 jumped to here to await next stage ****************************** [processor npcol - 1 jumped to here to await next stage ****************************** |
| jumps jumps if the processor could not locally factor, it jumps here discard temporary matrix stored beginning in if the processor could not locally factor, it jumps here if this processor did not hold part of the grid it jumps here restore saved input parameters if the processor could not locally factor, it jumps here discard temporary matrix stored beginning in if the processor could not locally factor, it jumps here if the processor could not locally factor, it jumps here discard temporary matrix stored beginning in if the processor could not locally factor, it jumps here if this processor did not hold part of the grid it jumps here restore saved input parameters if the processor could not locally factor, it jumps here discard temporary matrix stored beginning in if the processor could not locally factor, it jumps here if the processor could not locally factor, it jumps here discard temporary matrix stored beginning in if the processor could not locally factor, it jumps here if this processor did not hold part of the grid it jumps here restore saved input parameters if the processor could not locally factor, it jumps here discard temporary matrix stored beginning in if the processor could not locally factor, it jumps here if the processor could not locally factor, it jumps here discard temporary matrix stored beginning in if the processor could not locally factor, it jumps here if this processor did not hold part of the grid it jumps here restore saved input parameters if the processor could not locally factor, it jumps here discard temporary matrix stored beginning in if the processor could not locally factor, it jumps here |
| June June implemented by mark r. fahey, June, 200 ===================================================================== implemented by mark r. fahey, June, 200 ===================================================================== |
| junk junk zero out any junk entries that were copie zero out any junk entries that were copie zero out any junk entries that were copie zero out any junk entries that were copie |
| just just skip the current step: the subdiagonal info is just noise adjust addressing into matrix space to properly get int adjust addressing into matrix space to properly get int more. the receiving node can be specified precisely, or all nodes can receive, or just one row or column of nodes notes efficient parallelism: loop over all the bulges, just sending the data ou loop over all the bulges, just sending the data back. adjust addressing into matrix space to properly get int adjust addressing into matrix space to properly get int been implemented in pclattrs which is called by this routine to solve the triangular systems. pclattrs just calls pctrsv each eigenvector is normalized so that the element of largest adjust addressing into matrix space to properly get int adjust addressing into matrix space to properly get int more. the receiving node can be specified precisely, or all nodes can receive, or just one row or column of nodes notes adjust addressing into matrix space to properly get int adjust addressing into matrix space to properly get int adjust addressing into matrix space to properly get int adjust addressing into matrix space to properly get int more. the receiving node can be specified precisely, or all nodes can receive, or just one row or column of nodes notes adjust addressing into matrix space to properly get int adjust addressing into matrix space to properly get int adjust addressing into matrix space to properly get int adjust addressing into matrix space to properly get int more. the receiving node can be specified precisely, or all nodes can receive, or just one row or column of nodes notes efficient parallelism: loop over all the bulges, just sending the data ou loop over all the bulges, just sending the data back. adjust addressing into matrix space to properly get int adjust addressing into matrix space to properly get int been implemented in pzlattrs which is called by this routine to solve the triangular systems. pzlattrs just calls pztrsv each eigenvector is normalized so that the element of largest skip the current step: the subdiagonal info is just noise |
| JVT JVT JVT (global input) intege first column of sub( vt ). JVT (global input) intege first column of sub( vt ). JVT (global input) intege first column of sub( vt ). JVT (global input) intege first column of sub( vt ). |
| Jx2 Jx2 out (local input/output) double precision array, dimension Jx2 out (local input/output) real array, dimension Jx2 |