HLIBCov: Parallel hierarchical matrix approximation of large covariance matrices and likelihoods with applications in parameter identification

11Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We provide more technical details about the HLIBCov package, which is using parallel hierarchical (H-) matrices to: • Approximate large dense inhomogeneous covariance matrices with a log-linear computational cost and storage requirement. • Compute matrix-vector product, Cholesky factorization and inverse with a log-linear complexity. • Identify unknown parameters of the covariance function (variance, smoothness, and covariance length). These unknown parameters are estimated by maximizing the joint Gaussian log-likelihood function. To demonstrate the numerical performance, we identify three unknown parameters in an example with 2,000,000 locations on a PC-desktop.

Cite

CITATION STYLE

APA

Litvinenko, A., Kriemann, R., Genton, M. G., Sun, Y., & Keyes, D. E. (2020). HLIBCov: Parallel hierarchical matrix approximation of large covariance matrices and likelihoods with applications in parameter identification. MethodsX, 7. https://doi.org/10.1016/j.mex.2019.07.001

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free