Back| Q- |
| QBUF QBUF QBUF (workspace) double precision array, dimension 3* ctot (workspace) integer array, dimension( npcol, 4) QBUF (workspace) double precision array, dimension 3* QBUF (workspace) real array, dimension 3* ctot (workspace) integer array, dimension( npcol, 4) QBUF (workspace) real array, dimension 3* |
| QLN QLN max(wcbdsqr, max(wantu*wpcormbrQLN, wantvt*wpcormbrprt)) where max(wdbdsqr, max(wantu*wpdormbrQLN, wantvt*wpdormbrprt)) where max(wsbdsqr, max(wantu*wpsormbrQLN, wantvt*wpsormbrprt)) where max(wzbdsqr, max(wantu*wpzormbrQLN, wantvt*wpzormbrprt)) where |
| QRMEM QRMEM QRMEM = 2*n- QRMEM = 2*n- |
| quality quality of the largest entry in (x(j) - xtrue) divided by the magnitude of the largest entry in x(j). the quality o norm(inv(a)) computed in the code; if the estimate of of the largest entry in (x(j) - xtrue) divided by the magnitude of the largest entry in x(j). the quality o norm(inv(a)) computed in the code; if the estimate of of the largest entry in (x(j) - xtrue) divided by the magnitude of the largest entry in x(j). the quality o norm(inv(a)) computed in the code; if the estimate of of the largest entry in (x(j) - xtrue) divided by the magnitude of the largest entry in x(j). the quality o norm(inv(a)) computed in the code; if the estimate of |
| quantities quantities locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locq( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locq( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locq( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locq( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locq( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locq( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locq( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locq( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a locc( n ) = numroc( n, nb_a, mycol, csrc_a, npcol ). an upper bound for these quantities may be computed by locc( n ) <= ceil( ceil(n/nb_a)/npcol )*nb_a |
| query query if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu as the first element of work and no error message is issued if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, the lwork is global input and a workspace query is assumed; the routine only calculates the minimu as the first element of work and no error message is issued if lwork = -1, then lwork is global input and a workspace query is assumed; the routine calculates the size for al entry of the corresponding work array, and no error message if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates th values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the optima in the first entry of the correspondingwork array, and no if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates th values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu as the first element of work and no error message is issued if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, the lwork is global input and a workspace query is assumed; the routine only calculates the minimu as the first element of work and no error message is issued if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, the lwork is global input and a workspace query is assumed; the routine only calculates the minimu as the first element of work and no error message is issued if lwork = -1, the lwork is global input and a workspace query is assumed; the routine only calculates the minimu as the first element of work and no error message is issued if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the siz these values is returned in the first entry of the if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the siz each of these values is returned in the first entry of the if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates th values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu as the first element of work and no error message is issued if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, the lwork is global input and a workspace query is assumed; the routine only calculates the minimu as the first element of work and no error message is issued if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, the lwork is global input and a workspace query is assumed; the routine only calculates the minimu as the first element of work and no error message is issued if lwork = -1, the lwork is global input and a workspace query is assumed; the routine only calculates the minimu as the first element of work and no error message is issued if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the siz these values is returned in the first entry of the if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the siz each of these values is returned in the first entry of the if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates th values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu as the first element of work and no error message is issued if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, the lwork is global input and a workspace query is assumed; the routine only calculates the minimu as the first element of work and no error message is issued if lwork = -1, then lwork is global input and a workspace query is assumed; the routine calculates the size for al entry of the corresponding work array, and no error message if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates th values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the optima in the first entry of the correspondingwork array, and no if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates th values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding if lwork = -1, then lwork is global input and a workspace query is assumed; the routine only calculates the minimu values is returned in the first entry of the corresponding |
| Quick Quick Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl Quick return if possibl |
| quit quit more than mmax intervals are generated, then pdlaebz will quit with info = mmax+1 minp (input) integer more than mmax intervals are generated, then pslaebz will quit with info = mmax+1 minp (input) integer |