Automatic element reordering for finite element analysis with frontal solution schemes

DOI10.1002/NME.1620190805zbMATH Open0515.73065OpenAlexW2167080748MaRDI QIDQ3662736FDOQ3662736

M. F. Randolph, S. W. Sloan

Publication date: 1983

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.1620190805

zbMATH Keywords

FORTRAN IVelement reordering algorithmelimination order preserved as closely as possiblefrontal solution packagegenerate efficient element numberingsminimize number of nodal numbering schemesmodified version of King algorithmstarting nodes selected automatically using concepts from graph theory

Mathematics Subject Classification ID

Computer aspects of numerical algorithms (65Y99) Finite element methods applied to problems in solid mechanics (74S05) Numerical and other methods in solid mechanics (74S99) Software, source code, etc. for problems pertaining to mechanics of deformable solids (74-04)

Cited In (3)

• Automated mesh decomposition and concurrent finite element analysis for hypercube multiprocessor computers
• Title not available (Why is that?)
• An algorithm for frontwidth reduction

This page was built for publication: Automatic element reordering for finite element analysis with frontal solution schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3662736)