Combinatorial algorithms for computing column space bases that have sparse inverses
From MaRDI portal
Publication:871171
zbMath1112.65040MaRDI QIDQ871171
Alex Pothen, Edmond Chow, Ali Pınar
Publication date: 16 March 2007
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/127446
matchingdivide and conquer strategygreedy algorithmsblock diagonal matrixhypergraph partitioning, inverse of a basisblock angular matrixsparse column space basissparse null space basis
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block ⋮ A heuristic to generate rank-1 GMI cuts ⋮ A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs ⋮ A \(2/3\)-approximation algorithm for vertex-weighted matching ⋮ Approximation algorithms in combinatorial scientific computing
This page was built for publication: Combinatorial algorithms for computing column space bases that have sparse inverses
