2015
DOI: 10.1007/s00477-015-1151-0
|View full text |Cite
|
Sign up to set email alerts
|

An improved spectral turning-bands algorithm for simulating stationary vector Gaussian random fields

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
19
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 64 publications
(19 citation statements)
references
References 34 publications
0
19
0
Order By: Relevance
“…The Gaussian random fields are jointly simulated using a spectral turning-bands algorithm [36]. This algorithm is preferred to other alternatives, such as sequential, covariance matrix decomposition or circulant-embedding algorithms ( [26] and references therein) because of its accuracy, versatility, unequalled computational speeds, and low memory storage requirements, being able to simulate highly-multivariate random fields and to reproduce exactly the desired spatial correlation structure [36].…”
Section: Conditional Simulationmentioning
confidence: 99%
“…The Gaussian random fields are jointly simulated using a spectral turning-bands algorithm [36]. This algorithm is preferred to other alternatives, such as sequential, covariance matrix decomposition or circulant-embedding algorithms ( [26] and references therein) because of its accuracy, versatility, unequalled computational speeds, and low memory storage requirements, being able to simulate highly-multivariate random fields and to reproduce exactly the desired spatial correlation structure [36].…”
Section: Conditional Simulationmentioning
confidence: 99%
“…To get EZ o ≡ it is sufficient to assume E 0 Y ≡ . b) Recently, an improved spectral turning-bands algorithm for simulating stationary multivariate Gaussian random fields was presented in [3]. Using this one can simulate any multivariate Gaussian field whose cross-covariance function is continuous and absolutely integrable for each entry.…”
Section: Previous Simulation Approachesmentioning
confidence: 99%
“…Recently, a very interesting ansatz without this limitation was given in [3]. Similar to a kind of spectral turning-bands algorithm it is available for non-grid positions but it creates only approximately Gaussian fields.…”
Section: Introductionmentioning
confidence: 99%
“…The Cholesky decomposition is not suitable for samples with a larger number of locations, not least because the computing time of the algorithm is cubic in the number of variables. For functions possessing spectral densities with closed formulae, the spectral turning bands algorithm can be used (Arroyo and Emery (), Emery et al ()). The multivariate turning bands method is implemented in the R package RandomFields (Schlather et al ).…”
Section: Introductionmentioning
confidence: 99%