On the Application of the Minimum Degree Algorithm to Finite Element Systems

DOI10.1137/0715006zbMATH Open0389.65014OpenAlexW4249812622MaRDI QIDQ4171504FDOQ4171504

Authors:

Publication date: 1978

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0715006

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Analysis of algorithms and problem complexity (68Q25) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Cited In (7)

• A survey of direct methods for sparse linear systems
• Caveats of three direct linear solvers for finite element analyses
• On Memory Traffic and Optimisations for Low-order Finite Element Assembly Algorithms on Multi-core CPUs
• Fast implementation of the traveling-salesman-problem method for reordering columns within supernodes
• A supernodal formulation of vertex colouring with applications in course timetabling
• Title not available (Why is that?)
• Reordering strategy for blocking optimization in sparse linear solvers

This page was built for publication: On the Application of the Minimum Degree Algorithm to Finite Element Systems

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