Goal: Establish recursion formulas which will be used to derive
====  determining equaitons for palindromic schemes of orders
      up to 12.

                           Ren-Cang Li, June 1, 1996
                           na.rcli@na-net.ornl.gov    *)

Files in this directory:
=======================

  Mathematica Codes:
  ----------------

     Driver        ---   the driver routine to generate coefficient 
                         formulas. It calls expXexpYexpX, CompCoeff, and 
                         DumpCoeff, in order.

     CompCoeff     ---   computational engine,
                         Called by Driver and Calls DefFun.

     DefFun        ---   Define basis brackets,
                         Called by CompCoeff.

     DumpCoeff     ---   Dump coefficient formulas,
                         Called by Driver.

     expXexpYexpX  ---   BCH Formula,
                         Called by Driver.

     TestCoeff     ---   Testing the correctness of the computed 
                         coefficient formulas in Coeff (or Coeffp)
                         obtained by running Driver.

  Output:
  ------

     Coeff         ---   coefficient formulas
     Coeffp        ---   coefficient formulas arranged differently.

To Run:    In Mathematica, type <<Driver
======

To Check:  In Mathematica, type <<TestCoeff
========

Warning:   Be prepared to wait for hours (or days), 
=======    especially when running TestCoeff.
