| 1 |
#include "mshmet.h" |
| 2 |
|
| 3 |
#define lambda 0.04 |
| 4 |
#define mu 0.03 |
| 5 |
|
| 6 |
|
| 7 |
int lissag_3d(pMesh mesh,pSol sol,int is,int it) { |
| 8 |
pPoint p0,p1; |
| 9 |
pTetra pt; |
| 10 |
double *nu,u,v; |
| 11 |
int i,j,k,iadr,nsdep,ip1,nb,list[LONMAX+2],ilist; |
| 12 |
|
| 13 |
nu = calloc(mesh->np+1,sizeof(double)); |
| 14 |
assert(nu); |
| 15 |
|
| 16 |
for (j=1; j<=it; j++) { |
| 17 |
|
| 18 |
/* 1st stage: new value */ |
| 19 |
for (k=1; k<=mesh->np; k++) { |
| 20 |
p0 = &mesh->point[k]; |
| 21 |
nsdep = p0->s; |
| 22 |
assert(nsdep); |
| 23 |
|
| 24 |
pt = &mesh->tetra[nsdep]; |
| 25 |
i = 0; |
| 26 |
if ( pt->v[1] == k ) i = 1; |
| 27 |
else if ( pt->v[2] == k ) i = 2; |
| 28 |
else if ( pt->v[3] == k ) i = 3; |
| 29 |
|
| 30 |
ilist = boulep(mesh,nsdep,i,list); |
| 31 |
u = getSol(sol,k,is); |
| 32 |
v = 0.0; |
| 33 |
nb = 0; |
| 34 |
|
| 35 |
for (i=1; i<=ilist; i++) { |
| 36 |
ip1 = list[i]; |
| 37 |
p1 = &mesh->point[ip1]; |
| 38 |
v += getSol(sol,ip1,is); |
| 39 |
nb++; |
| 40 |
} |
| 41 |
v = v / nb; |
| 42 |
nu[k] = u + lambda*(v-u); |
| 43 |
} |
| 44 |
|
| 45 |
/* 2nd stage: update value */ |
| 46 |
for (k=1; k<=mesh->np; k++) { |
| 47 |
p0 = &mesh->point[k]; |
| 48 |
nsdep = p0->s; |
| 49 |
|
| 50 |
pt = &mesh->tetra[nsdep]; |
| 51 |
i = 0; |
| 52 |
if ( pt->v[1] == k ) i = 1; |
| 53 |
else if ( pt->v[2] == k ) i = 2; |
| 54 |
else if ( pt->v[3] == k ) i = 3; |
| 55 |
|
| 56 |
ilist = boulep(mesh,nsdep,i,list); |
| 57 |
u = nu[k]; |
| 58 |
v = 0.0; |
| 59 |
nb = 0; |
| 60 |
for (i=1; i<=ilist; i++) { |
| 61 |
ip1 = list[i]; |
| 62 |
p1 = &mesh->point[ip1]; |
| 63 |
v += nu[ip1]; |
| 64 |
nb++; |
| 65 |
} |
| 66 |
v = v / nb; |
| 67 |
|
| 68 |
iadr = (k-1)*sol->size + is+1; |
| 69 |
sol->sol[iadr] = u - mu*(u-v); |
| 70 |
} |
| 71 |
|
| 72 |
if ( j < it ) memset(nu,0,(mesh->np+1)*sizeof(double)); |
| 73 |
} |
| 74 |
|
| 75 |
free(nu); |
| 76 |
return(1); |
| 77 |
} |
| 78 |
|
| 79 |
|
| 80 |
/* regularisation of sol is */ |
| 81 |
int lissag_2d(pMesh mesh,pSol sol,int is,int it) { |
| 82 |
pPoint p0,p1; |
| 83 |
pTria pt; |
| 84 |
double *nu,u,v; |
| 85 |
int i,j,k,iadr,nsdep,ip1,nb,list[LONMAX+2],ilist; |
| 86 |
|
| 87 |
nu = calloc(mesh->np+1,sizeof(double)); |
| 88 |
assert(nu); |
| 89 |
|
| 90 |
for (j=1; j<=it; j++) { |
| 91 |
|
| 92 |
/* 1st stage: new value */ |
| 93 |
for (k=1; k<=mesh->np; k++) { |
| 94 |
p0 = &mesh->point[k]; |
| 95 |
nsdep = p0->s; |
| 96 |
assert(nsdep); |
| 97 |
|
| 98 |
pt = &mesh->tria[nsdep]; |
| 99 |
i = 0; |
| 100 |
if ( pt->v[1] == k ) i = 1; |
| 101 |
else if ( pt->v[2] == k ) i = 2; |
| 102 |
|
| 103 |
ilist = boulep(mesh,nsdep,i,list); |
| 104 |
if ( ilist < 1 ) return(0); |
| 105 |
u = getSol(sol,k,is); |
| 106 |
v = 0.0; |
| 107 |
nb = 0; |
| 108 |
|
| 109 |
for (i=1; i<=ilist; i++) { |
| 110 |
ip1 = list[i]; |
| 111 |
p1 = &mesh->point[ip1]; |
| 112 |
v += getSol(sol,ip1,is); |
| 113 |
nb++; |
| 114 |
} |
| 115 |
|
| 116 |
v = v / nb; |
| 117 |
nu[k] = u + lambda*(v-u); |
| 118 |
} |
| 119 |
|
| 120 |
/* 2nd stage: update value */ |
| 121 |
for (k=1; k<=mesh->np; k++) { |
| 122 |
p0 = &mesh->point[k]; |
| 123 |
nsdep = p0->s; |
| 124 |
|
| 125 |
pt = &mesh->tria[nsdep]; |
| 126 |
i = 0; |
| 127 |
if ( pt->v[1] == k ) i = 1; |
| 128 |
else if ( pt->v[2] == k ) i = 2; |
| 129 |
|
| 130 |
ilist = boulep(mesh,nsdep,i,list); |
| 131 |
if ( ilist < 1 ) return(0); |
| 132 |
u = nu[k]; |
| 133 |
v = 0.0; |
| 134 |
nb = 0; |
| 135 |
for (i=1; i<=ilist; i++) { |
| 136 |
ip1 = list[i]; |
| 137 |
p1 = &mesh->point[ip1]; |
| 138 |
v += nu[ip1]; |
| 139 |
nb++; |
| 140 |
} |
| 141 |
v = v / nb; |
| 142 |
|
| 143 |
iadr = (k-1)*sol->size + is+1; |
| 144 |
sol->sol[iadr] = u - mu*(u-v); |
| 145 |
} |
| 146 |
|
| 147 |
if ( j < it ) memset(nu,0,(mesh->np+1)*sizeof(double)); |
| 148 |
} |
| 149 |
|
| 150 |
free(nu); |
| 151 |
return(1); |
| 152 |
} |
| 153 |
|