Optimal Weighted Matchings for Rank-Deficient Sparse Matrices

DOI10.1137/120884262zbMath1287.05116OpenAlexW2018377157MaRDI QIDQ5413656

Jennifer Scott, Jonathan Hogg

Publication date: 30 April 2014

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: http://purl.org/net/epubs/work/63153

zbMATH Keywords

sparse matrixHungarian algorithmsingular matrixweighted matchingmatrix scalingrank-deficient matrixmaximum weight maximum cardinality matching

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Hermitian, skew-Hermitian, and related matrices (15B57) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items

A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners, On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices, New parallel sparse direct solvers for multicore architectures, A survey of direct methods for sparse linear systems

Uses Software

• HSL