A memory-economic frontwidth reduction algorithm

DOI10.1002/nme.1620200411zbMath0528.73078OpenAlexW2158215980MaRDI QIDQ3309238

P. Silvester, Hesham A. Auda, Geoffrey D. Stone

Publication date: 1984

Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nme.1620200411

zbMATH Keywords

element numbering algorithmimmediate-access computer memory sizememory-economicnear-minimal frontwidthsproportional to square root of E in two-dimensional problemsrenumbering algorithmrenumbering of E elementstwo- and three-dimensional finite element assembliestwo- thirds power of E in three dimensions

Mathematics Subject Classification ID

Related Items (2)

Generalized finite‐differences solution of 3D elliptical problems involving Neumann boundary conditions ⋮ A survey of direct methods for sparse linear systems

This page was built for publication: A memory-economic frontwidth reduction algorithm