A geometric framework for sparse matrix problems

DOI10.1016/j.aam.2003.08.002zbMath1103.65032OpenAlexW2049818101MaRDI QIDQ1883390

Gunnar Carlsson, Vin De Silva

Publication date: 12 October 2004

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2003.08.002

zbMATH Keywords

Parallel algorithmssimplicial complexSparse matricesAlgebraic topologyMayer-VietorisBlock-triangular formSpectral sequences

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Simplicial sets and complexes in algebraic topology (55U10) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Discriminant analysis based on statistical depth ⋮ Large sample and robust properties of \(\widetilde {L} ^{2}\)-median ⋮ PERSISTENCE BARCODES FOR SHAPES ⋮ On Exact Computation of Some Statistics Based on Projection Pursuit in a General Regression Context

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the filtered differential group
• Computing the block triangular form of a sparse matrix
• Two Algorithms for Bipartite Graphs