Hierarchical partition—a new optimal pivoting algorithm
- 1 December 1977
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 12 (1), 260-278
- https://doi.org/10.1007/bf01593792
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A Comparison of Sparsity Orderings for Obtaining a Pivotal Sequence in Gaussian EliminationIMA Journal of Applied Mathematics, 1974
- Fill-in comparisons between Gauss-Jordan and Gaussian eliminationsIEEE Transactions on Circuits and Systems, 1974
- Enumeration of the Elementary Circuits of a Directed GraphSIAM Journal on Computing, 1973
- A New Search Algorithm for Finding the Simple Cycles of a Finite Directed GraphJournal of the ACM, 1972
- Sparse Matrices and their ApplicationsPublished by Springer Nature ,1972
- Reinversion with the preassigned pivot procedureMathematical Programming, 1971
- On an Approach to Techniques for the Analysis of the Structure of Large Systems of EquationsSIAM Review, 1962
- The Elimination form of the Inverse and its Application to Linear ProgrammingManagement Science, 1957