Diagonal Estimation with Probing Methods
| dc.contributor.author | Kaperick, Bryan James | en |
| dc.contributor.committeechair | Chung, Matthias | en |
| dc.contributor.committeemember | Gugercin, Serkan | en |
| dc.contributor.committeemember | Mohan, Jayanth Jagalur | en |
| dc.contributor.committeemember | Chung, Julianne | en |
| dc.contributor.department | Mathematics | en |
| dc.date.accessioned | 2019-06-22T08:01:56Z | en |
| dc.date.available | 2019-06-22T08:01:56Z | en |
| dc.date.issued | 2019-06-21 | en |
| dc.description.abstract | Probing 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. | en |
| dc.description.abstractgeneral | In the past several decades, as computational resources increase, a recurring problem is that of estimating certain properties very large linear systems (matrices containing real or complex entries). One particularly important quantity is the trace of a matrix, defined as the sum of the entries along its diagonal. In this thesis, we explore a problem that has only recently been studied, in estimating the diagonal entries of a particular matrix explicitly. For these methods to be computationally more efficient than existing methods, and with favorable convergence properties, we require the matrix in question to have a majority of its entries be zero (the matrix is sparse), with the largest-magnitude entries clustered near and on its diagonal, and very large in size. In fact, this thesis focuses on a class of methods called probing methods, which are of particular efficiency when the matrix is not known explicitly, but rather can only be accessed through matrix vector multiplications with arbitrary vectors. Our contribution is new analysis of these diagonal probing methods which extends the heavily-studied trace estimation problem, new applications for which probing methods are a natural choice for diagonal estimation, and a new class of deterministic probing methods which have favorable properties for large parallel computing architectures which are becoming ever-more-necessary as problem sizes continue to increase beyond the scope of single processor architectures. | en |
| dc.description.degree | Master of Science | en |
| dc.format.medium | ETD | en |
| dc.identifier.other | vt_gsexam:20747 | en |
| dc.identifier.uri | http://hdl.handle.net/10919/90402 | en |
| dc.publisher | Virginia Tech | en |
| dc.rights | In Copyright | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject | Probing Methods | en |
| dc.subject | Numerical Linear Algebra | en |
| dc.subject | Computational Inverse Problems | en |
| dc.title | Diagonal Estimation with Probing Methods | en |
| dc.type | Thesis | en |
| thesis.degree.discipline | Mathematics | en |
| thesis.degree.grantor | Virginia Polytechnic Institute and State University | en |
| thesis.degree.level | masters | en |
| thesis.degree.name | Master of Science | en |
Files
Original bundle
1 - 1 of 1