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
|
{
###############################################################
## Version control history
###############################################################
## $Id$
## $Log$
## Revision 1.4 1998/08/14 10:54:58 peterg
## Use sparse computation where possible
##
###############################################################
}
CONST
Small = 0.000001;
VAR
i,j : INTEGER;
BB : StateVector;
DDT : REAL;
(*$I mtt_solve.p *)
(*$I mtt_sparse.p *)
BEGIN{mtt_update}
IF Method=1 THEN {Euler}
BEGIN{Euler}
DDT := DT/STEPFACTOR;
FOR i := 1 TO Nx DO
xnew[i] := xnew[i] + dx[i]*DDT;
END {Euler}
ELSE IF (Method=2) OR (METHOD=3) OR (METHOD=4) THEN {Implicit}
BEGIN {Implicit methods}
FOR i := 1 TO Nx DO {BB is (1-A*dt)*x +dx*dt}
BB[i] := AAx[i] + DT*dx[i];
{Solve the equation AAx = B}
IF (Method=2) OR (METHOD=3) THEN {Use SVD}
mtt_solve(xnew,AA,BB,Nx,Small)
ELSE {Sparse CG solution}
mtt_sparse(BB,Nx,STEPFACTOR,xnew);
END{Implicit methods}
ELSE
Writeln("Method >4 is not defined");
END{mtt_update};
|
>
>
>
|
|
|
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
|
{
###############################################################
## Version control history
###############################################################
## $Id$
## $Log$
## Revision 1.5 1998/08/15 13:48:35 peterg
## New update methods
##
## Revision 1.4 1998/08/14 10:54:58 peterg
## Use sparse computation where possible
##
###############################################################
}
CONST
Small = 0.000001;
VAR
i,j : INTEGER;
BB : StateVector;
DDT : REAL;
(*$I mtt_solve_lud.p *)
(*$I mtt_sparse.p *)
BEGIN{mtt_update}
IF Method=1 THEN {Euler}
BEGIN{Euler}
DDT := DT/STEPFACTOR;
FOR i := 1 TO Nx DO
xnew[i] := xnew[i] + dx[i]*DDT;
END {Euler}
ELSE IF (Method=2) OR (METHOD=3) OR (METHOD=4) THEN {Implicit}
BEGIN {Implicit methods}
FOR i := 1 TO Nx DO {BB is (1-A*dt)*x +dx*dt}
BB[i] := AAx[i] + DT*dx[i];
{Solve the equation AAx = B}
IF (Method=2) OR (METHOD=3) THEN {Use SVD}
mtt_solve_lud(xnew,AA,BB,Nx)
ELSE {Sparse CG solution}
mtt_sparse(BB,Nx,STEPFACTOR,xnew);
END{Implicit methods}
ELSE
Writeln("Method >4 is not defined");
END{mtt_update};
|