GPvecchia0.1.8 package

Scalable Gaussian-Process Approximations

calculate_posterior_VL

Vecchia Laplace extension of GPVecchia for non-Gaussian data

createL

create the sparse triangular L matrix for specific parameters

createU

create the sparse triangular U matrix for specific parameters

getMatCov

extract the required elements from the covariance matrix

getMatCovFromFactorCpp

Calculate the covariance values required by HV for matrix factors pass...

GPvecchia

GPvecchia: fast, scalable Gaussian process approximations

ic0

Incomplete Cholesky decomposition of a sparse matrix passed in the com...

ichol

Wrapper for incomplete Cholesky decomposition

MaternFun

Calculate Matern covariance function

order_coordinate

Sorted coordinate ordering

order_dist_to_point

Distance to specified point ordering

order_maxmin_exact_obs_pred

Maximum minimum distance ordering for prediction

order_maxmin_exact

Maximum minimum distance ordering

order_middleout

Middle-out ordering

order_outsidein

Outside-in ordering

SelInv

selected inverse of a sparse matrix

V2covmat

compute covariance matrix from V.ord Do not run this function for larg...

vecchia_estimate

estimate mean and covariance parameters of a Matern covariance functio...

vecchia_laplace_likelihood_from_posterior

Wrapper for VL version of vecchia_likelihood

vecchia_laplace_likelihood

Wrapper for VL version of vecchia_likelihood

vecchia_laplace_prediction

Wrapper for VL version of vecchia_prediction

vecchia_likelihood

evaluation of the likelihood

vecchia_lincomb

linear combination of predictions compute the distribution of a linear...

vecchia_pred

make spatial predictions using Vecchia based on estimated parameters

vecchia_prediction

Vecchia prediction

vecchia_specify

specify a general vecchia approximation

Fast scalable Gaussian process approximations, particularly well suited to spatial (aerial, remote-sensed) and environmental data, described in more detail in Katzfuss and Guinness (2017) <doi:10.48550/arXiv.1708.06302>. Package also contains a fast implementation of the incomplete Cholesky decomposition (IC0), based on Schaefer et al. (2019) <doi:10.48550/arXiv.1706.02205> and MaxMin ordering proposed in Guinness (2018) <doi:10.48550/arXiv.1609.05372>.

  • Maintainer: Marcin Jurek
  • License: GPL (>= 2)
  • Last published: 2026-01-31