Kaperick, Bryan James2019-06-222019-06-222019-06-21vt_gsexam:20747http://hdl.handle.net/10919/90402Probing methods for trace estimation of large, sparse matrices has been studied for several decades. In recent years, there has been some work to extend these techniques to instead estimate the diagonal entries of these systems directly. We extend some analysis of trace estimators to their corresponding diagonal estimators, propose a new class of deterministic diagonal estimators which are well-suited to parallel architectures along with heuristic arguments for the design choices in their construction, and conclude with numerical results on diagonal estimation and ordering problems, demonstrating the strengths of our newly-developed methods alongside existing methods.ETDIn CopyrightProbing MethodsNumerical Linear AlgebraComputational Inverse ProblemsThesis