|
|
|
@ -125,13 +125,18 @@ void nextu(soli_param *sp) { |
|
|
|
|
|
|
|
unp[j]=(2*(d/h) *(un[j+1]+un[j]+un[j-1])*(un[j+1]-un[j-1]))-(d/((h*h*h))*(un[j+2]-2*un[j+1]+2*un[j-1]-un[j-2]) ) +unm[j]; |
|
|
|
} |
|
|
|
//unm[j]=un[j]; |
|
|
|
//un[j]=unp[j]; |
|
|
|
|
|
|
|
|
|
|
|
} |
|
|
|
for (int j = 0; j < jmax; j++) { |
|
|
|
unm[j]=un[j]; |
|
|
|
un[j]=unp[j]; |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
unm=un; |
|
|
|
un=unp; |
|
|
|
x=sp->xmin; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
} |
|
|
|
@ -151,8 +156,8 @@ void nextu(soli_param *sp) { |
|
|
|
int main(void) { |
|
|
|
soli_param sp; |
|
|
|
sp.N = 1; |
|
|
|
sp.h=0.2; |
|
|
|
sp.d=pow(sp.h,3)/4; |
|
|
|
sp.h=0.1; |
|
|
|
sp.d=0.0001; |
|
|
|
sp.tmax=1; |
|
|
|
sp.tmin=0; |
|
|
|
sp.xmin=-30; |
|
|
|
|