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,18 +1,24 @@
 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.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
 % % Initial revision
@@ -29,14 +35,12 @@
 VAR
    i	 : integer;
    d	 : real;
    Index : StateVector;
 
-(*$I mtt_ludcmp.p *)
-(*$I mtt_lubksb.p *)
 
-BEGIN{mtt_solve}
+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);
@@ -43,12 +47,12 @@
 
    (* x now lives in B *)
    FOR i := 1 TO n DO
       x[i] := B[i];
    
-END{mtt_solve};
+END{mtt_solve_lud};