Back| H- |
| H_i H_i l's off-diagonal block in conjugate transpose form.
{f_i}^c = {H_i}{{b'}_i}^
copy matrix h_i (the last bw cols of g_i) to af storage
l's off-diagonal block in conjugate transpose form.
{f_i}^c = {H_i}{{b'}_i}^
l's off-diagonal block in transpose form.
{f_i}^t = {H_i}{{b'}_i}^
copy matrix h_i (the last bw cols of g_i) to af storage
l's off-diagonal block in transpose form.
{f_i}^t = {H_i}{{b'}_i}^
l's off-diagonal block in transpose form.
{f_i}^t = {H_i}{{b'}_i}^
copy matrix h_i (the last bw cols of g_i) to af storage
l's off-diagonal block in transpose form.
{f_i}^t = {H_i}{{b'}_i}^
l's off-diagonal block in conjugate transpose form.
{f_i}^c = {H_i}{{b'}_i}^
copy matrix h_i (the last bw cols of g_i) to af storage
l's off-diagonal block in conjugate transpose form.
{f_i}^c = {H_i}{{b'}_i}^
|
| H10 H10 h11 = smalla(1,1,ki) H10 = smalla(2,1,ki if ( abs(h10) .le. max(ulp*(abs(h11)+abs(h22)), h11 = smalla(1,1,ki) H10 = smalla(2,1,ki if ( abs(h10) .le. max(ulp*(abs(h11)+abs(h22)), |
| H11 H11 H11 = smalla(1,1,ki h22 = smalla(2,2,ki) H11 = smalla(1,1,ki h22 = smalla(2,2,ki) |
| H22 H22 h10 = smalla(2,1,ki) H22 = smalla(2,2,ki $ smlnum) ) then h10 = smalla(2,1,ki) H22 = smalla(2,2,ki $ smlnum) ) then |
| H33 H33 seeing the effect of starting a double shift qr iteration given by h44, H33, & h43h34 and see if this would make pclawil gets the transform given by h44,H33, & h43h34 into seeing the effect of starting a double shift qr iteration given by h44, H33, & h43h34 and see if this would make pdlawil gets the transform given by h44,H33, & h43h34 into seeing the effect of starting a double shift qr iteration given by h44, H33, & h43h34 and see if this would make pslawil gets the transform given by h44,H33, & h43h34 into seeing the effect of starting a double shift qr iteration given by h44, H33, & h43h34 and see if this would make pzlawil gets the transform given by h44,H33, & h43h34 into |
| H43H34 H43H34 seeing the effect of starting a double shift qr iteration given by h44, h33, & H43H34 and see if this would make pclawil gets the transform given by h44,h33, & H43H34 into seeing the effect of starting a double shift qr iteration given by h44, h33, & H43H34 and see if this would make pdlawil gets the transform given by h44,h33, & H43H34 into seeing the effect of starting a double shift qr iteration given by h44, h33, & H43H34 and see if this would make pslawil gets the transform given by h44,h33, & H43H34 into seeing the effect of starting a double shift qr iteration given by h44, h33, & H43H34 and see if this would make pzlawil gets the transform given by h44,h33, & H43H34 into |
| H44 H44 seeing the effect of starting a double shift qr iteration given by H44, h33, & h43h34 and see if this would make pclawil gets the transform given by H44,h33, & h43h34 into seeing the effect of starting a double shift qr iteration given by H44, h33, & h43h34 and see if this would make pdlawil gets the transform given by H44,h33, & h43h34 into seeing the effect of starting a double shift qr iteration given by H44, h33, & h43h34 and see if this would make pslawil gets the transform given by H44,h33, & h43h34 into seeing the effect of starting a double shift qr iteration given by H44, h33, & h43h34 and see if this would make pzlawil gets the transform given by H44,h33, & h43h34 into |
| had had = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu has been completed, but the factor u is exactly = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu has been completed, but the factor u is exactly = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu ===================================================================== = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu ===================================================================== = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu has been completed, but the factor u is exactly = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu has been completed, but the factor u is exactly = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu ===================================================================== info (local input) integer this is set if the input matrix had an odd number of rea matrix s was not originally in schur form. = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu ===================================================================== = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu <= n: u(ia+i-1,ia+i-1) is exactly zero. the = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu <= n: if info = i, the leading minor of order i of a = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu further details = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu <= n: u(ia+i-1,ia+i-1) is exactly zero. the = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit. < 0: if info = -i, the i-th argument had an illegal value = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu <= n: if info = i, the leading minor of order i of a = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0 : successful exit < 0 : if info = -i, the i-th argument had an illegal valu were not computed: = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then >= 0: the value of the parameter specified by ispec < 0: if pjlaenv = -k, the k-th argument had an illega = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu <= n: u(ia+i-1,ia+i-1) is exactly zero. the = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit. < 0: if info = -i, the i-th argument had an illegal value = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu <= n: if info = i, the leading minor of order i of a = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0 : successful exit < 0 : if info = -i, the i-th argument had an illegal valu were not computed: = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu <= n: u(ia+i-1,ia+i-1) is exactly zero. the = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu <= n: if info = i, the leading minor of order i of a = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu further details = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if the i-th argument is an array and the j-entry had argument is a scalar and had an illegal value, then = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu has been completed, but the factor u is exactly = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu has been completed, but the factor u is exactly = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu ===================================================================== info (local input) integer this is set if the input matrix had an odd number of rea matrix s was not originally in schur form. = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu ===================================================================== = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu has been completed, but the factor u is exactly = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu has been completed, but the factor u is exactly = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu ===================================================================== = 0: successful exit < 0: if info = -i, the i-th argument had an illegal valu ===================================================================== |
| half half of the values computed by pdlamch. this subroutine is needed because pdlamch does not compensate for poor arithmetic in the upper half o following types a column in the q2 matrix is: 1 : non-zero in the upper half only 3 : non-zero in the lower half only; of the values computed by pslamch. this subroutine is needed because pslamch does not compensate for poor arithmetic in the upper half o following types a column in the q2 matrix is: 1 : non-zero in the upper half only 3 : non-zero in the lower half only; |
| hand hand nrhs (input) integer the number of right hand sides, i.e., the number of column nrhs (input) integer the number of right hand sides, i.e., the number of column nrhs (input) integer the number of right hand sides, i.e., the number of column nrhs (input) integer the number of right hand sides, i.e., the number of column nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. receive previously transmitted matrix section, which forms the right-hand-side for the triangular solve that calculate nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. use factorization of odd-even connection block to modify locally stored portion of right hand side(s nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. use factorization of odd-even connection block to modify locally stored portion of right hand side(s nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. where sub( b ) denotes b( ib:ib+m-1, jb:jb+nrhs-1 ) when trans = 'n' and b( ib:ib+n-1, jb:jb+nrhs-1 ) otherwise. several right hand sid when trans = 'n', the solution vectors are stored as the columns of dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. receive previously transmitted matrix section, which forms the right-hand-side for the triangular solve that calculate nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. use factorization of odd-even connection block to modify locally stored portion of right hand side(s dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. receive previously transmitted matrix section, which forms the right-hand-side for the triangular solve that calculate nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. use factorization of odd-even connection block to modify locally stored portion of right hand side(s dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. receive previously transmitted matrix section, which forms the right-hand-side for the triangular solve that calculate nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. use factorization of odd-even connection block to modify locally stored portion of right hand side(s nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. use factorization of odd-even connection block to modify locally stored portion of right hand side(s nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. where sub( b ) denotes b( ib:ib+m-1, jb:jb+nrhs-1 ) when trans = 'n' and b( ib:ib+n-1, jb:jb+nrhs-1 ) otherwise. several right hand sid when trans = 'n', the solution vectors are stored as the columns of dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. receive previously transmitted matrix section, which forms the right-hand-side for the triangular solve that calculate nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. use factorization of odd-even connection block to modify locally stored portion of right hand side(s dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. receive previously transmitted matrix section, which forms the right-hand-side for the triangular solve that calculate nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. use factorization of odd-even connection block to modify locally stored portion of right hand side(s dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. receive previously transmitted matrix section, which forms the right-hand-side for the triangular solve that calculate nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. use factorization of odd-even connection block to modify locally stored portion of right hand side(s nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. use factorization of odd-even connection block to modify locally stored portion of right hand side(s nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. where sub( b ) denotes b( ib:ib+m-1, jb:jb+nrhs-1 ) when trans = 'n' and b( ib:ib+n-1, jb:jb+nrhs-1 ) otherwise. several right hand sid when trans = 'n', the solution vectors are stored as the columns of dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. receive previously transmitted matrix section, which forms the right-hand-side for the triangular solve that calculate nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. use factorization of odd-even connection block to modify locally stored portion of right hand side(s dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. receive previously transmitted matrix section, which forms the right-hand-side for the triangular solve that calculate nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. use factorization of odd-even connection block to modify locally stored portion of right hand side(s dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. receive previously transmitted matrix section, which forms the right-hand-side for the triangular solve that calculate nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. use factorization of odd-even connection block to modify locally stored portion of right hand side(s nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. use factorization of odd-even connection block to modify locally stored portion of right hand side(s nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. where sub( b ) denotes b( ib:ib+m-1, jb:jb+nrhs-1 ) when trans = 'n' and b( ib:ib+n-1, jb:jb+nrhs-1 ) otherwise. several right hand sid when trans = 'n', the solution vectors are stored as the columns of dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. receive previously transmitted matrix section, which forms the right-hand-side for the triangular solve that calculate nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. use factorization of odd-even connection block to modify locally stored portion of right hand side(s dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. receive previously transmitted matrix section, which forms the right-hand-side for the triangular solve that calculate nrhs (global input) integer the number of right hand sides, i.e., the number of column nrhs >= 0. use factorization of odd-even connection block to modify locally stored portion of right hand side(s dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- nrhs (input) integer the number of right hand sides, i.e., the number of column nrhs (input) integer the number of right hand sides, i.e., the number of column nrhs (input) integer the number of right hand sides, i.e., the number of column nrhs (input) integer the number of right hand sides, i.e., the number of column |
| handle handle dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- and b( ib:ib+n-1, jb:jb+nrhs-1 ) otherwise. several right hand side vectors b and solution vectors x can be handled in a single call the n-by-nrhs right hand side matrix sub( b ) and the m-by-nrhs dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a(global) desca( dtype_) the descriptor type. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- handle first block separatel handle first block of columns separatel handle first block separatel dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dt_a = 1. ctxt_a (global) desca[ ctxt_ ] the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- and b( ib:ib+n-1, jb:jb+nrhs-1 ) otherwise. several right hand side vectors b and solution vectors x can be handled in a single call the n-by-nrhs right hand side matrix sub( b ) and the m-by-nrhs dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- ictxt (global input) integer the blacs context handle in which the computation take dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- ictxt (global input) integer the blacs context handle, indicating the global context o ictxt (global input) integer the blacs context handle, indicating the global context o dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- ictxt (global input) integer the blacs context handle in which the computation take dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- handle first block of columns separatel handle first block separatel dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dt_a = 1. ctxt_a (global) desca[ ctxt_ ] the blacs context handle, indicatin ted over. the context itself is glo- ictxt (global input) integer the blacs context handle range (global input) character dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a(global) desca( dtype_) the descriptor type. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- and b( ib:ib+n-1, jb:jb+nrhs-1 ) otherwise. several right hand side vectors b and solution vectors x can be handled in a single call the n-by-nrhs right hand side matrix sub( b ) and the m-by-nrhs dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- ictxt (global input) integer the blacs context handle in which the computation take dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- ictxt (global input) integer the blacs context handle, indicating the global context o ictxt (global input) integer the blacs context handle, indicating the global context o dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- ictxt (global input) integer the blacs context handle in which the computation take dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- handle first block of columns separatel handle first block separatel dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dt_a = 1. ctxt_a (global) desca[ ctxt_ ] the blacs context handle, indicatin ted over. the context itself is glo- ictxt (global input) integer the blacs context handle range (global input) character dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a(global) desca( dtype_) the descriptor type. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dt_a = 1. ctxt_a (global) desca[ ctxt_ ] the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- and b( ib:ib+n-1, jb:jb+nrhs-1 ) otherwise. several right hand side vectors b and solution vectors x can be handled in a single call the n-by-nrhs right hand side matrix sub( b ) and the m-by-nrhs dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a(global) desca( dtype_) the descriptor type. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- handle first block separatel handle first block of columns separatel handle first block separatel dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- dtype_a = 1. ctxt_a (global) desca( ctxt_ ) the blacs context handle, indicatin ted over. the context itself is glo- |
| handled handled and b( ib:ib+n-1, jb:jb+nrhs-1 ) otherwise. several right hand side vectors b and solution vectors x can be handled in a single call the n-by-nrhs right hand side matrix sub( b ) and the m-by-nrhs communication sometimes k1(ki)=hbl-2 & k2(ki)=hbl-1 so both border messages can be handled at once rules: and b( ib:ib+n-1, jb:jb+nrhs-1 ) otherwise. several right hand side vectors b and solution vectors x can be handled in a single call the n-by-nrhs right hand side matrix sub( b ) and the m-by-nrhs and b( ib:ib+n-1, jb:jb+nrhs-1 ) otherwise. several right hand side vectors b and solution vectors x can be handled in a single call the n-by-nrhs right hand side matrix sub( b ) and the m-by-nrhs and b( ib:ib+n-1, jb:jb+nrhs-1 ) otherwise. several right hand side vectors b and solution vectors x can be handled in a single call the n-by-nrhs right hand side matrix sub( b ) and the m-by-nrhs communication sometimes k1(ki)=hbl-2 & k2(ki)=hbl-1 so both border messages can be handled at once rules: |
| happen happen we delay spreading v across to all processor columns (which would naturally happen at the bottom of the loop) in order t the node owning h(m,m) does not. this will occur on a border and can happen in no more than 3 locations per block assumin values: a buffer to send diagonally down and right, a buffer the node owning h(m,m) does not. this will occur on a border and can happen in no more than 3 locations per block assumin values: a buffer to send diagonally down and right, a buffer we delay spreading v across to all processor columns (which would naturally happen at the bottom of the loop) in order t the node owning h(m,m) does not. this will occur on a border and can happen in no more than 3 locations per block assumin values: a buffer to send diagonally down and right, a buffer we delay spreading v across to all processor columns (which would naturally happen at the bottom of the loop) in order t we delay spreading v across to all processor columns (which would naturally happen at the bottom of the loop) in order t the node owning h(m,m) does not. this will occur on a border and can happen in no more than 3 locations per block assumin values: a buffer to send diagonally down and right, a buffer |
| hardwired hardwired since there is no element-by-element vector multiplication in the blas, this loop must be hardwired in without a blas cal since there is no element-by-element vector multiplication in the blas, this loop must be hardwired in without a blas cal since there is no element-by-element vector multiplication in the blas, this loop must be hardwired in without a blas cal since there is no element-by-element vector multiplication in the blas, this loop must be hardwired in without a blas cal |
| has has > 0: if info = +i, u(i,i) is exactly zero. the factorization has been completed, but the factor u is exactl to solve a system of equations. j2 and j3 are computed after ju has been updated factorize the current block of jb columns the factorization has the for where l is a product of unit lower bidiagonal submatrix of order 1 or 2 splits off at the bottom because a subdiagonal element has become negligible 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 > 0: if info = +i, u(i,i) is exactly zero. the factorization has been completed, but the factor u is exactl to solve a system of equations. j2 and j3 are computed after ju has been updated factorize the current block of jb columns the factorization has the for where l is a product of unit lower bidiagonal 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 p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: ***************************************** local computation phas p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: ***************************************** local computation phas p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: ******************************************************************* phase 1: local computation phase p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". or its conjugate-transpose, using a qr or lq factorization of sub( a ). it is assumed that sub( a ) has full rank the following options are provided: let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". the factorization has the form sub( a ) = p * l * u, where p is elements (lower trapezoidal if m > n), and u is upper triangular the factorization has the form sub( a ) = p * l * u, where p is ments (lower trapezoidal if m > n), and u is upper triangular let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let k be the number of rows or columns of a distributed matrix, and assume that its process grid has dimension p x q would receive if k were distributed over the p processes of its let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". submatrix of order 1 or 2 splits off at the bottom because a subdiagonal element has become negligible each h(i) has the for h(i) = i - tau * v * v' pclamr1d has not been tested except withint the contect o let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". interchange is initiated for each of rows or columns k1 trough k2 of sub( a ). this routine assumes that the pivoting information has also note that this routine will only work for k1-k2 being in the let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: ***************************************** local computation phas let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". factors, s(i) = 1/sqrt(a(i,i)), chosen so that the scaled distri- buted matrix b with elements b(i,j) = s(i)*a(i,j)*s(j) has ones o of b within a factor n of the smallest possible condition number let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". the factorization has the for sub( a ) = u' * u , if uplo = 'u', or the factorization has the for sub( a ) = u' * u , if uplo = 'u', or let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: ***************************************** local computation phas let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: ***************************************** local computation phas p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: ***************************************** local computation phas p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: ******************************************************************* phase 1: local computation phase p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". or its transpose, using a qr or lq factorization of sub( a ). it is assumed that sub( a ) has full rank the following options are provided: let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". the factorization has the form sub( a ) = p * l * u, where p is elements (lower trapezoidal if m > n), and u is upper triangular the factorization has the form sub( a ) = p * l * u, where p is ments (lower trapezoidal if m > n), and u is upper triangular let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". if ijob = 1, this is the largest floating point number encountered which has count n(w) = nval(1) ieflag (input) integer on entry, the subdiagonal elements of the tridiagonal matrix. on exit, e has been destroyed q (local output) double precision array, being recombined. on exit, rho has been modified to the value required b being recombined. on exit, rho has been modified to the value required b let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". submatrix of order 1 or 2 splits off at the bottom because a subdiagonal element has become negligible each h(i) has the for h(i) = i - tau * v * v' pdlamr1d has not been tested except withint the contect o let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". pdlapdct counts the number of negative eigenvalues of (t - sigma i). this implementation of the sturm sequence loop has conditionals i floating point number. pdlapdct will be referred to as the "paranoid" let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". interchange is initiated for each of rows or columns k1 trough k2 of sub( a ). this routine assumes that the pivoting information has also note that this routine will only work for k1-k2 being in the let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: ***************************************** local computation phas let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". factors, s(i) = 1/sqrt(a(i,i)), chosen so that the scaled distri- buted matrix b with elements b(i,j) = s(i)*a(i,j)*s(j) has ones o of b within a factor n of the smallest possible condition number let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". the factorization has the for sub( a ) = u' * u , if uplo = 'u', or the factorization has the for sub( a ) = u' * u , if uplo = 'u', or let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: ***************************************** local computation phas let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". the absolute tolerance for the eigenvalues. an eigenvalue (or cluster) is considered to be located if it has bee less. if abstol is less than or equal to zero, then ulp*|t| on entry, the subdiagonal elements of the tridiagonal matrix. on exit, e has been destroyed q (local output) double precision array, let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let k be the number of rows or columns of a distributed matrix, and assume that its process grid has dimension p x q would receive if k were distributed over the p processes of its let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: ***************************************** local computation phas p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: ***************************************** local computation phas p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: ******************************************************************* phase 1: local computation phase p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". or its transpose, using a qr or lq factorization of sub( a ). it is assumed that sub( a ) has full rank the following options are provided: let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". the factorization has the form sub( a ) = p * l * u, where p is elements (lower trapezoidal if m > n), and u is upper triangular the factorization has the form sub( a ) = p * l * u, where p is ments (lower trapezoidal if m > n), and u is upper triangular let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". if ijob = 1, this is the largest floating point number encountered which has count n(w) = nval(1) ieflag (input) integer on entry, the subdiagonal elements of the tridiagonal matrix. on exit, e has been destroyed q (local output) real array, being recombined. on exit, rho has been modified to the value required b being recombined. on exit, rho has been modified to the value required b let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". submatrix of order 1 or 2 splits off at the bottom because a subdiagonal element has become negligible each h(i) has the for h(i) = i - tau * v * v' pslamr1d has not been tested except withint the contect o let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". pslapdct counts the number of negative eigenvalues of (t - sigma i). this implementation of the sturm sequence loop has conditionals i floating point number. pslapdct will be referred to as the "paranoid" let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". interchange is initiated for each of rows or columns k1 trough k2 of sub( a ). this routine assumes that the pivoting information has also note that this routine will only work for k1-k2 being in the let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: ***************************************** local computation phas let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". factors, s(i) = 1/sqrt(a(i,i)), chosen so that the scaled distri- buted matrix b with elements b(i,j) = s(i)*a(i,j)*s(j) has ones o of b within a factor n of the smallest possible condition number let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". the factorization has the for sub( a ) = u' * u , if uplo = 'u', or the factorization has the for sub( a ) = u' * u , if uplo = 'u', or let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: ***************************************** local computation phas let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". the absolute tolerance for the eigenvalues. an eigenvalue (or cluster) is considered to be located if it has bee less. if abstol is less than or equal to zero, then ulp*|t| on entry, the subdiagonal elements of the tridiagonal matrix. on exit, e has been destroyed q (local output) real array, let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let k be the number of rows or columns of a distributed matrix, and assume that its process grid has dimension p x q would receive if k were distributed over the p processes of its let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: ***************************************** local computation phas let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: ***************************************** local computation phas p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: ******************************************************************* phase 1: local computation phase p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". or its conjugate-transpose, using a qr or lq factorization of sub( a ). it is assumed that sub( a ) has full rank the following options are provided: let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". the factorization has the form sub( a ) = p * l * u, where p is elements (lower trapezoidal if m > n), and u is upper triangular the factorization has the form sub( a ) = p * l * u, where p is ments (lower trapezoidal if m > n), and u is upper triangular let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let k be the number of rows or columns of a distributed matrix, and assume that its process grid has dimension p x q would receive if k were distributed over the p processes of its let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". submatrix of order 1 or 2 splits off at the bottom because a subdiagonal element has become negligible each h(i) has the for h(i) = i - tau * v * v' pzlamr1d has not been tested except withint the contect o let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". interchange is initiated for each of rows or columns k1 trough k2 of sub( a ). this routine assumes that the pivoting information has also note that this routine will only work for k1-k2 being in the let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: ***************************************** local computation phas let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". factors, s(i) = 1/sqrt(a(i,i)), chosen so that the scaled distri- buted matrix b with elements b(i,j) = s(i)*a(i,j)*s(j) has ones o of b within a factor n of the smallest possible condition number let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". the factorization has the for sub( a ) = u' * u , if uplo = 'u', or the factorization has the for sub( a ) = u' * u , if uplo = 'u', or let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: p pieces with one stored on each processor, and then proceeds in 2 phases for the factorization or 3 for th 1) local phase: ***************************************** local computation phas let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". let a be a generic term for any 2d block cyclicly distributed array. such a global array has an associated description vector desca "of the global array". > 0: if info = +i, u(i,i) is exactly zero. the factorization has been completed, but the factor u is exactl to solve a system of equations. j2 and j3 are computed after ju has been updated factorize the current block of jb columns the factorization has the for where l is a product of unit lower bidiagonal 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 > 0: if info = +i, u(i,i) is exactly zero. the factorization has been completed, but the factor u is exactl to solve a system of equations. j2 and j3 are computed after ju has been updated factorize the current block of jb columns the factorization has the for where l is a product of unit lower bidiagonal submatrix of order 1 or 2 splits off at the bottom because a subdiagonal element has become negligible 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 |
| have have with the active submatrix in rows and columns l to i. eigenvalues i+1 to ihi have already converged. either l = ilo, o this is the lookahead loop, going until we have on entry, a matrix already in schur form. on exit, the diagonal blocks of s have been rewritten to pai similar to the input. of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on each row and column of the distributed matrix b with elements b(i,j) = r(i) * a(i,j) * c(j) have absolute value 1 r(i) and c(j) are restricted to be between smlnum = smallest safe a(ia:ia+n-1,ja:ja+n-1). if fact = 'f' and equed is not 'n', then a(ia:ia+n-1,ja:ja+n-1) must have been equilibrated b not modified if fact = 'f' or 'n', or if fact = 'e' and pcheevx assumes ieee 754 standard compliant arithmetic. to port to a system which does not have ieee 754 arithmetic, modif -dno_ieee. this switch only affects the compilation of pslaiect.c. sub( b ) must have been previously factorized as u**h*u or l*l**h b sub( b ) must have been previously factorized as u**h*u or l*l**h b sub( b ) must have been previously factorized as u**h*u or l*l**h b let truea be the value that a would have at a given point in an unblocked code and determine the number of columns we have so we can check workspac irsr0 : pointer to part of work used to store the rowsums after they have been transposed to be along a process ro irsr0 : pointer to part of work used to store the rowsums after they have been transposed to be along a process ro triangular part is not referenced. on exit, if uplo = 'u', the last nb columns have been reduce the diagonal elements of sub( a ); the elements above the of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix is singular to working precision, and the solution and error bounds have not been computed ===================================================================== of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix max(5*n,np00*mq00) + ceil(m/p)*n, and should have the same input value on all processes that is significant. zero, indicating that the submatrix is singular and the solutions x have not been computed ===================================================================== if vect = 'q', a(ia:*,ja:*) is assumed to have been an nq-by- if nq >= k, q = h(1) h(2) . . . h(k); ihi (global input) integer ilo and ihi must have the same values as in the previous cal distributed submatrix q(ia+ilo:ia+ihi-1,ia+ilo:ja+ihi-1). of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on each row and column of the distributed matrix b with elements b(i,j) = r(i) * a(i,j) * c(j) have absolute value 1 r(i) and c(j) are restricted to be between smlnum = smallest safe a(ia:ia+n-1,ja:ja+n-1). if fact = 'f' and equed is not 'n', then a(ia:ia+n-1,ja:ja+n-1) must have been equilibrated b not modified if fact = 'f' or 'n', or if fact = 'e' and pdlaecv checks if the input intervals [ intvl(2*i-1), intvl(2*i) ], i = kf, ... , kl-1, have "converged" i.e., on output, all intervals [ intvl(2*i-1), intvl(2*i) ], i < kf, the second sub-eigenvector matrix). on exit, the contents of z have been destroyed by the updatin the second sub-eigenvector matrix). on exit, the contents of z have been destroyed by the updatin determine the number of columns we have so we can check workspac irsr0 : pointer to part of work used to store the rowsums after they have been transposed to be along a process ro triangular part is not referenced. on exit, if uplo = 'u', the last nb columns have been reduce the diagonal elements of sub( a ); the elements above the if vect = 'q', a(ia:*,ja:*) is assumed to have been an nq-by- if nq >= k, q = h(1) h(2) . . . h(k); ihi (global input) integer ilo and ihi must have the same values as in the previous cal distributed submatrix q(ia+ilo:ia+ihi-1,ia+ilo:ja+ihi-1). of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix is singular to working precision, and the solution and error bounds have not been computed ===================================================================== of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix since the user cannot know a priori what value nsplit will have, n words must be reserved for isplit. work (local workspace) double precision array, max(5*n,np00*mq00) + ceil(m/p)*n, and should have the same input value on all processes that is significant. pdsyevx assumes ieee 754 standard compliant arithmetic. to port to a system which does not have ieee 754 arithmetic, modif -dno_ieee. this switch only affects the compilation of pdlaiect.c. sub( b ) must have been previously factorized as u**t*u or l*l**t b sub( b ) must have been previously factorized as u**t*u or l*l**t b sub( b ) must have been previously factorized as u**h*u or l*l**h b let truea be the value that a would have at a given point in an unblocked code and zero, indicating that the submatrix is singular and the solutions x have not been computed ===================================================================== the following conventions have been used when calling pjlaenv fro 1) opts is a concatenation of all of the character options to of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on each row and column of the distributed matrix b with elements b(i,j) = r(i) * a(i,j) * c(j) have absolute value 1 r(i) and c(j) are restricted to be between smlnum = smallest safe a(ia:ia+n-1,ja:ja+n-1). if fact = 'f' and equed is not 'n', then a(ia:ia+n-1,ja:ja+n-1) must have been equilibrated b not modified if fact = 'f' or 'n', or if fact = 'e' and pslaecv checks if the input intervals [ intvl(2*i-1), intvl(2*i) ], i = kf, ... , kl-1, have "converged" i.e., on output, all intervals [ intvl(2*i-1), intvl(2*i) ], i < kf, the second sub-eigenvector matrix). on exit, the contents of z have been destroyed by the updatin the second sub-eigenvector matrix). on exit, the contents of z have been destroyed by the updatin determine the number of columns we have so we can check workspac irsr0 : pointer to part of work used to store the rowsums after they have been transposed to be along a process ro triangular part is not referenced. on exit, if uplo = 'u', the last nb columns have been reduce the diagonal elements of sub( a ); the elements above the if vect = 'q', a(ia:*,ja:*) is assumed to have been an nq-by- if nq >= k, q = h(1) h(2) . . . h(k); ihi (global input) integer ilo and ihi must have the same values as in the previous cal distributed submatrix q(ia+ilo:ia+ihi-1,ia+ilo:ja+ihi-1). of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix is singular to working precision, and the solution and error bounds have not been computed ===================================================================== of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix since the user cannot know a priori what value nsplit will have, n words must be reserved for isplit. work (local workspace) real array, dimension ( max( 5*n, 7 ) ) max(5*n,np00*mq00) + ceil(m/p)*n, and should have the same input value on all processes that is significant. pssyevx assumes ieee 754 standard compliant arithmetic. to port to a system which does not have ieee 754 arithmetic, modif -dno_ieee. this switch only affects the compilation of pslaiect.c. sub( b ) must have been previously factorized as u**t*u or l*l**t b sub( b ) must have been previously factorized as u**t*u or l*l**t b sub( b ) must have been previously factorized as u**h*u or l*l**h b let truea be the value that a would have at a given point in an unblocked code and zero, indicating that the submatrix is singular and the solutions x have not been computed ===================================================================== of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on each row and column of the distributed matrix b with elements b(i,j) = r(i) * a(i,j) * c(j) have absolute value 1 r(i) and c(j) are restricted to be between smlnum = smallest safe a(ia:ia+n-1,ja:ja+n-1). if fact = 'f' and equed is not 'n', then a(ia:ia+n-1,ja:ja+n-1) must have been equilibrated b not modified if fact = 'f' or 'n', or if fact = 'e' and pzheevx assumes ieee 754 standard compliant arithmetic. to port to a system which does not have ieee 754 arithmetic, modif -dno_ieee. this switch only affects the compilation of pdlaiect.c. sub( b ) must have been previously factorized as u**h*u or l*l**h b sub( b ) must have been previously factorized as u**h*u or l*l**h b sub( b ) must have been previously factorized as u**h*u or l*l**h b let truea be the value that a would have at a given point in an unblocked code and determine the number of columns we have so we can check workspac irsr0 : pointer to part of work used to store the rowsums after they have been transposed to be along a process ro irsr0 : pointer to part of work used to store the rowsums after they have been transposed to be along a process ro triangular part is not referenced. on exit, if uplo = 'u', the last nb columns have been reduce the diagonal elements of sub( a ); the elements above the of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix is singular to working precision, and the solution and error bounds have not been computed ===================================================================== of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix of the divide and conquer algorithm as a task-parallel algorithm. this formula in words is: no processor may have more than on drop out processors that do not have part of the matrix max(5*n,np00*mq00) + ceil(m/p)*n, and should have the same input value on all processes that is significant. zero, indicating that the submatrix is singular and the solutions x have not been computed ===================================================================== if vect = 'q', a(ia:*,ja:*) is assumed to have been an nq-by- if nq >= k, q = h(1) h(2) . . . h(k); ihi (global input) integer ilo and ihi must have the same values as in the previous cal distributed submatrix q(ia+ilo:ia+ihi-1,ia+ilo:ja+ihi-1). on entry, a matrix already in schur form. on exit, the diagonal blocks of s have been rewritten to pai similar to the input. with the active submatrix in rows and columns l to i. eigenvalues i+1 to ihi have already converged. either l = ilo, o this is the lookahead loop, going until we have |
| having having ccombamax1 finds the element having maximum real part absolut the last processor does not participate in the factorization of the reduced system, having sent its e_i already initiate send of off-diag block(s) to overlap with next part. the last processor does not participate in the solution of the reduced system, having sent its contribution already the last processor does not participate in the factorization of the reduced system, having sent its e_i already initiate send of off-diag block(s) to overlap with next part. the last processor does not participate in the solution of the reduced system, having sent its contribution already alpha (local output) complex on exit, alpha is computed in the process scope having th the last processor does not participate in the factorization of the reduced system, having sent its e_i already initiate send of off-diag block(s) to overlap with next part. the last processor does not participate in the solution of the reduced system, having sent its contribution already the last processor does not participate in the factorization of the reduced system, having sent its e_i already initiate send of off-diag block(s) to overlap with next part. the last processor does not participate in the solution of the reduced system, having sent its contribution already the last processor does not participate in the factorization of the reduced system, having sent its e_i already initiate send of off-diag block(s) to overlap with next part. the last processor does not participate in the solution of the reduced system, having sent its contribution already the last processor does not participate in the factorization of the reduced system, having sent its e_i already initiate send of off-diag block(s) to overlap with next part. the last processor does not participate in the solution of the reduced system, having sent its contribution already alpha (local output) double precision on exit, alpha is computed in the process scope having th the last processor does not participate in the factorization of the reduced system, having sent its e_i already initiate send of off-diag block(s) to overlap with next part. the last processor does not participate in the solution of the reduced system, having sent its contribution already the last processor does not participate in the factorization of the reduced system, having sent its e_i already initiate send of off-diag block(s) to overlap with next part. the last processor does not participate in the solution of the reduced system, having sent its contribution already the last processor does not participate in the factorization of the reduced system, having sent its e_i already initiate send of off-diag block(s) to overlap with next part. the last processor does not participate in the solution of the reduced system, having sent its contribution already the last processor does not participate in the factorization of the reduced system, having sent its e_i already initiate send of off-diag block(s) to overlap with next part. the last processor does not participate in the solution of the reduced system, having sent its contribution already alpha (local output) real on exit, alpha is computed in the process scope having th the last processor does not participate in the factorization of the reduced system, having sent its e_i already initiate send of off-diag block(s) to overlap with next part. the last processor does not participate in the solution of the reduced system, having sent its contribution already the last processor does not participate in the factorization of the reduced system, having sent its e_i already initiate send of off-diag block(s) to overlap with next part. the last processor does not participate in the solution of the reduced system, having sent its contribution already the last processor does not participate in the factorization of the reduced system, having sent its e_i already initiate send of off-diag block(s) to overlap with next part. the last processor does not participate in the solution of the reduced system, having sent its contribution already the last processor does not participate in the factorization of the reduced system, having sent its e_i already initiate send of off-diag block(s) to overlap with next part. the last processor does not participate in the solution of the reduced system, having sent its contribution already alpha (local output) complex*16 on exit, alpha is computed in the process scope having th the last processor does not participate in the factorization of the reduced system, having sent its e_i already initiate send of off-diag block(s) to overlap with next part. the last processor does not participate in the solution of the reduced system, having sent its contribution already the last processor does not participate in the factorization of the reduced system, having sent its e_i already initiate send of off-diag block(s) to overlap with next part. the last processor does not participate in the solution of the reduced system, having sent its contribution already zcombamax1 finds the element having maximum real part absolut |
| HBL HBL on exit, lwork is the size of the work buffer. this must be at least 7*ceil( ceil( (i-l)/HBL ) here lcm is least common multiple, and nprowxnpcol is the finishing up. even if rotn=1, in order to minimize border communication sometimes k1(ki)=HBL-2 & k2(ki)=hbl-1 so bot on exit, lwork is the size of the work buffer. this must be at least 2*ceil( ceil( (i-l)/HBL ) here lcm is least common multiple, and nprowxnpcol is the on exit, lwork is the size of the work buffer. this must be at least 7*ceil( ceil( (i-l)/HBL ) here lcm is least common multiple, and nprowxnpcol is the if ( l .ge. i - (2*iblk-1) ) if ( l .ge. i - max(2*iblk-1,HBL) now the active submatrix is in rows and columns l to i. if on exit, lwork is the size of the work buffer. this must be at least 2*ceil( ceil( (i-l)/HBL ) here lcm is least common multiple, and nprowxnpcol is the on exit, lwork is the size of the work buffer. this must be at least 7*ceil( ceil( (i-l)/HBL ) here lcm is least common multiple, and nprowxnpcol is the if ( l .ge. i - (2*iblk-1) ) if ( l .ge. i - max(2*iblk-1,HBL) now the active submatrix is in rows and columns l to i. if on exit, lwork is the size of the work buffer. this must be at least 2*ceil( ceil( (i-l)/HBL ) here lcm is least common multiple, and nprowxnpcol is the on exit, lwork is the size of the work buffer. this must be at least 7*ceil( ceil( (i-l)/HBL ) here lcm is least common multiple, and nprowxnpcol is the finishing up. even if rotn=1, in order to minimize border communication sometimes k1(ki)=HBL-2 & k2(ki)=hbl-1 so bot on exit, lwork is the size of the work buffer. this must be at least 2*ceil( ceil( (i-l)/HBL ) here lcm is least common multiple, and nprowxnpcol is the |
| Hegland Hegland andrew j. cleary, livermore national lab and university of tenn., and marbwus Hegland, australian natonal university. feb., 1997 andrew j. cleary, livermore national lab and university of tenn., and markus Hegland, australian national university. feb., 1997 last modified by: peter arbenz, institute of scientific computing, andrew j. cleary, livermore national lab and university of tenn., and markus Hegland, australian national university. feb., 1997 last modified by: peter arbenz, institute of scientific computing, andrew j. cleary, livermore national lab and university of tenn., and marbwus Hegland, australian natonal university. feb., 1997 |
| held held zero out space that held original cop nvs(i) = number of processes number of eigenvectors held by processes [0,i-1 nvs(nprocs+1) = number of eigen vectors held by [0,nprocs) == zero out space that held original cop nvs(i) = number of processes number of eigenvectors held by processes [0,i-1 nvs(nprocs+1) = number of eigen vectors held by [0,nprocs) == zero out space that held original cop nvs(i) = number of processes number of eigenvectors held by processes [0,i-1 nvs(nprocs+1) = number of eigen vectors held by [0,nprocs) == zero out space that held original cop nvs(i) = number of processes number of eigenvectors held by processes [0,i-1 nvs(nprocs+1) = number of eigen vectors held by [0,nprocs) == |
| Hence Hence iclustr(2*i-1) to iclustr(2*i), could not be reorthogonalized due to lack of workspace. Hence th orthogonal. iclustr() is a zero terminated array. iclustr(2*i-1) to iclustr(2*i), could not be reorthogonalized due to lack of workspace. Hence th orthogonal. iclustr() is a zero terminated array. pchengst calls pchegst when uplo='u', Hence pchengst provide at the top of the loop, bindex gets incremented, Hence where h = h( maxindex:n, 1:bindex-1 ) and info/(m+1), could not be orthogonalized due to lack of workspace. Hence the eigenvectors corresponding to thes array --- ( iclustr(2*k).ne.0 .and. iclustr(2*k+1).eq.0 ) info/(m+1), could not be orthogonalized due to lack of workspace. Hence the eigenvectors corresponding to thes array --- ( iclustr(2*k).ne.0 .and. iclustr(2*k+1).eq.0 ) iclustr(2*i-1) to iclustr(2*i), could not be reorthogonalized due to lack of workspace. Hence th orthogonal. iclustr() is a zero terminated array. iclustr(2*i-1) to iclustr(2*i), could not be reorthogonalized due to lack of workspace. Hence th orthogonal. iclustr() is a zero terminated array. pdsyngst calls pdhegst when uplo='u', Hence pdhengst provide at the top of the loop, bindex gets incremented, Hence where h = h( maxindex:n, 1:bindex-1 ) and most parameters set via a call to pjlaenv must be identical on all processors and Hence pjlaenv will return the sam in particular, the panel blocking factor can be different info/(m+1), could not be orthogonalized due to lack of workspace. Hence the eigenvectors corresponding to thes array --- ( iclustr(2*k).ne.0 .and. iclustr(2*k+1).eq.0 ) iclustr(2*i-1) to iclustr(2*i), could not be reorthogonalized due to lack of workspace. Hence th orthogonal. iclustr() is a zero terminated array. iclustr(2*i-1) to iclustr(2*i), could not be reorthogonalized due to lack of workspace. Hence th orthogonal. iclustr() is a zero terminated array. pssyngst calls pshegst when uplo='u', Hence pshengst provide at the top of the loop, bindex gets incremented, Hence where h = h( maxindex:n, 1:bindex-1 ) and iclustr(2*i-1) to iclustr(2*i), could not be reorthogonalized due to lack of workspace. Hence th orthogonal. iclustr() is a zero terminated array. iclustr(2*i-1) to iclustr(2*i), could not be reorthogonalized due to lack of workspace. Hence th orthogonal. iclustr() is a zero terminated array. pzhengst calls pzhegst when uplo='u', Hence pzhengst provide at the top of the loop, bindex gets incremented, Hence where h = h( maxindex:n, 1:bindex-1 ) and info/(m+1), could not be orthogonalized due to lack of workspace. Hence the eigenvectors corresponding to thes array --- ( iclustr(2*k).ne.0 .and. iclustr(2*k+1).eq.0 ) |
| Henry Henry goto put in by g. Henry to fix alpha proble gp = ( ( oldgp+p )-( d( l )-p ) ) / implemented by: g. Henry, may 1, 199 ===================================================================== implemented by: g. Henry, november 17, 199 ===================================================================== implemented by: g. Henry, november 17, 199 ===================================================================== implemented by: g. Henry, november 17, 199 ===================================================================== implemented by: g. Henry, may 1, 199 ===================================================================== implemented by: g. Henry, november 17, 199 ===================================================================== implemented by: g. Henry, november 17, 199 ===================================================================== implemented by: g. Henry, november 17, 199 ===================================================================== implemented by: g. Henry, may 1, 199 ===================================================================== implemented by: g. Henry, november 17, 199 ===================================================================== implemented by: g. Henry, november 17, 199 ===================================================================== implemented by: g. Henry, may 1, 199 ===================================================================== implemented by: g. Henry, november 17, 199 ===================================================================== implemented by: g. Henry, november 17, 199 ===================================================================== goto put in by g. Henry to fix alpha proble gp = ( ( oldgp+p )-( d( l )-p ) ) / |
| here here here a11, a21 and a31 denote the current block of jb column partitioning are jb, i2, i3 respectively, and the numbers the main loop begins here. i is the loop index and decreases fro with the active submatrix in rows and columns l to i. here a11, a21 and a31 denote the current block of jb column partitioning are jb, i2, i3 respectively, and the numbers want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th at present, scale is always returned as 1.0, it is returned here to allow for future enhancement info (global output) integer sub( b )*sub( a )*x=(lambda)*x. here sub( a ) denoting a( ia:ia+n-1, ja:ja+n-1 ) is assumed to b to be hermitian positive definite. at present, scale is always returned as 1.0, it is returned here to allow for future enhancement work (local workspace/local output) complex array, lcm(nprow,npcol) ) here lcm is least common multiple, and nprowxnpcol is th the main loop begins here. i is the loop index and decreases fro iteration of the loop works with the active submatrix in rows lcm(nprow,npcol) ) here lcm is least common multiple, and nprowxnpcol is th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th from smallest to largest within the block (the output array w from psstebz with order='b' is expected here). thi on output, the first m elements contain the input where y' denotes the conjugate transpose of the vector y if all eigenvectors are requested, the routine may either return the here q and p**h are the unitary distributed matrices determined b bidiagonal form: a(ia:*,ja:*) = q * b * p**h. q and p**h are defined want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th lcm(nprow,npcol) ) here lcm is least common multiple, and nprowxnpcol is th the main loop begins here. i is the loop index and decreases fro iteration of the loop works with the active submatrix in rows lcm(nprow,npcol) ) here lcm is least common multiple, and nprowxnpcol is th here q and p**t are the orthogonal distributed matrices determined b bidiagonal form: a(ia:*,ja:*) = q * b * p**t. q and p**t are defined want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th from smallest to largest within the block (the output array w from pdstebz with order='b' is expected here). thi on output, the first m elements contain the input at present, scale is always returned as 1.0, it is returned here to allow for future enhancement info (global output) integer sub( b )*sub( a )*x=(lambda)*x. here sub( a ) denoting a( ia:ia+n-1, ja:ja+n-1 ) is assumed to b to be symmetric positive definite. at present, scale is always returned as 1.0, it is returned here to allow for future enhancement work (local workspace/local output) double precision array, want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th lcm(nprow,npcol) ) here lcm is least common multiple, and nprowxnpcol is th the main loop begins here. i is the loop index and decreases fro iteration of the loop works with the active submatrix in rows lcm(nprow,npcol) ) here lcm is least common multiple, and nprowxnpcol is th here q and p**t are the orthogonal distributed matrices determined b bidiagonal form: a(ia:*,ja:*) = q * b * p**t. q and p**t are defined want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th from smallest to largest within the block (the output array w from psstebz with order='b' is expected here). thi on output, the first m elements contain the input at present, scale is always returned as 1.0, it is returned here to allow for future enhancement info (global output) integer sub( b )*sub( a )*x=(lambda)*x. here sub( a ) denoting a( ia:ia+n-1, ja:ja+n-1 ) is assumed to b to be symmetric positive definite. at present, scale is always returned as 1.0, it is returned here to allow for future enhancement work (local workspace/local output) real array, want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th at present, scale is always returned as 1.0, it is returned here to allow for future enhancement info (global output) integer sub( b )*sub( a )*x=(lambda)*x. here sub( a ) denoting a( ia:ia+n-1, ja:ja+n-1 ) is assumed to b to be hermitian positive definite. at present, scale is always returned as 1.0, it is returned here to allow for future enhancement work (local workspace/local output) complex*16 array, lcm(nprow,npcol) ) here lcm is least common multiple, and nprowxnpcol is th the main loop begins here. i is the loop index and decreases fro iteration of the loop works with the active submatrix in rows lcm(nprow,npcol) ) here lcm is least common multiple, and nprowxnpcol is th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th want to find errors with min( ), so if no error, set it to a big number. if there already is an error, multiply by the th from smallest to largest within the block (the output array w from pdstebz with order='b' is expected here). thi on output, the first m elements contain the input where y' denotes the conjugate transpose of the vector y if all eigenvectors are requested, the routine may either return the here q and p**h are the unitary distributed matrices determined b bidiagonal form: a(ia:*,ja:*) = q * b * p**h. q and p**h are defined here a11, a21 and a31 denote the current block of jb column partitioning are jb, i2, i3 respectively, and the numbers here a11, a21 and a31 denote the current block of jb column partitioning are jb, i2, i3 respectively, and the numbers the main loop begins here. i is the loop index and decreases fro with the active submatrix in rows and columns l to i. |
| hermitian hermitian u * x = b, or u**h * x = b, where l or u is the cholesky factor of a hermitian positiv a = u**h*d*u or a = l*d*l**h (computed by cpttrf). l**t* x = b, or l * x = b, where l is the cholesky factor of a hermitian positiv a = l*d*l**h (computed by dpttrf). pcheevd computes all the eigenvalues and eigenvectors of a hermitian pcheevx computes selected eigenvalues and, optionally, eigenvectors of a complex hermitian matrix a by calling the recommended sequenc specifying a range of values or a range of indices for the desired 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 generalize pchentrd reduces a complex hermitian matrix sub( a ) to hermitia q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pchetd2 reduces a complex hermitian matrix sub( a ) to hermitia q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pchetrd reduces a complex hermitian matrix sub( a ) to hermitia q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pchettrd reduces a complex hermitian matrix sub( a ) to hermitia q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). if the matrix is hermitian, we address only a triangular portio can be obtained by adding along row i and column i of the the where tau is a complex scalar and v is a complex (n-1)-element vector. note that h is not hermitian if the elements of sub( x ) are all zero and x(iax,jax) is real, pclatrd reduces nb rows and columns of a complex hermitian tridiagonal form by an unitary similarity transformation pcpocon estimates the reciprocal of the condition number (in the 1-norm) of a complex hermitian positive definite distributed matri pcpotrf. pcpoequ computes row and column scalings intended to equilibrate a distributed hermitian positive definite matri (with respect to the two-norm). sr and sc contain the scale pcporfs improves the computed solution to a system of linear equations when the coefficient matrix is hermitian positive definit solutions. where sub( a ) denotes a(ia:ia+n-1,ja:ja+n-1) and is an n-by-n hermitian distributed positive definite matrix and x and sub( b matrices. ( lld_a, locc(ja+n-1) ). on entry, the hermitian matrix a, except if fact = 'f' an diag(sr)*a*diag(sc). if uplo = 'u', the leading pcpotf2 computes the cholesky factorization of a complex hermitian pcpotrf computes the cholesky factorization of an n-by-n complex hermitian positive definite distributed matrix sub( a ) denotin pcpotri computes the inverse of a complex hermitian positive definit cholesky factorization sub( a ) = u**h*u or l*l**h computed by where sub( a ) denotes a(ia:ia+n-1,ja:ja+n-1) and is a n-by-n hermitian positive definite distributed matrix using the cholesk sub( b ) denotes the distributed matrix b(ib:ib+n-1,jb:jb+nrhs-1). pdsyngst reduces a complex hermitian-definite generalize pdsyttrd reduces a complex hermitian matrix sub( a ) to hermitia q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pjlaenv is called from the scalapack symmetric and hermitian problem-dependent parameters for the local environment. see ispec pssyngst reduces a complex hermitian-definite generalize pssyttrd reduces a complex hermitian matrix sub( a ) to hermitia q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pzheevd computes all the eigenvalues and eigenvectors of a hermitian pzheevx computes selected eigenvalues and, optionally, eigenvectors of a complex hermitian matrix a by calling the recommended sequenc specifying a range of values or a range of indices for the desired 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 generalize pzhentrd reduces a complex hermitian matrix sub( a ) to hermitia q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pzhetd2 reduces a complex hermitian matrix sub( a ) to hermitia q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pzhetrd reduces a complex hermitian matrix sub( a ) to hermitia q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). pzhettrd reduces a complex hermitian matrix sub( a ) to hermitia q' * sub( a ) * q = t, where sub( a ) = a(ia:ia+n-1,ja:ja+n-1). if the matrix is hermitian, we address only a triangular portio can be obtained by adding along row i and column i of the the where tau is a complex scalar and v is a complex (n-1)-element vector. note that h is not hermitian if the elements of sub( x ) are all zero and x(iax,jax) is real, pzlatrd reduces nb rows and columns of a complex hermitian tridiagonal form by an unitary similarity transformation pzpocon estimates the reciprocal of the condition number (in the 1-norm) of a complex hermitian positive definite distributed matri pzpotrf. pzpoequ computes row and column scalings intended to equilibrate a distributed hermitian positive definite matri (with respect to the two-norm). sr and sc contain the scale pzporfs improves the computed solution to a system of linear equations when the coefficient matrix is hermitian positive definit solutions. where sub( a ) denotes a(ia:ia+n-1,ja:ja+n-1) and is an n-by-n hermitian distributed positive definite matrix and x and sub( b matrices. ( lld_a, locc(ja+n-1) ). on entry, the hermitian matrix a, except if fact = 'f' an diag(sr)*a*diag(sc). if uplo = 'u', the leading pzpotf2 computes the cholesky factorization of a complex hermitian pzpotrf computes the cholesky factorization of an n-by-n complex hermitian positive definite distributed matrix sub( a ) denotin pzpotri computes the inverse of a complex hermitian positive definit cholesky factorization sub( a ) = u**h*u or l*l**h computed by where sub( a ) denotes a(ia:ia+n-1,ja:ja+n-1) and is a n-by-n hermitian positive definite distributed matrix using the cholesk sub( b ) denotes the distributed matrix b(ib:ib+n-1,jb:jb+nrhs-1). l**t* x = b, or l * x = b, where l is the cholesky factor of a hermitian positiv a = l*d*l**h (computed by spttrf). u * x = b, or u**h * x = b, where l or u is the cholesky factor of a hermitian positiv a = u**h*d*u or a = l*d*l**h (computed by zpttrf). |
| Hessenberg Hessenberg each subsequent iteration determines a reflection g to restore the Hessenberg form in the (k-1)th column, and thu submatrix. nr is the order of g (nbulge > 1) and the first shift is starting in the middle of an unreduced Hessenberg matrix because of two or more consecutiv (nbulge > 1) and the first shift is starting in the middle of an unreduced Hessenberg matrix because of two or more consecutive smal pcgehd2 reduces a complex general distributed matrix sub( a ) to upper Hessenberg form h by an unitary similarity transformation sub( a ) = a(ia+n-1:ia+n-1,ja+n-1:ja+n-1). pcgehrd reduces a complex general distributed matrix sub( a ) to upper Hessenberg form h by an unitary similarity transformation sub( a ) = a(ia+n-1:ia+n-1,ja+n-1:ja+n-1). (desca(lld_),*) on entry, the Hessenberg matrix whose tridiagonal part i unchanged on exit. a(ia:ia+n-1,ja:ja+n-k), h denotes a modified element of the upper Hessenberg matrix h, and vi denotes an element of the vecto sub( a ) may be full, upper triangular, lower triangular or upper Hessenberg notes a (global input) complex array, dimension (desca(lld_),*) on entry, the Hessenberg matrix whose tridiagonal part i unchanged on exit. (desca(lld_),*) on entry, the Hessenberg matrix pdgehd2 reduces a real general distributed matrix sub( a ) to upper Hessenberg form h by an orthogonal similarity transforma sub( a ) = a(ia+n-1:ia+n-1,ja+n-1:ja+n-1). pdgehrd reduces a real general distributed matrix sub( a ) to upper Hessenberg form h by an orthogonal similarity transforma sub( a ) = a(ia+n-1:ia+n-1,ja+n-1:ja+n-1). (desca(lld_),*) on entry, the Hessenberg matrix whose tridiagonal part i unchanged on exit. a(ia:ia+n-1,ja:ja+n-k), h denotes a modified element of the upper Hessenberg matrix h, and vi denotes an element of the vecto sub( a ) may be full, upper triangular, lower triangular or upper Hessenberg notes (desca(lld_),*) on entry, the Hessenberg matrix whose tridiagonal part i unchanged on exit. (desca(lld_),*) on entry, the Hessenberg matrix psgehd2 reduces a real general distributed matrix sub( a ) to upper Hessenberg form h by an orthogonal similarity transforma sub( a ) = a(ia+n-1:ia+n-1,ja+n-1:ja+n-1). psgehrd reduces a real general distributed matrix sub( a ) to upper Hessenberg form h by an orthogonal similarity transforma sub( a ) = a(ia+n-1:ia+n-1,ja+n-1:ja+n-1). (desca(lld_),*) on entry, the Hessenberg matrix whose tridiagonal part i unchanged on exit. a(ia:ia+n-1,ja:ja+n-k), h denotes a modified element of the upper Hessenberg matrix h, and vi denotes an element of the vecto sub( a ) may be full, upper triangular, lower triangular or upper Hessenberg notes (desca(lld_),*) on entry, the Hessenberg matrix whose tridiagonal part i unchanged on exit. (desca(lld_),*) on entry, the Hessenberg matrix pzgehd2 reduces a complex general distributed matrix sub( a ) to upper Hessenberg form h by an unitary similarity transformation sub( a ) = a(ia+n-1:ia+n-1,ja+n-1:ja+n-1). pzgehrd reduces a complex general distributed matrix sub( a ) to upper Hessenberg form h by an unitary similarity transformation sub( a ) = a(ia+n-1:ia+n-1,ja+n-1:ja+n-1). (desca(lld_),*) on entry, the Hessenberg matrix whose tridiagonal part i unchanged on exit. a(ia:ia+n-1,ja:ja+n-k), h denotes a modified element of the upper Hessenberg matrix h, and vi denotes an element of the vecto sub( a ) may be full, upper triangular, lower triangular or upper Hessenberg notes a (global input) complex*16 array, dimension (desca(lld_),*) on entry, the Hessenberg matrix whose tridiagonal part i unchanged on exit. (desca(lld_),*) on entry, the Hessenberg matrix (nbulge > 1) and the first shift is starting in the middle of an unreduced Hessenberg matrix because of two or more consecutive smal each subsequent iteration determines a reflection g to restore the Hessenberg form in the (k-1)th column, and thu submatrix. nr is the order of g (nbulge > 1) and the first shift is starting in the middle of an unreduced Hessenberg matrix because of two or more consecutiv |
| heterogeneity heterogeneity converge in csteqr2 after a total of 30*n iterations. if info = n+1, then pcheev has detected heterogeneity the process grid. in this case, the accuracy of converge in dsteqr2 after a total of 30*n iterations. if info = n+1, then pdsyev has detected heterogeneity the process grid. in this case, the accuracy of converge in ssteqr2 after a total of 30*n iterations. if info = n+1, then pssyev has detected heterogeneity the process grid. in this case, the accuracy of converge in zsteqr2 after a total of 30*n iterations. if info = n+1, then pzheev has detected heterogeneity the process grid. in this case, the accuracy of |
| heterogeneous heterogeneous different processes. because of this, it is possible that a heterogeneous system may return incorrect results without any erro in addition, this routine performs a global minimization and maximi- zation on these values, to support heterogeneous computing networks arguments the different processes. because of this, it is possible that a heterogeneous system may return incorrect results without any erro the different processes. because of this, it is possible that a heterogeneous system may return incorrect results without any erro in addition, this routine performs a global minimization and maximi- zation on these values, to support heterogeneous computing networks arguments the different processes. because of this, it is possible that a heterogeneous system may return incorrect results without any erro the different processes. because of this, it is possible that a heterogeneous system may return incorrect results without any erro different processes. because of this, it is possible that a heterogeneous system may return incorrect results without any erro |
| hexadecimal hexadecimal which subtract like the cray x-mp, cray y-mp, cray c-90, or cray-2. it could conceivably fail on hexadecimal or decimal machine which subtract like the cray x-mp, cray y-mp, cray c-90, or cray-2. it could conceivably fail on hexadecimal or decimal machine which subtract like the cray x-mp, cray y-mp, cray c-90, or cray-2. it could conceivably fail on hexadecimal or decimal machine which subtract like the cray x-mp, cray y-mp, cray c-90, or cray-2. it could conceivably fail on hexadecimal or decimal machine |
| High High 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 note : to obtain orthogonal vectors, it is best if
eigenvalues are computed to Highest accuracy ( this can b
slamch('u') --- abstol is an input parameter
note : to obtain orthogonal vectors, it is best if
eigenvalues are computed to Highest accuracy ( this can b
dlamch('u') --- abstol is an input parameter
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 note : to obtain orthogonal vectors, it is best if
eigenvalues are computed to Highest accuracy ( this can b
slamch('u') --- abstol is an input parameter
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 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 note : to obtain orthogonal vectors, it is best if
eigenvalues are computed to Highest accuracy ( this can b
dlamch('u') --- abstol is an input parameter
|
| Higham Higham the serial version clacon has been contributed by nick Higham march 16, 1988. the serial version was contributed to lapack by nick Higham for us the serial version dlacon has been contributed by nick Higham march 16, 1988. the serial version of this routine was originally contributed by nick Higham for use with zlacon notes the serial version of this routine was originally contributed by nick Higham for use with clacon notes the serial version slacon has been contributed by nick Higham march 16, 1988. the serial version zlacon has been contributed by nick Higham march 16, 1988. the serial version was contributed to lapack by nick Higham for us |
| highest highest note : to obtain orthogonal vectors, it is best if
eigenvalues are computed to highest accuracy ( this can b
slamch('u') --- abstol is an input parameter
note : to obtain orthogonal vectors, it is best if
eigenvalues are computed to highest accuracy ( this can b
dlamch('u') --- abstol is an input parameter
note : to obtain orthogonal vectors, it is best if
eigenvalues are computed to highest accuracy ( this can b
slamch('u') --- abstol is an input parameter
note : to obtain orthogonal vectors, it is best if
eigenvalues are computed to highest accuracy ( this can b
dlamch('u') --- abstol is an input parameter
|
| hit hit we first hit a border when mod(k1(ki)-1,hbl)=hbl-2 and we hi we first hit a border when mod(k1(ki)-1,hbl)=hbl-2 and we hi we first hit a border when mod(k1(ki)-1,hbl)=hbl-2 and we hi we first hit a border when mod(k1(ki)-1,hbl)=hbl-2 and we hi |
| HL_i HL_i copy matrix HL_i (the last bwu rows of gl_i^c) to afu stor since we have gl_i^c stored, copy matrix HL_i (the last bwu rows of gl_i^t) to afu stor since we have gl_i^t stored, copy matrix HL_i (the last bwu rows of gl_i^t) to afu stor since we have gl_i^t stored, copy matrix HL_i (the last bwu rows of gl_i^c) to afu stor since we have gl_i^c stored, |
| hold hold restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size eigenvalues will be computed most accurately when abstol is
set to twice the underflow threshold 2*pslamch('s') not zero
(mod(info/8,2).ne.0)), indicating that some eigenvalues or
eigenvalues will be computed most accurately when abstol is
set to twice the underflow threshold 2*pslamch('s') not zero
(mod(info/8,2).ne.0)), indicating that some eigenvalues or
temporary variables. the following variables are used within a few lines after they are set and do hold state from one loo restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size work (local workspace) double precision dimension (lwork) used to hold the buffers sent from one process to anothe lwork (local input) integer size of work array work (local workspace) double precision dimension (lwork) used to hold the buffers sent from one process to anothe lwork (local input) integer size of work array restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted eigenvalues will be computed most accurately when abstol is
set to twice the underflow threshold 2*pdlamch('s') not zero
(mod(info/8,2).ne.0)), indicating that some eigenvalues or
eigenvalues will be computed most accurately when abstol is
set to twice the underflow threshold 2*pdlamch('s') not zero
(mod(info/8,2).ne.0)), indicating that some eigenvalues or
temporary variables. the following variables are used within a few lines after they are set and do hold state from one loo restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size work (local workspace) real dimension (lwork) used to hold the buffers sent from one process to anothe lwork (local input) integer size of work array work (local workspace) real dimension (lwork) used to hold the buffers sent from one process to anothe lwork (local input) integer size of work array restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted eigenvalues will be computed most accurately when abstol is
set to twice the underflow threshold 2*pslamch('s') not zero
(mod(info/8,2).ne.0)), indicating that some eigenvalues or
eigenvalues will be computed most accurately when abstol is
set to twice the underflow threshold 2*pslamch('s') not zero
(mod(info/8,2).ne.0)), indicating that some eigenvalues or
temporary variables. the following variables are used within a few lines after they are set and do hold state from one loo restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size eigenvalues will be computed most accurately when abstol is
set to twice the underflow threshold 2*pdlamch('s') not zero
(mod(info/8,2).ne.0)), indicating that some eigenvalues or
eigenvalues will be computed most accurately when abstol is
set to twice the underflow threshold 2*pdlamch('s') not zero
(mod(info/8,2).ne.0)), indicating that some eigenvalues or
temporary variables. the following variables are used within a few lines after they are set and do hold state from one loo restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted restriction on nb, the size of each block on each processor, must hold the bulk of parallel computation is done on the matrix of size form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted |
| holding holding form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted form a new blacs grid (the "standard form" grid) with only procs holding part of the matrix, of size 1xnp where np is adjusted |
| holds holds vecs (global input) complex array of size 3*n (matrix size) this holds the size 3 reflectors one after another and thi size) this holds the size 3 reflectors one after another and thi for watobd, the following holds watobd = max(max(wpclange,wpcgebrd), indeed, the previous loop invariant as stated above for the top of the loop still holds, but with bindex = 0, h and the eigenvectors on input. each eigenvector resides entirely in one process. each process holds a contiguous set o process holds is: sum for i=[0,iam-1) of nvs(i) for watobd, the following holds watobd = max(max(wpdlange,wpdgebrd), the eigenvectors on input. each eigenvector resides entirely in one process. each process holds a contiguous set o process holds is: sum for i=[0,iam-1) of nvs(i) indeed, the previous loop invariant as stated above for the top of the loop still holds, but with bindex = 0, h and for watobd, the following holds watobd = max(max(wpslange,wpsgebrd), the eigenvectors on input. each eigenvector resides entirely in one process. each process holds a contiguous set o process holds is: sum for i=[0,iam-1) of nvs(i) indeed, the previous loop invariant as stated above for the top of the loop still holds, but with bindex = 0, h and for watobd, the following holds watobd = max(max(wpzlange,wpzgebrd), indeed, the previous loop invariant as stated above for the top of the loop still holds, but with bindex = 0, h and the eigenvectors on input. each eigenvector resides entirely in one process. each process holds a contiguous set o process holds is: sum for i=[0,iam-1) of nvs(i) size) this holds the size 3 reflectors one after another and thi vecs (global input) complex*16 array of size 3*n (matrix size) this holds the size 3 reflectors one after another and thi |
| homogeneous homogeneous in case of a homogeneous process grid this upper limit ca processor. in its present form, pcheev assumes a homogeneous system and make different processes. because of this, it is possible that a in case of a homogeneous process grid this upper limit ca processor. in its present form, pdsyev assumes a homogeneous system and make the different processes. because of this, it is possible that a in its present form, pdsyevd assumes a homogeneous system and make the different processes. because of this, it is possible that a in case of a homogeneous process grid this upper limit ca processor. in its present form, pssyev assumes a homogeneous system and make the different processes. because of this, it is possible that a in its present form, pssyevd assumes a homogeneous system and make the different processes. because of this, it is possible that a in case of a homogeneous process grid this upper limit ca processor. in its present form, pzheev assumes a homogeneous system and make different processes. because of this, it is possible that a |
| hope hope the algorithm used in this program is basically backward (forward) substitution. it is the hope that scaling would be used to make th been implemented in pclattrs which is called by this routine to solve the algorithm used in this program is basically backward (forward) substitution. it is the hope that scaling would be used to make th been implemented in pzlattrs which is called by this routine to solve |
| house house a( index:n, index ) -= ( v * ht(bindex) + h * vt( bindex) ) m h = house( a(index:n, index) m vt = v^t; ht = h^t a( index:n, index ) -= ( v * ht(bindex) + h * vt( bindex) ) m h = house( a(index:n, index) m vt = v^t; ht = h^t a( index:n, index ) -= ( v * ht(bindex) + h * vt( bindex) ) m h = house( a(index:n, index) m vt = v^t; ht = h^t a( index:n, index ) -= ( v * ht(bindex) + h * vt( bindex) ) m h = house( a(index:n, index) m vt = v^t; ht = h^t |
| Householder Householder claref applies one or several Householder reflectors of size rows or columns. dlaref applies one or several Householder reflectors of size rows or columns. side = 'r'. it contains the local pieces of the distributed vectors v representing the Householder transformation if storev = 'c' and side = 'l', lld_v >= max(1,locr(iv+m-1)); if incx = 1, and locr(ix) otherwise. this array contains the Householder scalars related to the householder vectors storev = 'r'. the distributed matrix v contains the Householder vectors. see further details iv (global input) integer the columns of the distributed submatrix sub( a ) containing the meaningful part of the Householder reflectors to an array of local dimension (locr(iv+k-1),locc(jv+n-1)). the distributed matrix v contains the Householder vectors the columns of the distributed submatrix sub( a ) containing the meaningful part of the Householder reflectors. l > 0 a (local input/local output) complex pointer into the the factorization is obtained by Householder's method. the kt introduce zeros into the (m - k + 1)th row of sub( a ), is given in the columns of the distributed submatrix sub( a ) containing the meaningful part of the Householder reflectors the columns of the distributed submatrix sub( a ) containing the meaningful part of the Householder reflectors side = 'r'. it contains the local pieces of the distributed vectors v representing the Householder transformation if storev = 'c' and side = 'l', lld_v >= max(1,locr(iv+m-1)); if incx = 1, and locr(ix) otherwise. this array contains the Householder scalars related to the householder vectors storev = 'r'. the distributed matrix v contains the Householder vectors. see further details iv (global input) integer the columns of the distributed submatrix sub( a ) containing the meaningful part of the Householder reflectors to an array of local dimension (locr(iv+k-1),locc(jv+n-1)). the distributed matrix v contains the Householder vectors the columns of the distributed submatrix sub( a ) containing the meaningful part of the Householder reflectors. l > 0 a (local input/local output) double precision pointer into the the columns of the distributed submatrix sub( a ) containing the meaningful part of the Householder reflectors the columns of the distributed submatrix sub( a ) containing the meaningful part of the Householder reflectors the factorization is obtained by Householder's method. the kt the (m - k + 1)th row of sub( a ), is given in the form side = 'r'. it contains the local pieces of the distributed vectors v representing the Householder transformation if storev = 'c' and side = 'l', lld_v >= max(1,locr(iv+m-1)); if incx = 1, and locr(ix) otherwise. this array contains the Householder scalars related to the householder vectors storev = 'r'. the distributed matrix v contains the Householder vectors. see further details iv (global input) integer the columns of the distributed submatrix sub( a ) containing the meaningful part of the Householder reflectors to an array of local dimension (locr(iv+k-1),locc(jv+n-1)). the distributed matrix v contains the Householder vectors the columns of the distributed submatrix sub( a ) containing the meaningful part of the Householder reflectors. l > 0 a (local input/local output) real pointer into the the columns of the distributed submatrix sub( a ) containing the meaningful part of the Householder reflectors the columns of the distributed submatrix sub( a ) containing the meaningful part of the Householder reflectors the factorization is obtained by Householder's method. the kt the (m - k + 1)th row of sub( a ), is given in the form side = 'r'. it contains the local pieces of the distributed vectors v representing the Householder transformation if storev = 'c' and side = 'l', lld_v >= max(1,locr(iv+m-1)); if incx = 1, and locr(ix) otherwise. this array contains the Householder scalars related to the householder vectors storev = 'r'. the distributed matrix v contains the Householder vectors. see further details iv (global input) integer the columns of the distributed submatrix sub( a ) containing the meaningful part of the Householder reflectors to an array of local dimension (locr(iv+k-1),locc(jv+n-1)). the distributed matrix v contains the Householder vectors the columns of the distributed submatrix sub( a ) containing the meaningful part of the Householder reflectors. l > 0 a (local input/local output) complex*16 pointer into the the factorization is obtained by Householder's method. the kt introduce zeros into the (m - k + 1)th row of sub( a ), is given in the columns of the distributed submatrix sub( a ) containing the meaningful part of the Householder reflectors the columns of the distributed submatrix sub( a ) containing the meaningful part of the Householder reflectors slaref applies one or several Householder reflectors of size rows or columns. zlaref applies one or several Householder reflectors of size rows or columns. |
| how how clamsh sends multiple shifts through a small (single node) matrix to see how consecutive small subdiagonal elements are modified b that can be sent through. dlamsh sends multiple shifts through a small (single node) matrix to see how consecutive small subdiagonal elements are modified b that can be sent through. tol=orfac*norm(a) of each other are to be reorthogonalized. however, if the workspace is insufficient (see lwork) reorthogonalized can be stored in one process. tol=orfac*norm(a) of each other are to be reorthogonalized. however, if the workspace is insufficient (see lwork) reorthogonalized can be stored in one process. if we are starting in the middle because of consecutive small subdiagonal elements, we need to see how many bulges w subdiagonal property. direct (global input) character indicates how q is formed from a product of elementar = 'f': q = h(1) h(2) . . . h(k) (forward) storev (global input) character*1 specifies how the vectors which define the elementar = 'c': columnwise direct (global input) character indicates how h is formed from a product of elementar = 'f': h = h(1) h(2) . . . h(k) (forward, not supported yet) storev (global input) character specifies how the vectors which define the elementar = 'c': columnwise (not supported yet) direct (global input) character indicates how q is formed from a product of elementar = 'f': q = h(1) h(2) . . . h(k) (forward) storev (global input) character*1 specifies how the vectors which define the elementar = 'c': columnwise direct (global input) character indicates how h is formed from a product of elementar = 'f': h = h(1) h(2) . . . h(k) (forward, not supported yet) storev (global input) character specifies how the vectors which define the elementar = 'c': columnwise (not supported yet) tol=orfac*norm(a) of each other are to be reorthogonalized. however, if the workspace is insufficient (see lwork) reorthogonalized can be stored in one process. tol=orfac*norm(a) of each other are to be reorthogonalized. however, if the workspace is insufficient (see lwork) reorthogonalized can be stored in one process. direct (global input) character indicates how q is formed from a product of elementar = 'f': q = h(1) h(2) . . . h(k) (forward) storev (global input) character*1 specifies how the vectors which define the elementar = 'c': columnwise direct (global input) character indicates how h is formed from a product of elementar = 'f': h = h(1) h(2) . . . h(k) (forward, not supported yet) storev (global input) character specifies how the vectors which define the elementar = 'c': columnwise (not supported yet) tol=orfac*norm(a) of each other are to be reorthogonalized. however, if the workspace is insufficient (see lwork) reorthogonalized can be stored in one process. tol=orfac*norm(a) of each other are to be reorthogonalized. however, if the workspace is insufficient (see lwork) reorthogonalized can be stored in one process. tol=orfac*norm(a) of each other are to be reorthogonalized. however, if the workspace is insufficient (see lwork) reorthogonalized can be stored in one process. tol=orfac*norm(a) of each other are to be reorthogonalized. however, if the workspace is insufficient (see lwork) reorthogonalized can be stored in one process. if we are starting in the middle because of consecutive small subdiagonal elements, we need to see how many bulges w subdiagonal property. direct (global input) character indicates how q is formed from a product of elementar = 'f': q = h(1) h(2) . . . h(k) (forward) storev (global input) character*1 specifies how the vectors which define the elementar = 'c': columnwise direct (global input) character indicates how h is formed from a product of elementar = 'f': h = h(1) h(2) . . . h(k) (forward, not supported yet) storev (global input) character specifies how the vectors which define the elementar = 'c': columnwise (not supported yet) slamsh sends multiple shifts through a small (single node) matrix to see how consecutive small subdiagonal elements are modified b that can be sent through. zlamsh sends multiple shifts through a small (single node) matrix to see how consecutive small subdiagonal elements are modified b that can be sent through. |
| However However as described below. However, for tridiagonal matrices, since the objects bein have adopted the convention that both the p-by-1 descriptor and as described below. However, for tridiagonal matrices, since the objects bein have adopted the convention that both the p-by-1 descriptor and tol=orfac*norm(a) of each other are to be reorthogonalized. However, if the workspace is insufficient (see lwork) reorthogonalized can be stored in one process. tol=orfac*norm(a) of each other are to be reorthogonalized. However, if the workspace is insufficient (see lwork) reorthogonalized can be stored in one process. liip1 and ltlip1) is subtle. within the current processor column (i.e. mycol .eq. curcol) they are the same. However above the diagonal, on these processors, ltli = lii+1. over the global m to i-1 values is always k1(ki) to k2(ki). However, because there are many bulges, k1(ki) & k2(ki) migh finishing up. even if rotn=1, in order to minimize border as described below. However, for tridiagonal matrices, since the objects bein have adopted the convention that both the p-by-1 descriptor and as described below. However, for tridiagonal matrices, since the objects bein have adopted the convention that both the p-by-1 descriptor and orfac*||t|| of each other are to be orthogonalized. However, if the workspace is insufficient (see lwork), thi orthogonalized can be stored in one process. as described below. However, for tridiagonal matrices, since the objects bein have adopted the convention that both the p-by-1 descriptor and as described below. However, for tridiagonal matrices, since the objects bein have adopted the convention that both the p-by-1 descriptor and over the global m to i-1 values is always k1(ki) to k2(ki). However, because there are many bulges, k1(ki) & k2(ki) migh finishing up. as described below. However, for tridiagonal matrices, since the objects bein have adopted the convention that both the p-by-1 descriptor and as described below. However, for tridiagonal matrices, since the objects bein have adopted the convention that both the p-by-1 descriptor and orfac*||t|| of each other are to be orthogonalized. However, if the workspace is insufficient (see lwork), thi orthogonalized can be stored in one process. tol=orfac*norm(a) of each other are to be reorthogonalized. However, if the workspace is insufficient (see lwork) reorthogonalized can be stored in one process. tol=orfac*norm(a) of each other are to be reorthogonalized. However, if the workspace is insufficient (see lwork) reorthogonalized can be stored in one process. liip1 and ltlip1) is subtle. within the current processor column (i.e. mycol .eq. curcol) they are the same. However above the diagonal, on these processors, ltli = lii+1. on all processors and hence pjlaenv will return the same value to all procesors (i.e. global output). However some on each processor and hence pjlaenv can return different as described below. However, for tridiagonal matrices, since the objects bein have adopted the convention that both the p-by-1 descriptor and as described below. However, for tridiagonal matrices, since the objects bein have adopted the convention that both the p-by-1 descriptor and over the global m to i-1 values is always k1(ki) to k2(ki). However, because there are many bulges, k1(ki) & k2(ki) migh finishing up. as described below. However, for tridiagonal matrices, since the objects bein have adopted the convention that both the p-by-1 descriptor and as described below. However, for tridiagonal matrices, since the objects bein have adopted the convention that both the p-by-1 descriptor and orfac*||t|| of each other are to be orthogonalized. However, if the workspace is insufficient (see lwork), thi orthogonalized can be stored in one process. tol=orfac*norm(a) of each other are to be reorthogonalized. However, if the workspace is insufficient (see lwork) reorthogonalized can be stored in one process. tol=orfac*norm(a) of each other are to be reorthogonalized. However, if the workspace is insufficient (see lwork) reorthogonalized can be stored in one process. liip1 and ltlip1) is subtle. within the current processor column (i.e. mycol .eq. curcol) they are the same. However above the diagonal, on these processors, ltli = lii+1. as described below. However, for tridiagonal matrices, since the objects bein have adopted the convention that both the p-by-1 descriptor and as described below. However, for tridiagonal matrices, since the objects bein have adopted the convention that both the p-by-1 descriptor and tol=orfac*norm(a) of each other are to be reorthogonalized. However, if the workspace is insufficient (see lwork) reorthogonalized can be stored in one process. tol=orfac*norm(a) of each other are to be reorthogonalized. However, if the workspace is insufficient (see lwork) reorthogonalized can be stored in one process. liip1 and ltlip1) is subtle. within the current processor column (i.e. mycol .eq. curcol) they are the same. However above the diagonal, on these processors, ltli = lii+1. over the global m to i-1 values is always k1(ki) to k2(ki). However, because there are many bulges, k1(ki) & k2(ki) migh finishing up. even if rotn=1, in order to minimize border as described below. However, for tridiagonal matrices, since the objects bein have adopted the convention that both the p-by-1 descriptor and as described below. However, for tridiagonal matrices, since the objects bein have adopted the convention that both the p-by-1 descriptor and orfac*||t|| of each other are to be orthogonalized. However, if the workspace is insufficient (see lwork), thi orthogonalized can be stored in one process. |
| HOWMNY HOWMNY HOWMNY (global input) character* = 'b': compute all right and/or left eigenvectors, HOWMNY (global input) character* = 'b': compute all right and/or left eigenvectors, |
| http http (see also lapack working note 132) http://www.netlib.org/lapack/lawns/lawn132.p ===================================================================== (see also lapack working note 132) http://www.netlib.org/lapack/lawns/lawn132.p ===================================================================== (see also lapack working note 132) http://www.netlib.org/lapack/lawns/lawn132.p ===================================================================== (see also lapack working note 132) http://www.netlib.org/lapack/lawns/lawn132.p ===================================================================== (see also lapack working note 132) http://www.netlib.org/lapack/lawns/lawn132.p ===================================================================== (see also lapack working note 132) http://www.netlib.org/lapack/lawns/lawn132.p ===================================================================== |
| HU_i HU_i copy matrix HU_i (the last bwl rows of gu_i) to afl storag since we have gu_i stored, copy matrix HU_i (the last bwl rows of gu_i) to afl storag since we have gu_i stored, copy matrix HU_i (the last bwl rows of gu_i) to afl storag since we have gu_i stored, copy matrix HU_i (the last bwl rows of gu_i) to afl storag since we have gu_i stored, |