SIMPL-R and Its Application to Large, Sparse Matrix Problems

A description of the computer programming language SIMPL-R is given. SIMPL-R is the member of the SIMPL family of structured programming languages intended for use with numerical computations such as those which arise in connection with the solution of scientific and engineering problems. An example is given showing an implementation in SIMPL-R of an algorithm for the solution of sparse matrix problems using an arc-graph data structure. Comparisons with the same algorithm coded in FORTRAN show that the nonoptimizing SIMPL-R compiler produces code which is ten to twenty percent faster than that produced by the optimizing FORTRAN compiler. (Author).