# Sensitivity-driven adaptive sparse stochastic approximations in plasma microinstability analysis

@article{Farcas2020SensitivitydrivenAS, title={Sensitivity-driven adaptive sparse stochastic approximations in plasma microinstability analysis}, author={Ionut-Gabriel Farcas and Tobias G{\"o}rler and Hans-Joachim Bungartz and Frank Jenko and Tobias Neckel}, journal={J. Comput. Phys.}, year={2020}, volume={410}, pages={109394} }

Quantifying uncertainty in predictive simulations for real-world problems is of paramount importance - and far from trivial, mainly due to the large number of stochastic parameters and significant computational requirements. Adaptive sparse grid approximations are an established approach to overcome these challenges. However, standard adaptivity is based on global information, thus properties such as lower intrinsic stochastic dimensionality or anisotropic coupling of the input directions…

## Figures, Tables, and Topics from this paper

## 8 Citations

Multilevel adaptive sparse Leja approximations for Bayesian inverse problems

- Computer Science, MathematicsSIAM J. Sci. Comput.
- 2020

The proposed multilevel adaptive sparse Leja algorithm is applied in numerical experiments involving elliptic inverse problems in 2D and 3D space, in which it is compared with Markov chain Monte Carlo sampling and a standard multileVEL approximation.

Multilevel Adaptive Sparse Leja Approximations

- 2019

Deterministic interpolation and quadrature methods are often unsuitable to address Bayesian inverse problems depending on computationally expensive forward mathematical models. While interpolation…

Turbulence suppression by energetic particles: a sensitivity-driven dimension-adaptive sparse grid framework for discharge optimization

- PhysicsNuclear Fusion
- 2021

A newly developed sensitivity-driven approach is employed to study the role of energetic particles in suppressing turbulence-inducing micro-instabilities for a set of realistic JET-like cases with…

Quantifying uncertainty in plasma microturbulence analysis using Multifidelity Monte Sampling

- 2020

The simulation of microturbulence in plasma fusion is paramount for understanding the confinement properties of fusion plasmas with magnetic fields. Unfortunately, the measurement of many of the…

Multifidelity Gaussian Processes for Uncertainty Quantification

- 2021

Forward uncertainty quantification is used to obtain useful insight of many physical models. However, it is a challenge to get accurate results for a given amount of computational resources, when…

A sparse-grid probabilistic scheme for approximation of the runway probability of electrons in fusion tokamak simulation

- Physics, Computer Science
- 2020

The main novelties of this effort are the integration of the sparse-grid method into the probabilistic numerical scheme for computing escape probability, as well as the demonstration in computing RE probabilities.

Data-driven low-fidelity models for multi-fidelity Monte Carlo sampling in plasma micro-turbulence analysis

- PhysicsJournal of Computational Physics
- 2021

The linear micro-instabilities driving turbulent transport in magnetized fusion plasmas (as well as the respective nonlinear saturation mechanisms) are known to be sensitive with respect to various…

On the convergence of adaptive stochastic collocation for elliptic partial differential equations with affine diffusion

- Mathematics, Computer ScienceArXiv
- 2020

Convergence of an adaptive collocation method for the stationary parametric diffusion equation with finite-dimensional affine coefficient is shown. The adaptive algorithm relies on a recently…

## References

SHOWING 1-10 OF 44 REFERENCES

Sparse Pseudo Spectral Projection Methods with Directional Adaptation for Uncertainty Quantification

- Mathematics, Computer ScienceJ. Sci. Comput.
- 2016

The numerical experiments indicate that PSP in the global parameter space generally requires fewer model evaluations than the nested approach to achieve similar projection error, and the global approach is better suited for generalization to more than two subsets of directions.

Adaptive Smolyak Pseudospectral Approximations

- Computer Science, MathematicsSIAM J. Sci. Comput.
- 2013

This paper describes an adaptive method for non-intrusive pseudospectral approximation, based on Smolyak's algorithm with generalized sparse grids, and introduces a greedy heuristic for adaptive refinement of the pseudospectsral approximation.

Sparse, adaptive Smolyak quadratures for Bayesian inverse problems

- Mathematics
- 2013

Based on the parametric deterministic formulation of Bayesian inverse problems with unknown input parameter from infinite-dimensional, separable Banach spaces proposed in Schwab and Stuart (2012…

An adaptive hierarchical sparse grid collocation algorithm for the solution of stochastic differential equations

- Mathematics, Computer ScienceJ. Comput. Phys.
- 2009

An adaptive sparse grid collocation strategy using piecewise multi-linear hierarchical basis functions and Hierarchical surplus is used as an error indicator to automatically detect the discontinuity region in the stochastic space and adaptively refine the collocation points in this region.

A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data

- Mathematics, Computer ScienceSIAM J. Numer. Anal.
- 2008

This work demonstrates algebraic convergence with respect to the total number of collocation points and quantifies the effect of the dimension of the problem (number of input random variables) in the final estimates, indicating for which problems the sparse grid stochastic collocation method is more efficient than Monte Carlo.

Adaptive Leja Sparse Grid Constructions for Stochastic Collocation and High-Dimensional Approximation

- Mathematics, Computer ScienceSIAM J. Sci. Comput.
- 2014

This paper establishes that a certain weighted formulation of one-dimensional Leja sequences produces a sequence of nodes whose empirical distribution converges to the corresponding limiting distribution of the Gauss quadrature nodes associated with the weight function.

Dimension–Adaptive Tensor–Product Quadrature

- Computer ScienceComputing
- 2003

The dimension–adaptive quadrature method is developed and presented, based on the sparse grid method, which tries to find important dimensions and adaptively refines in this respect guided by suitable error estimators, and leads to an approach which is based on generalized sparse grid index sets.

Sparse Pseudospectral Approximation Method

- Mathematics
- 2012

Multivariate global polynomial approximations – such as polynomial chaos or stochastic collocation methods – are now in widespread use for sensitivity analysis and uncertainty quantification. The…

An Improved Approach to Uncertainty Quantification for Plasma Turbulence Validation Studies

- Physics
- 2018

Abstract Due to the strong nonlinear dependence of plasma turbulence on drive and dissipation mechanisms, uncertainties in experimental inputs can be greatly magnified in simulations of this…

High-Order Collocation Methods for Differential Equations with Random Inputs

- Mathematics, Computer ScienceSIAM J. Sci. Comput.
- 2005

A high-order stochastic collocation approach is proposed, which takes advantage of an assumption of smoothness of the solution in random space to achieve fast convergence and requires only repetitive runs of an existing deterministic solver, similar to Monte Carlo methods.