Index: mttroot/mtt/bin/trans/p/mtt_update.p
==================================================================
--- mttroot/mtt/bin/trans/p/mtt_update.p
+++ mttroot/mtt/bin/trans/p/mtt_update.p
@@ -10,10 +10,13 @@
  ###############################################################
 ## 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
 ##
 ###############################################################
 }
@@ -24,11 +27,11 @@
 VAR
    i,j : INTEGER;
    BB  : StateVector;
    DDT : REAL;
    
-(*$I mtt_solve.p *)
+(*$I mtt_solve_lud.p *)
 (*$I mtt_sparse.p *)
    
 BEGIN{mtt_update}
    
    IF Method=1 THEN {Euler}
@@ -43,11 +46,11 @@
 	 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)
+	    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");