Efficient simulation of Gaussian Markov random fields by Chebyshev polynomial approximation - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année :

Efficient simulation of Gaussian Markov random fields by Chebyshev polynomial approximation

(1) , (2)
1
2

Résumé

This paper presents an algorithm to simulate Gaussian random vectors whose precision matrix can be expressed as a polynomial of a sparse matrix. This situation arises in particular when simulating Gaussian Markov random fields obtained by the discretization by finite elements of the solutions of some stochastic partial derivative equations. The proposed algorithm uses a Chebyshev polynomial approximation to compute simulated vectors with a linear complexity. This method is asymptotically exact as the approximation order grows. Criteria based on tests of the statistical properties of the produced vectors are derived to determine minimal orders of approximation.

Dates et versions

hal-02075386 , version 1 (21-03-2019)

Identifiants

Citer

Mike Pereira, Nicolas Desassis. Efficient simulation of Gaussian Markov random fields by Chebyshev polynomial approximation. 2019. ⟨hal-02075386⟩
53 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook Twitter LinkedIn More