Premium
A memory‐economic frontwidth reduction algorithm
Author(s) -
Silvester Peter P.,
Auda Hesham A.,
Stone Geoffrey D.
Publication year - 1984
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1620200411
Subject(s) - numbering , minicomputer , reduction (mathematics) , computer science , square root , element (criminal law) , algorithm , simple (philosophy) , finite element method , computer memory , parallel computing , square (algebra) , power (physics) , arithmetic , computational science , mathematics , computer hardware , structural engineering , geometry , semiconductor memory , engineering , operating system , physics , philosophy , epistemology , quantum mechanics , political science , law
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.