Robust Ordering of Sparse Matrices using Multisection

DOI10.1137/S0895479896299081MaRDI QIDQ4389110zbMATH OpenFDO

Authors 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)

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

zbMATH Keywords

nested dissectionnumerical examplenumerical experimentsordering algorithmssparse matrices

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 741125
• Improving the Run Time and Quality of Nested Dissection Ordering
• The Minimum Degree Ordering with Constraints
• Evaluation of Orderings for Unsymmetric Sparse Matrices
• Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods

Cited in

(12)

• Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem
• Ordering algorithms for irreducible sparse linear systems
• Using domain decomposition to find graph bisectors
• The impact of high-performance computing in the solution of linear systems: Trends and problems
• Decomposition in multidimensional Boolean-optimization problems with sparse matrices
• Multicolor reordering of sparse matrices resulting from irregular grids
• On sparse matrix orderings in interior point methods
• A Note on Nested Dissection for Rectangular Grids
• An optimization model for product placement on product listing pages
• scientific article; zbMATH DE number 1442000 (Why is no real title available?)
• A survey of direct methods for sparse linear systems
• Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods

This page was built for publication: Robust Ordering of Sparse Matrices using Multisection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4389110)