1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
|
PROCEDURE mtt_solve_lud(VAR x : StateVector;
A : StateMatrix;
B : StateVector;
n : integer);
(*$I $MTTPATH/trans/p/mtt_ludcmp.p *)
(*$I $MTTPATH/trans/p/mtt_lubksb.p *)
|
<
<
<
>
>
>
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
|
PROCEDURE mtt_solve_lud(VAR x : StateVector;
A : StateMatrix;
B : StateVector;
n : integer);
{
Linear equation solution via LU factorisation
% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% % Version control history
% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% % $Id$
% % $Log$
% % Revision 1.3 1999/10/26 23:37:20 peterg
% % Put include files here.
% %
% % Revision 1.2 1998/08/17 15:56:10 peterg
% % Uses LU decomposition - much faster than SVD when N>100
% %
% % Revision 1.1 1998/08/17 12:52:16 peterg
% % Initial revision
% %
% % Revision 1.1 1998/08/17 12:41:37 peterg
|
33
34
35
36
37
38
39
40
41
42
43
44
45
46
|
}
VAR
i : integer;
d : real;
Index : StateVector;
BEGIN{mtt_solve_lud}
(* decompose matrix A using LU decomposition *)
mtt_ludcmp(A,n,Index,d);
(* backsubstitute for B *)
mtt_lubksb(A,n,Index,B);
|
>
>
>
|
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
|
}
VAR
i : integer;
d : real;
Index : StateVector;
(*$I $MTTPATH/trans/p/mtt_ludcmp.p *)
(*$I $MTTPATH/trans/p/mtt_lubksb.p *)
BEGIN{mtt_solve_lud}
(* decompose matrix A using LU decomposition *)
mtt_ludcmp(A,n,Index,d);
(* backsubstitute for B *)
mtt_lubksb(A,n,Index,B);
|