Cholesky-like preconditioner for Hodge Laplacians via heavy collapsible subcomplex

DOI10.1137/23m1626396MaRDI QIDQ6623667

Anton K. Savostianov, Nicola Guglielmi, Francesco Tudisco

Publication date: 24 October 2024

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

zbMATH Keywords

Gauss eliminationsimplicial complexHodge Laplaciangraph Laplaciancollapsible simplicial complexCholesky preconditioner

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Relations of low-dimensional topology with graph theory (57M15) Preconditioners for iterative methods (65F08)

Cites Work

• Unnamed Item
• Unnamed Item
• The worst way to collapse a simplex
• An Incomplete Factorization Technique for Positive Definite Linear Systems
• Stability of Conjugate Gradient and Lanczos Methods for Linear Least Squares Problems
• Signal Processing on Simplicial Complexes
• Random Walks on Simplicial Complexes and the Normalized Hodge 1-Laplacian
• Spectral sparsification of simplicial complexes for clustering and label propagation
• Hodge Laplacians on Graphs
• Solving 1-Laplacians in Nearly Linear Time: Collapsing and Expanding a Topological Ball
• Simplicial Spaces, Nuclei and m -Groups
• Methods of conjugate gradients for solving linear systems
• Recognition of collapsible complexes is NP-complete
• Graph Sparsification by Effective Resistances
• Quantifying the structural stability of simplicial homology
• Computational topology in a collapsing universe: Laplacians, homology, cohomology
• Combinatorial and Hodge Laplacians: similarities and differences

This page was built for publication: Cholesky-like preconditioner for Hodge Laplacians via heavy collapsible subcomplex