variables needed to evaluate the flux terms. Consequently, the U-vector nmst be decomposed into other variables, leaving the (:-vector itself disposable. Both Williamson (2N) and vdH (2R) schemes may be easily generalized I() accommodate more than two storage registers (N or R). We make no claim that these two strategies are the only viable ones. We do suggest, however, that the vdH methodology is extremely aggressive in its conservation of computer memory usage. In t.he pursui! of computer memory use reduction, the first, casualty is the retention of the U-vector at. the beginning stage. Error control, in the more traditional sense, becomes impossible. A rejected step (such as violation of the error tolerance) cannot be restarted front U (') because with a 2N or 2t1 scheme, U (') is no tongrr available. Instead, alloting one additional register for an error estimate, one may monitor the error nlathematical soft.ware.J18, 28, 29, 58, 88] Attempts were made to solve for schemes symbolically, but il was found that the assumption of various a O = bj quickly made matters intractable because the equations of condition become algebraically nonlinear in the bi's. Scheme coefficients are given to at. lea,st 2,5 digils of accuracy. Some Ell.I{ background is necessary to facilitate a discussion on the optimization of accuracy efficiency, stability efficiency, error control reliability, step-control stability, linear stability, nonlinear stability, and dispersion and dissipation error within the context, of storage reduction in later chapters. This will be done in sections 1 and 2. Two-register schemes will be reviewed in section 3 while three-, four-, and five-register schemes will be considered in sections 4, .5, and 6. Merits of the low-storage schemes are discussed in section P (mininmm phase error), and for "P" melhods, qdisp and qdis_ are the respective dispersion and dissipation orders of accuracy.