Efficient generation of Gaussian random fields on metric graphs via domain decomposition and mass matrix lumping
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915978197073920 |
|---|---|
| author | Kovács, Mihály Molnár, Gyula Száraz, Máté András |
| author_facet | Kovács, Mihály Molnár, Gyula Száraz, Máté András |
| contents | We consider Gaussian Random Fields on metric graphs defined implicitly as the stationary solution to a fractional SPDE driven by Gaussian white noise. Sampling from the finite element approximation requires the Cholesky factorization of the mass matrix, causing non-linear execution time explosions and massive memory fill-in on large graphs. Hence, we combine Neumann-Neumann graph decomposition with mass matrix lumping and demonstrate empirically, that our approach preserves exact theoretical convergence rates established in [8] while achieving multi-order speedups and massive memory reductions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_02670 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Efficient generation of Gaussian random fields on metric graphs via domain decomposition and mass matrix lumping Kovács, Mihály Molnár, Gyula Száraz, Máté András Numerical Analysis We consider Gaussian Random Fields on metric graphs defined implicitly as the stationary solution to a fractional SPDE driven by Gaussian white noise. Sampling from the finite element approximation requires the Cholesky factorization of the mass matrix, causing non-linear execution time explosions and massive memory fill-in on large graphs. Hence, we combine Neumann-Neumann graph decomposition with mass matrix lumping and demonstrate empirically, that our approach preserves exact theoretical convergence rates established in [8] while achieving multi-order speedups and massive memory reductions. |
| title | Efficient generation of Gaussian random fields on metric graphs via domain decomposition and mass matrix lumping |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2605.02670 |