Deflation as a Method of Variance Reduction for Estimating the Trace of a Matrix Inverse
- 1 January 2017
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 39 (2) , A532-A558
- https://doi.org/10.1137/16m1066361
Abstract
Many fields require computing the trace of the inverse of a large, sparse matrix. The typical method used for such computations is the Hutchinson method which is a Monte Carlo (MC) averaging over matrix quadratures. To improve its convergence, several variance reductions techniques have been proposed. In this paper, we study the effects of deflating the near null singular value space. We make two main contributions. First, we analyze the variance of the Hutchinson method as a function of the deflated singular values and vectors. Although this provides good intuition in general, by assuming additionally that the singular vectors are random unitary matrices, we arrive at concise formulas for the deflated variance that include only the variance and mean of the singular values. We make the remarkable observation that deflation may increase variance for Hermitian matrices but not for non-Hermitian ones. This is a rare, if not unique, property where non-Hermitian matrices outperform Hermitian ones. The theory can be used as a model for predicting the benefits of deflation. Second, we use deflation in the context of a large scale application of "disconnected diagrams" in Lattice QCD. On lattices, Hierarchical Probing (HP) has previously provided an order of magnitude of variance reduction over MC by removing "error" from neighboring nodes of increasing distance in the lattice. Although deflation used directly on MC yields a limited improvement of 30% in our problem, when combined with HP they reduce variance by a factor of over 60 compared to MC. For this, we pre-computated 1000 smallest singular values of an ill-conditioned matrix of size 25 million. Using PRIMME and a domain-specific Algebraic Multigrid preconditioner, we perform one of the largest eigenvalue computations in Lattice QCD at a fraction of the cost of our trace computation.Comment: 21 pages, 24 figureKeywords
All Related Versions
Funding Information
- Office of Science
- Workforce Development for Teachers and Scientists (DE-AC05-06OR23100)
- National Science Foundation (CCF 1218349, ACI S12-SSE 1440700)
- U.S. Department of Energy (DE-FC02-12ER41890, DE-FG02-04ER41302, DE-AC05-06OR23177)
This publication has 15 references indexed in Scilit:
- High-precision calculation of the strange nucleon electromagnetic form factorsPhysical Review D, 2015
- Hierarchical Probing for Estimating the Trace of the Matrix Inverse on Toroidal LatticesSIAM Journal on Scientific Computing, 2013
- Improved stochastic estimation of quark propagation with Laplacian Heaviside smearing in lattice QCDPhysical Review D, 2011
- Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrixJournal of the ACM, 2011
- Adaptive Multigrid Algorithm for the Lattice Wilson-Dirac OperatorPhysical Review Letters, 2010
- PRIMMEACM Transactions on Mathematical Software, 2010
- An estimator for the diagonal of a matrixApplied Numerical Mathematics, 2007
- Random phase vector for calculating the trace of a large matrixPhysical Review E, 2004
- Random matrix theory and spectral sum rules for the Dirac operator in QCDNuclear Physics A, 1993
- A stochastic estimator of the trace of the influence matrix for laplacian smoothing splinesCommunications in Statistics - Simulation and Computation, 1990