Kriging with large data sets using sparse matrix techniques
From MaRDI portal
Publication:4369366
Recommendations
- Fast kriging of large data sets with Gaussian Markov random fields
- Application of FFT-based algorithms for large-scale universal kriging problems
- Fast and accurate approximation to Kriging using common data neighborhoods
- Conditioning of coefficient matrices of ordinary kriging
- On the condition number of covariance matrices in kriging, estimation, and simulation of random fields
Cites work
Cited in
(14)- Application of FFT-based algorithms for large-scale universal kriging problems
- Monte Carlo estimates of the log determinant of large sparse matrices
- Efficient emulators of computer experiments using compactly supported correlation functions, with an application to cosmology
- Fast kriging of large data sets with Gaussian Markov random fields
- Estimating sensitivity indices based on Gaussian process metamodels with compactly supported correlation functions
- On the condition number of covariance matrices in kriging, estimation, and simulation of random fields
- Nested kriging predictions for datasets with a large number of observations
- Kriging and spatial design accelerated by orders of magnitude: combining low-rank covariance approximations with FFT-techniques
- Fast cars
- Strategies for Fitting Large, Geostatistical Data in MCMC Simulation
- A spatial interaction model with spatially structured origin and destination effects
- The local approximation of variograms in \(\mathcal R^2\) by covariance functions
- Compactly supported correlation functions
- Fast and accurate approximation to Kriging using common data neighborhoods
This page was built for publication: Kriging with large data sets using sparse matrix techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4369366)
