Neumann-Neumann decomposition plus mass lumping enables fast sampling of Gaussian random fields on metric graphs while preserving theoretical convergence rates of the underlying finite-element scheme.
Mathematics of Computation 93(349), 2439–2472 (Dec 2023)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient generation of Gaussian random fields on metric graphs via domain decomposition and mass matrix lumping
Neumann-Neumann decomposition plus mass lumping enables fast sampling of Gaussian random fields on metric graphs while preserving theoretical convergence rates of the underlying finite-element scheme.