BASKER_INLINE
int Basker<Int,Entry, Exe_Space>::mc64(BASKER_MATRIX &M,
Int _job, INT_1DARRAY _perm)
{
//Note using primative types to match fortran
#ifdef BASKER_MC64
#else
typedef Int int_t;
#endif
//typedef int int_t;
typedef double entry_t;
int_t i, liw, ldw, num;
int_t *iw, icntl[10], info[10];
int_t job = _job;
entry_t *dw;
entry_t *nzval_abs;
int_t n = M.nrow;
int_t nnz = M.nnz;
nzval_abs = (entry_t*)malloc(M.nnz*sizeof(entry_t));
//nzval_abs = (entry_t*)malloc(A.nnz*sizeof(entry_t));
liw = 5*n;
if(job == 3)
{liw = 10*M.nrow + M.nnz;}
//{liw = 10*A.nrow + A.nnz;}
iw = (int_t*) malloc(liw*sizeof(int_t));
ldw = 3*n+nnz;
dw = (entry_t*) malloc(ldw*sizeof(entry_t));
//Convert to 1 formatting
for(Int i = 0; i <= M.nrow; ++i)
M.col_ptr[i] = M.col_ptr[i]+1;
for(Int i = 0; i < M.nnz; ++i)
M.row_idx[i] = M.row_idx[i]+1;
//for(Int i = 0; i <= A.nrow; ++i)
// A.col_ptr[i] = A.col_ptr[i]+1;
//for(Int i = 0; i< A.nnz; ++i)
// A.row_idx[i] = A.row_idx[i]+1;
//call init
#ifdef BASKER_MC64
mc64id_(icntl);
#endif
for(Int i = 0; i < M.nnz; ++i)
nzval_abs[i] = abs(M.val[i]);
//for(Int i = 0; i < A.nnz; ++i)
// nzval_abs[i] = abs(A.val[i]);
Int* colptr = &(M.col_ptr[0]);
Int* rowidx = &(M.row_idx[0]);
Entry* val = &(M.val[0]);
//Int* colptr = &(A.col_ptr[0]);
//Int* rowidx = &(A.row_idx[0]);
//Entry* val = &(A.val[0]);
Int *perm;
perm = (Int*) malloc(M.nrow*sizeof(Int));
//perm = (Int*) malloc(A.nrow*sizeof(Int));
#ifdef BASKER_MC64
mc64ad_(&job, &n, &nnz, colptr, rowidx, nzval_abs,
&num, perm,
&liw, iw, &ldw, dw, icntl, info);
#endif
//debug
//convert indexing back
for(Int i=0; i <= M.nrow; ++i)
M.col_ptr[i] = M.col_ptr[i]-1;
for(Int i=0; i < M.nnz; ++i)
M.row_idx[i] = M.row_idx[i]-1;
for(Int i=0; i < M.nrow; ++i)
_perm[i] = perm[i] -1;
//for(Int i =0; i <=A.nrow; ++i)
// A.col_ptr[i] = A.col_ptr[i]-1;
//for(Int i =0; i < A.nnz; ++i)
// A.row_idx[i] = A.row_idx[i]-1;
//for(Int i =0; i < A.nrow; ++i)
//_perm[i] = perm[i] -1;
//add job 5 special
free(iw);
free(dw);
free(nzval_abs);
return 0;
}//end mc64
int
zldperm(int_t job, int_t n, int_t nnz, int_t colptr[], int_t adjncy[],
doublecomplex nzval[], int_t *perm, double u[], double v[])
{
int_t i, liw, ldw, num;
int_t *iw, icntl[10], info[10];
double *dw;
double *nzval_d = (double *) SUPERLU_MALLOC(nnz * sizeof(double));
#if ( DEBUGlevel>=1 )
CHECK_MALLOC(0, "Enter zldperm()");
#endif
liw = 5*n;
if ( job == 3 ) liw = 10*n + nnz;
if ( !(iw = intMalloc(liw)) ) ABORT("Malloc fails for iw[]");
ldw = 3*n + nnz;
if ( !(dw = (double*) SUPERLU_MALLOC(ldw * sizeof(double))) )
ABORT("Malloc fails for dw[]");
/* Increment one to get 1-based indexing. */
for (i = 0; i <= n; ++i) ++colptr[i];
for (i = 0; i < nnz; ++i) ++adjncy[i];
#if ( DEBUGlevel>=2 )
printf("LDPERM(): n %d, nnz %d\n", n, nnz);
slu_PrintInt10("colptr", n+1, colptr);
slu_PrintInt10("adjncy", nnz, adjncy);
#endif
/*
* NOTE:
* =====
*
* MC64AD assumes that column permutation vector is defined as:
* perm(i) = j means column i of permuted A is in column j of original A.
*
* Since a symmetric permutation preserves the diagonal entries. Then
* by the following relation:
* P'(A*P')P = P'A
* we can apply inverse(perm) to rows of A to get large diagonal entries.
* But, since 'perm' defined in MC64AD happens to be the reverse of
* SuperLU's definition of permutation vector, therefore, it is already
* an inverse for our purpose. We will thus use it directly.
*
*/
mc64id_(icntl);
#if 0
/* Suppress error and warning messages. */
icntl[0] = -1;
icntl[1] = -1;
#endif
for (i = 0; i < nnz; ++i) nzval_d[i] = z_abs1(&nzval[i]);
mc64ad_(&job, &n, &nnz, colptr, adjncy, nzval_d, &num, perm,
&liw, iw, &ldw, dw, icntl, info);
#if ( DEBUGlevel>=2 )
slu_PrintInt10("perm", n, perm);
printf(".. After MC64AD info %d\tsize of matching %d\n", info[0], num);
#endif
if ( info[0] == 1 ) { /* Structurally singular */
printf(".. The last %d permutations:\n", n-num);
slu_PrintInt10("perm", n-num, &perm[num]);
}
/* Restore to 0-based indexing. */
for (i = 0; i <= n; ++i) --colptr[i];
for (i = 0; i < nnz; ++i) --adjncy[i];
for (i = 0; i < n; ++i) --perm[i];
if ( job == 5 )
for (i = 0; i < n; ++i) {
u[i] = dw[i];
v[i] = dw[n+i];
}
SUPERLU_FREE(iw);
SUPERLU_FREE(dw);
SUPERLU_FREE(nzval_d);
#if ( DEBUGlevel>=1 )
CHECK_MALLOC(0, "Exit zldperm()");
#endif
return info[0];
}
void
zldperm(int_t job, int_t n, int_t nnz, int_t colptr[], int_t adjncy[],
doublecomplex nzval[], int_t *perm, double u[], double v[])
{
/*
* Purpose
* =======
*
* ZLDPERM finds a row permutation so that the matrix has large
* entries on the diagonal.
*
* Arguments
* =========
*
* job (input) int
* Control the action. Possible values for JOB are:
* = 1 : Compute a row permutation of the matrix so that the
* permuted matrix has as many entries on its diagonal as
* possible. The values on the diagonal are of arbitrary size.
* HSL subroutine MC21A/AD is used for this.
* = 2 : Compute a row permutation of the matrix so that the smallest
* value on the diagonal of the permuted matrix is maximized.
* = 3 : Compute a row permutation of the matrix so that the smallest
* value on the diagonal of the permuted matrix is maximized.
* The algorithm differs from the one used for JOB = 2 and may
* have quite a different performance.
* = 4 : Compute a row permutation of the matrix so that the sum
* of the diagonal entries of the permuted matrix is maximized.
* = 5 : Compute a row permutation of the matrix so that the product
* of the diagonal entries of the permuted matrix is maximized
* and vectors to scale the matrix so that the nonzero diagonal
* entries of the permuted matrix are one in absolute value and
* all the off-diagonal entries are less than or equal to one in
* absolute value.
* Restriction: 1 <= JOB <= 5.
*
* n (input) int
* The order of the matrix.
*
* nnz (input) int
* The number of nonzeros in the matrix.
*
* adjncy (input) int*, of size nnz
* The adjacency structure of the matrix, which contains the row
* indices of the nonzeros.
*
* colptr (input) int*, of size n+1
* The pointers to the beginning of each column in ADJNCY.
*
* nzval (input) doublecomplex*, of size nnz
* The nonzero values of the matrix. nzval[k] is the value of
* the entry corresponding to adjncy[k].
* It is not used if job = 1.
*
* perm (output) int*, of size n
* The permutation vector. perm[i] = j means row i in the
* original matrix is in row j of the permuted matrix.
*
* u (output) double*, of size n
* If job = 5, the natural logarithms of the row scaling factors.
*
* v (output) double*, of size n
* If job = 5, the natural logarithms of the column scaling factors.
* The scaled matrix B has entries b_ij = a_ij * exp(u_i + v_j).
*/
int_t i, liw, ldw, num;
int_t *iw, icntl[10], info[10];
double *dw;
double *nzval_abs = doubleMalloc_dist(nnz);
#if ( DEBUGlevel>=1 )
CHECK_MALLOC(0, "Enter zldperm()");
#endif
liw = 5*n;
if ( job == 3 ) liw = 10*n + nnz;
if ( !(iw = intMalloc_dist(liw)) ) ABORT("Malloc fails for iw[]");
ldw = 3*n + nnz;
if ( !(dw = doubleMalloc_dist(ldw)) ) ABORT("Malloc fails for dw[]");
/* Increment one to get 1-based indexing. */
for (i = 0; i <= n; ++i) ++colptr[i];
for (i = 0; i < nnz; ++i) ++adjncy[i];
#if ( DEBUGlevel>=2 )
printf("LDPERM(): n %d, nnz %d\n", n, nnz);
PrintInt10("colptr", n+1, colptr);
PrintInt10("adjncy", nnz, adjncy);
#endif
/*
* NOTE:
* =====
*
* MC64AD assumes that column permutation vector is defined as:
* perm(i) = j means column i of permuted A is in column j of original A.
*
* Since a symmetric permutation preserves the diagonal entries. Then
* by the following relation:
* P'(A*P')P = P'A
* we can apply inverse(perm) to rows of A to get large diagonal entries.
* But, since 'perm' defined in MC64AD happens to be the reverse of
* SuperLU's definition of permutation vector, therefore, it is already
* an inverse for our purpose. We will thus use it directly.
*
*/
mc64id_(icntl);
#if 0
/* Suppress error and warning messages. */
icntl[0] = -1;
icntl[1] = -1;
#endif
for (i = 0; i < nnz; ++i) nzval_abs[i] = z_abs1(&nzval[i]);
mc64ad_(&job, &n, &nnz, colptr, adjncy, nzval_abs, &num, perm,
&liw, iw, &ldw, dw, icntl, info);
#if ( DEBUGlevel>=2 )
PrintInt10("perm", n, perm);
printf(".. After MC64AD info %d\tsize of matching %d\n", info[0], num);
#endif
if ( info[0] == 1 ) { /* Structurally singular */
printf(".. The last %d permutations:\n", n-num);
PrintInt10("perm", n-num, &perm[num]);
}
/* Restore to 0-based indexing. */
for (i = 0; i <= n; ++i) --colptr[i];
for (i = 0; i < nnz; ++i) --adjncy[i];
for (i = 0; i < n; ++i) --perm[i];
if ( job == 5 )
for (i = 0; i < n; ++i) {
u[i] = dw[i];
v[i] = dw[n+i];
}
SUPERLU_FREE(iw);
SUPERLU_FREE(dw);
SUPERLU_FREE(nzval_abs);
#if ( DEBUGlevel>=1 )
CHECK_MALLOC(0, "Exit zldperm()");
#endif
}