A memory‐economic frontwidth reduction algorithm

A simple element numbering algorithm is described which yields near-minimal frontwidths for two- and three-dimensional finite element assemblies. Renumbering of E elements requires an immediate-access computer memory size which is proportional to the square root of E in two-dimensional problems, and to the two-thirds power of E in three dimensions. This very small memory requirement allows processing of large problems in minicomputers. When used in large computers, page-swapping operations are minimized.