A Structurally Stable Modification of Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse Matrices

DOI10.1137/0722022zbMath0586.65035OpenAlexW1973752298MaRDI QIDQ3711661

Roger. G. Grimes, William Poole, John Lewis, A. M. Erisman

Publication date: 1985

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0722022

zbMATH Keywords

numerical stabilityLU factorizationspartitioned preassigned pivot procedurechemical process modelling problemsMarkowitz reorderingP4 algorithmunsymmetric sparse matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items

A locally optimized reordering algorithm and its application to a parallel sparse linear system solver, Improving the numerical stability and the performance of a parallel sparse solver, A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations, A survey of direct methods for sparse linear systems, A manifold-based approach to sparse global constraint satisfaction problems, New crash procedures for large systems of linear constraints, A triangulation and fill-reducing initialization procedure for the simplex algorithm, Maintaining LU factors of a general sparse matrix, Ordering algorithms for irreducible sparse linear systems, Some new results regarding spikes and a heuristic for spike construction