Hierarchical partition—a new optimal pivoting algorithm

DOI10.1007/BF01593792zbMath0356.65022MaRDI QIDQ4127869

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

Publication date: 1977

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

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

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

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