Beyond massive parallelism: numerical computation using associative tables

Novel computing devices are exploited for numerical computation. The solution of a numerical problem is sought, which has been solved many times before, but this time with a different set of input data. A table is a classical way to collect the old solutions in order to exploit them to find the new one. This process is extended to more general problems than the usual function value approximation. To do this, a new concept of table is introduced. These tables are addressed associatively. Several problems are treated both theoretically and computationally. These problems include solving linear systems of equations, partial differential equations, nonlinear systems of ordinary differential equations, and Karmarkar's algorithm. Hardware requirements are discussed. © 1990.