Implementing Hager's exchange methods for matrix profile reduction

DOI10.1145/592843.592844zbMath1074.65046OpenAlexW2019020290WikidataQ113309763 ScholiaQ113309763MaRDI QIDQ5461041

John K. Reid, Jennifer Scott

Publication date: 21 July 2005

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/592843.592844

zbMATH Keywords

numerical examplessparse matrixexchange methods

Mathematics Subject Classification ID

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

Related Items

A variable neighborhood search and simulated annealing hybrid for the profile minimization problem, A Hypergraph Partitioning Model for Profile Minimization, An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method, A survey of direct methods for sparse linear systems, Multilevel hybrid spectral element ordering algorithms, Addressing the envelope reduction of sparse matrices using a genetic programming system

Uses Software

• BLAS