Abstract
This paper introduces a numerically-stable multiscale scheme to efficiently generate probabilistic hazard maps for volcanic ash transport using models of transport, dispersion and wind. The scheme relies on graph-based algorithms and low-rank approximations of the adjacency matrix of the graph. This procedure involves representing both the parameter space and physical space by a weighted graph. A combination of clustering and low rank approximation is then used to create a good approximation of the original graph. By performing a multiscale data sampling, a well-conditioned basis of a low rank Gaussian kernel matrix, is identified and used for out-of-sample extensions used in generating the hazard maps.
| Original language | English |
|---|---|
| Pages (from-to) | 1613-1622 |
| Number of pages | 10 |
| Journal | Procedia Computer Science |
| Volume | 51 |
| Issue number | 1 |
| DOIs | |
| State | Published - 2015 |
| Event | International Conference on Computational Science, ICCS 2002 - Amsterdam, Netherlands Duration: Apr 21 2002 → Apr 24 2002 |
Keywords
- Emulators
- Hazard maps
- Multiscale data representation
- Volcanic ash transport
Fingerprint
Dive into the research topics of 'Forecasting volcanic plume hazards with fast UQ'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver