paper

Fast symmetric factorization of hierarchical matrices with applications

arXiv:1405.0223

Abstract

We present a fast direct algorithm for computing symmetric factorizations, i.e. , of symmetric positive-definite hierarchical matrices with weak-admissibility conditions. The computational cost for the symmetric factorization scales as for hierarchically off-diagonal low-rank matrices. Once this factorization is obtained, the cost for inversion, application, and determinant computation scales as . In particular, this allows for the near optimal generation of correlated random variates in the case where is a covariance matrix. This symmetric factorization algorithm depends on two key ingredients. First, we present a novel symmetric factorization formula for low-rank updates to the identity of the form . This factorization can be computed in time if the rank of the perturbation is sufficiently small. Second, combining this formula with a recursive divide-and-conquer strategy, near linear complexity symmetric factorizations for hierarchically structured matrices can be obtained. We present numerical results for matrices relevant to problems in probability \& statistics (Gaussian processes), interpolation (Radial basis functions), and Brownian dynamics calculations in fluid mechanics (the Rotne-Prager-Yamakawa tensor).

18 pages, 8 figures, 1 table

References in corpus (2)

Cited by in corpus (6)