The turning arcs: a computationally efficient algorithm to simulate isotropic vector-valued Gaussian random fields on the d-sphere
Artículo
![Thumbnail](/themes/Mirage2/images/cubierta.jpg)
Open/ Download
Access note
Acceso Abierto
Publication date
2020Metadata
Show full item record
Cómo citar
Alegría, Alfredo
Cómo citar
The turning arcs: a computationally efficient algorithm to simulate isotropic vector-valued Gaussian random fields on the d-sphere
Abstract
Random fields on the sphere play a fundamental role in the natural sciences. This paper presents a simulation algorithm parenthetical to the spectral turning bands method used in Euclidean spaces, for simulating scalar- or vector-valued Gaussian random fields on the d-dimensional unit sphere. The simulated random field is obtained by a sum of Gegenbauer waves, each of which is variable along a randomly oriented arc and constant along the parallels orthogonal to the arc. Convergence criteria based on the Berry-Esseen inequality are proposed to choose suitable parameters for the implementation of the algorithm, which is illustrated through numerical experiments. A by-product of this work is a closed-form expression of the Schoenberg coefficients associated with the Chentsov and exponential covariance models on spheres of dimensions greater than or equal to 2.
Patrocinador
National Agency for Research and Development of Chile through grant CONICYT/FONDECYT/INICIACION
11190686
National Agency for Research and Development of Chile through grant CONICYT
PIA AFB180004
National Agency for Research and Development of Chile through grant CONICYT/FONDECYT/REGULAR
1170290
Indexation
Artículo de publicación ISI Artículo de publicación SCOPUS
Quote Item
Statistics and Computing Jun 2020
Collections
The following license files are associated with this item: