1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133
|
/*! @file zdiagonal.c
* \brief Auxiliary routines to work with diagonal elements
*
* <pre>
* -- SuperLU routine (version 4.0) --
* Lawrence Berkeley National Laboratory
* June 30, 2009
* </pre>
*/
#include "slu_zdefs.h"
int zfill_diag(int n, NCformat *Astore)
/* fill explicit zeros on the diagonal entries, so that the matrix is not
structurally singular. */
{
doublecomplex *nzval = (doublecomplex *)Astore->nzval;
int *rowind = Astore->rowind;
int *colptr = Astore->colptr;
int nnz = colptr[n];
int fill = 0;
doublecomplex *nzval_new;
doublecomplex zero = {1.0, 0.0};
int *rowind_new;
int i, j, diag;
for (i = 0; i < n; i++)
{
diag = -1;
for (j = colptr[i]; j < colptr[i + 1]; j++)
if (rowind[j] == i) diag = j;
if (diag < 0) fill++;
}
if (fill)
{
nzval_new = doublecomplexMalloc(nnz + fill);
rowind_new = intMalloc(nnz + fill);
fill = 0;
for (i = 0; i < n; i++)
{
diag = -1;
for (j = colptr[i] - fill; j < colptr[i + 1]; j++)
{
if ((rowind_new[j + fill] = rowind[j]) == i) diag = j;
nzval_new[j + fill] = nzval[j];
}
if (diag < 0)
{
rowind_new[colptr[i + 1] + fill] = i;
nzval_new[colptr[i + 1] + fill] = zero;
fill++;
}
colptr[i + 1] += fill;
}
Astore->nzval = nzval_new;
Astore->rowind = rowind_new;
SUPERLU_FREE(nzval);
SUPERLU_FREE(rowind);
}
Astore->nnz += fill;
return fill;
}
int zdominate(int n, NCformat *Astore)
/* make the matrix diagonally dominant */
{
doublecomplex *nzval = (doublecomplex *)Astore->nzval;
int *rowind = Astore->rowind;
int *colptr = Astore->colptr;
int nnz = colptr[n];
int fill = 0;
doublecomplex *nzval_new;
int *rowind_new;
int i, j, diag;
double s;
for (i = 0; i < n; i++)
{
diag = -1;
for (j = colptr[i]; j < colptr[i + 1]; j++)
if (rowind[j] == i) diag = j;
if (diag < 0) fill++;
}
if (fill)
{
nzval_new = doublecomplexMalloc(nnz + fill);
rowind_new = intMalloc(nnz+ fill);
fill = 0;
for (i = 0; i < n; i++)
{
s = 1e-6;
diag = -1;
for (j = colptr[i] - fill; j < colptr[i + 1]; j++)
{
if ((rowind_new[j + fill] = rowind[j]) == i) diag = j;
nzval_new[j + fill] = nzval[j];
s += z_abs1(&nzval_new[j + fill]);
}
if (diag >= 0) {
nzval_new[diag+fill].r = s * 3.0;
nzval_new[diag+fill].i = 0.0;
} else {
rowind_new[colptr[i + 1] + fill] = i;
nzval_new[colptr[i + 1] + fill].r = s * 3.0;
nzval_new[colptr[i + 1] + fill].i = 0.0;
fill++;
}
colptr[i + 1] += fill;
}
Astore->nzval = nzval_new;
Astore->rowind = rowind_new;
SUPERLU_FREE(nzval);
SUPERLU_FREE(rowind);
}
else
{
for (i = 0; i < n; i++)
{
s = 1e-6;
diag = -1;
for (j = colptr[i]; j < colptr[i + 1]; j++)
{
if (rowind[j] == i) diag = j;
s += z_abs1(&nzval[j]);
}
nzval[diag].r = s * 3.0;
nzval[diag].i = 0.0;
}
}
Astore->nnz += fill;
return fill;
}
|