Fast algorithms for placing large entries along the diagonal of a sparse matrix

DOI10.1016/j.cam.2010.07.002zbMath1206.65149OpenAlexW1997667366MaRDI QIDQ708297

Sanguthevar Rajasekaran, Vamsi Krishna Kundeti

Publication date: 11 October 2010

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2010.07.002

zbMATH Keywords

combinatorial optimizationbipartite matchingdiagonally dominant sparse matrixpre ordering sparse matrixsparse matrix algorithmsweighted matching algorithms

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

Uses Software

• SuperLU-DIST

Cites Work

• Unnamed Item
• Unnamed Item
• On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
• Algorithms for the Assignment and Transportation Problems
• Fibonacci heaps and their uses in improved network optimization algorithms
• SuperLU_DIST

This page was built for publication: Fast algorithms for placing large entries along the diagonal of a sparse matrix