The following finds a solution to g(x) = 0 given  3 initial approximation  
p0, using the Muller's method.  This WILL find complex roots!                   
                                                                                
      'G' - this variable must contain the funtion to be evaluated              
            e.g. 'X^2-2*X+4'                                                    
                                                                                
   stack levels:  5: initial approximation 1                                    
                  4: initial approximation 2                                    
                  3: initial approximation 3                                    
                  2: tolerance                                                  
                  1: maximum number of iterations                               
                                                                                
                                                                                
     At each halt of the program a list containing                              
       - iteration step                                                         
       - error limit for this guess                                             
       - current solution                                                       
       - current value of g(x) at current solution                              
                                                                                
Simply press CONT to go on to next iteration step.                              
********************************************************************            
*       J.J.        *             JJL101@psuvm.bitnet              *            
*                   *    Penn State Center for Academic Computing  *            
*    John Lehett    *          Computational Mathematics           *            
********************************************************************