Efficient Covariance Approximations for Large Sparse Precision Matrices
From MaRDI portal
Publication:3391172
DOI10.1080/10618600.2018.1473782OpenAlexW2962991243WikidataQ57266323 ScholiaQ57266323MaRDI QIDQ3391172
David Bolin, Finn Lindgren, Mattias Villani, Per Sidén
Publication date: 28 March 2022
Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10618600.2018.1473782
stochastic approximationspatial analysisselected inversionGaussian Markov random fieldssparse precision matrix
Related Items (3)
Patch-Based Image Restoration Using Expectation Propagation ⋮ Spatial 3D Matérn priors for fast whole-brain fMRI analysis ⋮ Latent Gaussian random field mixture models
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximate Bayesian inference for hierarchical Gaussian Markov random field models
- Parameter estimation in high dimensional Gaussian distributions
- Computing entries of the inverse of a sparse matrix using the FIND algorithm
- Fast estimation of spatially dependent temporal vegetation trends using Gaussian Markov random fields
- An estimator for the diagonal of a matrix
- Approximate Bayesian Inference for Latent Gaussian models by using Integrated Nested Laplace Approximations
- Fast Sparse Selected Inversion
- SelInv---An Algorithm for Selected Inversion of a Sparse Symmetric Matrix
- A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calculations
- On Computing Inverse Entries of a Sparse Matrix in an Out-of-Core Environment
- PSelInv—A Distributed Memory Parallel Algorithm for Selected Inversion
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- On computing certain elements of the inverse of a sparse matrix
- Low-Rank Variance Approximation in GMRF Models: Single and Multiscale Approaches
- Feedback Message Passing for Inference in Gaussian Graphical Models
- Fast Estimation of $tr(f(A))$ via Stochastic Lanczos Quadrature
- Gaussian Markov Random Fields
- An Approximate Minimum Degree Ordering Algorithm
- The Minimum Degree Ordering with Constraints
- A probing method for computing the diagonal of a matrix inverse
- Parallel Computation of Entries of ${A}^{-1}$
- Excursion and Contour Uncertainty Regions for Latent Gaussian Models
- A stochastic estimator of the trace of the influence matrix for laplacian smoothing splines
This page was built for publication: Efficient Covariance Approximations for Large Sparse Precision Matrices
