SJADSM/DJADSM/CJADSM/ZJADSM | Jagged diagonal format triangular solve |
val( ) | Array of length nnz (the total number of nonzero |
| entries in A) containing the jagged diagonals of the |
| |
| |
| of nonzero entries in each row is decreasing.) The first |
| jagged diagonal consists of the first nonzero entry of |
| each row, and it is stored first in val(*); the second |
| jagged diagonal consists of the second nonzero entry of |
| each row, and it is stored second in val(*); and so on. |
indx( ) | Array of length nnz consisting of the column indices of |
| the corresponding entries in val. |
pntr( ) | Array of length maxnz+1, such that pntr(i) and |
| |
| the first and last entries of the |
| the |
iperm( ) | Array of length m such that i=iperm(j) indicates that |
| row j of the |
| corresponds to row i of the original matrix A. If there is |
| no permutation at all, let iperm(1) be a negative |
| number (usually |
maxnz | Max number of nonzero elements per row. |
b( ) | Rectangular array with leading dimension ldb. |
ldb | Leading dimension of b. |
beta | Scalar parameter. |
c( ) | Rectangular arrary with leading dimension ldc. |
ldc | Leading dimension of c. |
work( ) | Scratch array of length lwork. lwork should be at least |
| mb x lb x min(lb, n). |
lwork | Length of work array. |
520HP MLIB User’s Guide