Index: mttroot/mtt/bin/trans/p/mtt_solve_lud.p
==================================================================
--- mttroot/mtt/bin/trans/p/mtt_solve_lud.p
+++ mttroot/mtt/bin/trans/p/mtt_solve_lud.p
@@ -1,21 +1,21 @@
 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 *)
-
 {
 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
@@ -35,10 +35,13 @@
 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);