Implementing Hager's exchange methods for matrix profile reduction

ePubs

The open archive for STFC research publications

Persistent URL	http://purl.org/net/epubs/work/40502
Record Status	Checked
Record Id	40502
Title	Implementing Hager's exchange methods for matrix profile reduction
Contributors	J K Reid, J A Scott
Abstract	Hager recently introduced down and up exchange methods for reducing the profile of a sparse matrix with a symmetric sparsity pattern. The methods are particularly useful for refining orderings that have been obtained using a standard profile reduction algorithm, such as the Sloan method. The running times for the exchange algorithms reported by Hager suggested their cost could be prohibitive for practical applications. We examine how to implement the exchange algorithms efficiently. For a range real test problems, it is shown that the cost of running our new implementation does not add a prohibitive overhead to the cost of the original reordering.
Organisation	CCLRC , CSE , CSE-NAG
Keywords
Funding Information
Related Research Object(s):
Licence Information:
Language	English (EN)

Type	Details	URI(s)	Local file(s)	Year
Journal Article	ACM Trans Math Software 28 (2002): 1-15.	doi:10.1145/592843.592844	raltr-2001039.pdf	2002
Report	RAL Technical Reports RAL-TR-2001-039 . 2001.			2001