On the Application of the Minimum Degree Algorithm to Finite Element Systems
From MaRDI portal
Publication:4171504
DOI10.1137/0715006zbMath0389.65014OpenAlexW4249812622MaRDI QIDQ4171504
No author found.
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
Analysis of algorithms and problem complexity (68Q25) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Related Items (6)
On Memory Traffic and Optimisations for Low-order Finite Element Assembly Algorithms on Multi-core CPUs ⋮ A supernodal formulation of vertex colouring with applications in course timetabling ⋮ Reordering Strategy for Blocking Optimization in Sparse Linear Solvers ⋮ Unnamed Item ⋮ A survey of direct methods for sparse linear systems ⋮ Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes
This page was built for publication: On the Application of the Minimum Degree Algorithm to Finite Element Systems
