An equation numbering algorithm based on a minimum front criteria

DOI10.1016/0045-7949(83)90163-3MaRDI QIDQ3965683zbMATH OpenOpenAlexFDO

Authors Marc I. Hoit, Edward L. Wilson

Publication date 1983

Published in Computers & Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0045-7949(83)90163-3

zbMATH Keywords

compared to other techniquecomputer implementationequation numbering algorithmequations are stored in profile formFORTRAN listing of subroutinesGauss elimination solutionminimum front criteriaPFM algorithmprofile-front minimizationsignificantly less computer storage

Mathematics Subject Classification ID

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

Cited in

(3)

• scientific article; zbMATH DE number 983158 (Why is no real title available?)
• A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph
• A survey of direct methods for sparse linear systems

This page was built for publication: An equation numbering algorithm based on a minimum front criteria

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