Successive approximations and computer storage problems in ordinary differential equations

E = 2-4-). (6) Two of the assumptions used here are usually violated to some extent in practice. It was assumed that items are addressed equally often and that the key transformation yields truly random numbers. Performance can be adversely affected by the degree of non-randomness inherent in a key transformation. If this is a problem, the analytical results obtained from assumed randonmess can be a valuable aid in deciding whether or not effort should be devoted to finding a better transformation. Furthermore, if there is wide variability in item usage, performance can be substantially improved by arranging list items such that items used most often are reached first on the list. This improvement can be gained in both chaining and indirect chaining. Summary Discussion An indirect chaining method for addressing a file in random-access storage has been described and evaluated. The method is particularly applicable to a secondary key, and can be repeated on any desired number of keys. The function of a file is to contain information for use in analysis and document preparation. A traditional obstacle to file exploitation has stemmed from addressing and ac-cessing limitations. With the advent of random-access storage devices, the addressing function has become a critical factor in proper file usage. Because the indirect chaining method permits increased flexibility in addressing, it should be instrumental in bringing about (a) further integration of files and (b) a higher level of file exploitation.