Efficient solutions of hierarchical systems of linear equations

DOI10.1007/BF02310101zbMath0619.65016MaRDI QIDQ1089723

Thomas Lengauer, Christian Wieners

Publication date: 1987

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

orderingfinite elementGaussian eliminationsparse systemsnested dissection methodcircuit analysishierarchical graph processingsubstructure method

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Finite element methods applied to problems in solid mechanics (74S05) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Unnamed Item ⋮ The complexity of approximating PSPACE-complete problems for hierarchical specifications ⋮ The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems ⋮ Hierarchically specified unit disk graphs

Uses Software

• MA28

Cites Work

• Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs
• Generalized Nested Dissection
• Computing the Minimum Fill-In is NP-Complete
• Algorithmic Aspects of Vertex Elimination on Graphs
• NATURAL FREQUENCIES OF REPETITIVE STRUCTURES
• Comparison between sparse stiffness matrix and sub‐structure methods
• Unnamed Item
• Unnamed Item
• Unnamed Item