Initialization of the Circulant Embedding method to speed up the generation of Gaussian random fields

The Circulant Embedding Method (CEM) is a well known technique to generate stationary Gaussian Random Fields (GRF). The main idea is to embed the covariance matrix in a larger nested block circulant matrix, whose factorization can be rapidly computed thanks to the fast Fourier transform (FFT) algori...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SMAI Journal of Computational Mathematics 2022-12, Vol.8, p.327-347
Hauptverfasser: Pichot, Géraldine, Legrand, Simon, Kern, Michel, Tepakbong-Tematio, Nathanael
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The Circulant Embedding Method (CEM) is a well known technique to generate stationary Gaussian Random Fields (GRF). The main idea is to embed the covariance matrix in a larger nested block circulant matrix, whose factorization can be rapidly computed thanks to the fast Fourier transform (FFT) algorithm. The CEM requires the extended matrix to be at least positive semidefinite which is proven to be the case if the enclosing domain is sufficiently large, as proven by Theorem 2.3 in [Graham et al, SIAM Journal on Numerical Analysis, 2018] for cubic domains. In this paper, we generalize this theorem to the case of rectangular parallelepipeds. Then we propose a new initialization stage of the CEM algorithm that makes it possible to quickly jump to a domain size close to the one needed for the CEM algorithm to work. These domain size estimates are based on fitting functions. Examples of fitting functions are given for the Mat\'ern family of covariances. These functions are inspired by our numerical simulations and by the theoretical work from [Graham et al, SIAM Journal on Numerical Analysis, 2018]. The parameters estimation of the fitting functions is done numerically. Several numerical tests are performed to show the efficiency of the proposed algorithms, for both isotropic and anisotropic Matérn covariances.
ISSN:2426-8399
2426-8399
DOI:10.5802/smai-jcm.89