Ordering algorithms for irreducible sparse linear systems

DOI10.1007/BF02025533zbMath0786.90036OpenAlexW2026150508MaRDI QIDQ1309854

J. A. J. Hall, Roger Fletcher

Publication date: 5 May 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02025533

zbMATH Keywords

lower Hessenberg formthreshold pivoting

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (3)

A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations ⋮ A manifold-based approach to sparse global constraint satisfaction problems ⋮ Resolving degeneracy in quadratic programming

Uses Software

• Algorithm 529

Cites Work

• Unnamed Item
• Unnamed Item
• The Elimination form of the Inverse and its Application to Linear Programming
• A Structurally Stable Modification of Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse Matrices
• A Comparison of Sparsity Orderings for Obtaining a Pivotal Sequence in Gaussian Elimination
• Reinversion with the preassigned pivot procedure
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Ordering algorithms for irreducible sparse linear systems