Files in this item



application/pdfKALYANARAMAN-DISSERTATION-2015.pdf (16MB)
(no description provided)PDF


Title:Hodge Laplacians on simplicial meshes and graphs
Author(s):Kalyanaraman, Kaushik
Director of Research:Hirani, Anil N.
Doctoral Committee Chair(s):Hirani, Anil N.
Doctoral Committee Member(s):Demlow, Alan; Erickson, Jeff; Heath, Michael
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Subject(s):Computational analysis
discrete exterior calculus
finite element exterior calculus
Hodge Laplacians
ranking on graphs
Abstract:We present in this dissertation some developments in the discretizations of exterior calculus for problems posed on simplicial discretization (meshes) of geometric manifolds and analogous problems on abstract simplicial complexes. We are primarily interested in discretizations of elliptic type partial differential equations, and our model problem is the Hodge Laplacian Poisson problem on differential k-forms on n dimensional manifolds. One of our major contributions in this work is the computational quantification of the solution using the weak mixed formulation of this problem on simplicial meshes using discrete exterior calculus (DEC), and its comparisons with the solution due to a different discretization framework, namely, finite element exterior calculus (FEEC). Consequently, our important computational result is that the solution of the Poisson problem on different manifolds in two- and three-dimensions due to DEC recovers convergence properties on many sequences of refined meshes similar to that of FEEC. We also discuss some potential attempts for showing this convergence theoretically. In particular, we demonstrate that a certain formulation of a variational crimes approach that can be used for showing convergence for a generalized FEEC may not be directly applicable to DEC convergence in its current formulation. In order to perform computations using DEC, a key development that we present is exhibiting sign rules that allow for the computation of the discrete Hodge star operators in DEC on Delaunay meshes in a piecewise manner. Another aspect of computationally solving the Poisson problem using the mixed formulation with either DEC or FEEC requires knowing the solution to the corresponding Laplace's problem, namely, the harmonics. We present a least squares method for computing a basis for the space of such discrete harmonics via their isomorphism to cohomology. We also provide some numerics to quantify the efficiency of this solution in comparison with previously known methods. Finally, we demonstrate an application to obtain the ranking of pairwise comparison data. We model this data as edge weights on graphs with 3-cliques included and perform its Hodge decomposition by solving two least squares problems. An outcome of this exploration is also providing some computational evidence that algebraic multigrid linear solvers for the resulting linear systems on Erdős-Rényi random graphs and on Barabási-Albert graphs do not perform very well in comparison with iterative Krylov solvers.
Issue Date:2015-12-04
Rights Information:Copyright 2015 Kaushik Kalyanaraman
Date Available in IDEALS:2016-03-02
Date Deposited:2015-12

This item appears in the following Collection(s)

Item Statistics