Robust Ordering of Sparse Matrices using Multisection

Autor:	Joseph W. H. Liu, Cleve Ashcraft
Rok vydání:	1998
Předmět:	Reduction (complexity) Mathematical optimization Degree (graph theory) Nested dissection Generalization Bisection Spectrum (functional analysis) Minimum degree algorithm Algorithm Analysis Mathematics Sparse matrix
Zdroj:	SIAM Journal on Matrix Analysis and Applications. 19:816-832
ISSN:	1095-7162 0895-4798
DOI:	10.1137/s0895479896299081
Popis:	In this paper we provide a robust reordering scheme for sparse matrices. The scheme relies on the notion of multisection, a generalization of bisection. The reordering strategy is demonstrated to have consistently good performance in terms of fill reduction when compared with multiple minimum degree and generalized nested dissection. Experimental results show that by using multisection, we obtain an ordering which is consistently as good as or better than both for a wide spectrum of sparse problems.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::10388331081a0290b0f967da8e7c9aa5 https://doi.org/10.1137/s0895479896299081 Zobrazit plný text záznamu Plný text ve formátu PDF