Array storage

Computational performance data on the Galerkin method were reported by Rachford and Dupont (Rl). Time increments of the order of 5 minutes are typical. According to these authors an average of 120 pipe steps per CPU second on a CDC 6600 computer was achieved. Approximately 100 words of storage per pipe were required for array storage and 12,000 words of storage for the program and subroutines. On that basis the authors estimated that a 1000-pipe network can be simulated on a full-size CDC 6600 computer at about 100 CPU seconds per simulated hour. 

The major array storage requirements for the GNVP calculations are listed below along with their sizes. The arrays are listed in the order they occur in the calculation, as discussed in Sect. 2.2. Only arrays in blank common in link 10 or in labeled common affect the memory requirements, and only these are considered. 

Computationally, this roughly doubles the array storage requirements relative to the traditional explicit method (all need to be stored) and also roughly the computing time. Fig. 5.2 shows the central loop, corresponding to that in Fig. 3.10, converted to the second-order RKI scheme. The variables A are given the symbol DELTA and their declarations are included. 

The term moving is applied because the filter software maintains a storage array with the previous n values of the input. When a new value is received, the oldest value in the storage array is replaced with... 

---