Paper Info
Title
A sparse linear algebra algorithm for fast computation of prediction variances with Gaussian Markov random fields.
Abstract
Gaussian Markov random fields are used in a large number of disciplines in machine vision and spatial statistics. The models take advantage of sparsity in matrices introduced through the Markov assumptions, and all operations in inference and prediction use sparse linear algebra operations that scale well with dimensionality. Yet, for very high-dimensional models, exact computation of predictive variances of linear combinations of variables is generally computationally prohibitive, and approximate methods (generally interpolation or conditional simulation) are typically used instead. A set of conditions isestablished under which the variances of linear combinations of random variables can be computed exactly using the Takahashi recursions. The ensuing computational simplification has wide applicability and may be used to enhance several software packages where model fitting is seated in a maximum-likelihood framework. The resulting algorithm is ideal for use in a variety of spatial statistical applications, including LatticeKrig modelling, statistical downscaling, and fixed rank kriging. It can compute hundreds of thousands exact predictive variances of linear combinations on a standard desktop with ease, even when large spatial GMRF models are used.
Year
DOI
Venue
2018
10.1016/j.csda.2018.02.001
Computational Statistics & Data Analysis
Keywords
Field
DocType
Conditional dependence,GMRF,Lattice spatial model,Sparse inverse subset,Takahashi equations
Kriging,Spatial analysis,Linear algebra,Linear combination,Random variable,Mathematical optimization,Markov chain,Algorithm,Variable-order Markov model,Statistics,Mathematics,Algebraic operation
Journal
Volume
ISSN
Citations 
123
0167-9473
0
PageRank 
References 
Authors
0.34
5
2
Name
Order
Citations
PageRank
Andrew Zammit Mangion1112.65
Jonathan Rougier2217.53