Hierarchical partition—a new optimal pivoting algorithm

DOI10.1007/BF01593792zbMATH Open0356.65022MaRDI QIDQ4127869FDOQ4127869

Authors: T. D. Lin, R. S. H. Mah 

Publication date: 1977

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Linear programming (90C05)

Cites Work

• The elimination form of the inverse and its application to linear programming
• Enumeration of the Elementary Circuits of a Directed Graph
• On an Approach to Techniques for the Analysis of the Structure of Large Systems of Equations
• Reinversion with the preassigned pivot procedure
• Partitioning and Tearing Systems of Equations
• A Comparison of Sparsity Orderings for Obtaining a Pivotal Sequence in Gaussian Elimination
• A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph

Cited In (3)

• A survey of direct methods for sparse linear systems
• A Hierarchical Representation of the Inverse for Sparse Matrices
• Constructing blockmodels: how and why

This page was built for publication: Hierarchical partition—a new optimal pivoting algorithm

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