Hodge decomposition and general Laplacian solvers for embedded simplicial complexes

DOI10.4230/LIPICS.ICALP.2022.23MaRDI QIDQ6560809FDOQ6560809

Authors: Mitchell Black, Amir Nayyeri 

Publication date: 24 June 2024

Recommendations

• Solving 1-Laplacians in nearly linear time: collapsing and expanding a topological ball
• Computational topology in a collapsing universe: Laplacians, homology, cohomology
• Cholesky-like preconditioner for Hodge Laplacians via heavy collapsible subcomplex
• Lx = b
• A linear work, \(O(n^{1/6})\) time, parallel algorithm for solving planar Laplacians

zbMATH Keywords

computational topologyHodge decompositionparameterized complexitycombinatorial LaplacianLaplacian solvers

Mathematics Subject Classification ID

Parameterized complexity, tractability and kernelization (68Q27) Computational aspects of digital topology (68U03)

Cited In (2)

• Computational topology in a collapsing universe: Laplacians, homology, cohomology
• Cholesky-like preconditioner for Hodge Laplacians via heavy collapsible subcomplex

This page was built for publication: Hodge decomposition and general Laplacian solvers for embedded simplicial complexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560809)