Exploiting inexact computations in multilevel Monte Carlo and other sampling methods
Multilevel sampling methods, such as multilevel and multifidelity Monte Carlo, multilevel stochastic collocation, or delayed acceptance Markov chain Monte Carlo, have become standard uncertainty quantification (UQ) tools for a wide class of forward and inverse problems. The underlying idea is to ach...
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Article (Journal) |
| Lingua: | inglese |
| Pubblicazione: |
Apr 2026
|
| In: |
SIAM journal on scientific computing
Year: 2026, Volume: 48, Fascicolo: 2, Pages: B141-B164 |
| ISSN: | 1095-7197 |
| Accesso online: | Verlag, lizenzpflichtig, Volltext: https://epubs.siam.org/doi/10.1137/25M1742795
|
| Note sull'autore: | Josef Martinek, Erin Carson, and Robert Scheichl |
| Riassunto: | Multilevel sampling methods, such as multilevel and multifidelity Monte Carlo, multilevel stochastic collocation, or delayed acceptance Markov chain Monte Carlo, have become standard uncertainty quantification (UQ) tools for a wide class of forward and inverse problems. The underlying idea is to achieve faster convergence by leveraging a hierarchy of models, such as partial differential equation (PDE) or stochastic differential equation (SDE) discretisations with increasing accuracy. By optimally redistributing work among the levels, multilevel methods can achieve significant performance improvement compared to single level methods working with one high-fidelity model. Intuitively, approximate solutions on coarser levels can tolerate large computational error without affecting the overall accuracy. We show how this can be used in high-performance computing applications to obtain a significant performance gain. As a use case, we analyze the computational error in the standard multilevel Monte Carlo method and formulate an adaptive algorithm which determines a minimum required computational accuracy on each level of discretisation. We show two examples of how the inexactness can be converted into actual gains using an elliptic PDE with lognormal random coefficients. Using a low precision sparse direct solver combined with iterative refinement results in a simulated gain in memory references of up to 3.5 imes compared to the reference double precision solver; while using a MINRES iterative solver, a practical speedup of up to 1.5 imes in terms of FLOPs is achieved. These results provide a step in the direction of energy-aware scientific computing, with significant potential for energy savings. |
|---|---|
| Descrizione del documento: | Online veröffentlicht: March 5, 2026 Gesehen am 31.07.2026 |
| Descrizione fisica: | Online Resource |
| ISSN: | 1095-7197 |