Papers › HLIBCov: Parallel Hierarchical Matrix Approximation of Large Covariance Matrices and...
HLIBCov: Parallel Hierarchical Matrix Approximation of Large Covariance Matrices and Likelihoods with Applications in Parameter Identification
Alexander Litvinenko
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We provide more technical details about the HLIBCov package, which is using parallel hierarchical (̋-) matrices to identify unknown parameters of the covariance function (variance, smoothness, and covariance length). These parameters are estimated by maximizing the joint Gaussian log-likelihood function. The HLIBCov package approximates large dense inhomogeneous covariance matrices with a log-linear computational cost and storage requirement. We explain how to compute the Cholesky factorization, determinant, inverse and quadratic form in the H-matrix format. To demonstrate the numerical performance, we identify three unknown parameters in an example with 2,000,000 locations on a PC-desktop.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections