Robust Ordering of Sparse Matrices using Multisection

DOI10.1137/S0895479896299081zbMath0911.65021MaRDI QIDQ4389110

Cleve Ashcraft, Joseph W. H. Liu

Publication date: 11 May 1998

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

numerical examplenumerical experimentssparse matricesnested dissectionordering algorithms

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Decomposition in multidimensional Boolean-optimization problems with sparse matrices, Using domain decomposition to find graph bisectors, On sparse matrix orderings in interior point methods, An optimization model for product placement on product listing pages, A survey of direct methods for sparse linear systems, The impact of high-performance computing in the solution of linear systems: Trends and problems