Parallel Adaptive Interpolation Algorithm based on Sparse Grids for Modeling Dynamic Systems with Interval Parameters

The paper presents a parallel algorithm for adaptive interpolation based on sparse grids for modeling dynamic systems with interval parameters. The idea of the algorithm is to construct a piecewise polynomial function that interpolates the dependence of the solution to the problem on the point values of the interval parameters. In the classical version of the algorithm, polynomial interpolation on complete grids is used, and with a large number of uncertainties, the algorithm becomes difficult to apply due to the exponential growth of computational costs. The use of sparse grids can significantly reduce the computational costs, but nevertheless the complexity of the algorithm in the general case remains exponential with respect to the number of interval parameters. In this regard, the issue of accelerating the algorithm is relevant. The algorithm can be divided into several sets of independent subtasks: updating the values corresponding to the grid nodes; calculation of weighting factors; interpolation of values at new nodes. The last two sets imply parallelization of recursion, so here the techniques for traversing the width of the call graph are mainly used. The parallel implementation of the algorithm was tested on two ODE systems containing two and six interval parameters, respectively, using a different number of computing cores. The results obtained demonstrate the effectiveness of the approaches used.

A Novel Sparse Polynomial Expansion Method for Interval and Random Response Analysis of Uncertain Vibro-Acoustic System

For the vibro-acoustic system with interval and random uncertainties, polynomial chaos expansions have received broad and persistent attention. Nevertheless, the cost of the computation process increases sharply with the increasing number of uncertain parameters. This study presents a novel interval and random polynomial expansion method, called Sparse Grids’ Sequential Sampling-based Interval and Random Arbitrary Polynomial Chaos (SGS-IRAPC) method, to obtain the response of a vibro-acoustic system with interval and random uncertainties. The proposed SGS-IRAPC retains the accuracy and the simplicity of the traditional arbitrary polynomial chaos method, while avoiding its inefficiency. In the SGS-IRAPC, the response is approximated by the moment-based arbitrary polynomial chaos expansion and the expansion coefficient is determined by the least squares approximation method. A new sparse sampling scheme combined the sparse grids’ scheme with the sequential sampling scheme which is employed to generate the sampling points used to calculate the expansion coefficient to decrease the computational cost. The efficiency of the proposed surrogate method is demonstrated using a typical mathematical problem and an engineering application.

Non-intrusive double-greedy parametric model reduction by interpolation of frequency-domain rational surrogates

We propose a model order reduction approach for non-intrusive surrogate modeling of parametric dynamical systems. The reduced model over the whole parameter space is built by combining surrogates in frequency only, built at few selected values of the parameters. This, in particular, requires matching the respective poles by solving an optimization problem. If the frequency surrogates are constructed by a suitable rational interpolation strategy, frequency and parameters can both be sampled in an adaptive fashion. This, in general, yields frequency surrogates with different numbers of poles, a situation addressed by our proposed algorithm. Moreover, we explain how our method can be applied even in high-dimensional settings, by employing locally-refined sparse grids in parameter space to weaken the curse of dimensionality. Numerical examples are used to showcase the effectiveness of the method, and to highlight some of its limitations in dealing with unbalanced pole matching, as well as with a large number of parameters.

Uncertainty quantification for the Hokkaido Nansei-Oki tsunami using B-splines on adaptive sparse grids

Modeling uncertainties in the input parameters of computer simulations is an established way to account for inevitably limited knowledge. To overcome long run-times and high demand for computational resources, a surrogate model can replace the original simulation. We use spatially adaptive sparse grids for the creation of this surrogate model. Sparse grids are a discretization scheme designed to mitigate the curse of dimensionality, and spatial adaptivity further decreases the necessary number of expensive simulations. We combine this with B-spline basis functions which provide gradients and are exactly integrable. We demonstrate the capability of this uncertainty quantification approach for a simulation of the Hokkaido Nansei–Oki Tsunami with anuga. We develop a better understanding of the tsunami behavior by calculating key quantities such as mean, percentiles and maximum run-up. We compare our approach to the popular Dakota toolbox and reach slightly better results for all quantities of interest. References B. M. Adams, M. S. Ebeida, et al. Dakota. Sandia Technical Report, SAND2014-4633, Version 6.11 User’s Manual, July 2014. 2019. https://dakota.sandia.gov/content/manuals. J. H. S. de Baar and S. G. Roberts. Multifidelity sparse-grid-based uncertainty quantification for the Hokkaido Nansei–Oki tsunami. Pure Appl. Geophys. 174 (2017), pp. 3107–3121. doi: 10.1007/s00024-017-1606-y. H.-J. Bungartz and M. Griebel. Sparse grids. Acta Numer. 13 (2004), pp. 147–269. doi: 10.1017/S0962492904000182. M. Eldred and J. Burkardt. Comparison of non-intrusive polynomial chaos and stochastic collocation methods for uncertainty quantification. 47th AIAA. 2009. doi: 10.2514/6.2009-976. K. Höllig and J. Hörner. Approximation and modeling with B-splines. Philadelphia: SIAM, 2013. doi: 10.1137/1.9781611972955. M. Matsuyama and H. Tanaka. An experimental study of the highest run-up height in the 1993 Hokkaido Nansei–Oki earthquake tsunami. National Tsunami Hazard Mitigation Program Review and International Tsunami Symposium (ITS). 2001. O. Nielsen, S. Roberts, D. Gray, A. McPherson, and A. Hitchman. Hydrodymamic modelling of coastal inundation. MODSIM 2005. 2005, pp. 518–523. https://www.mssanz.org.au/modsim05/papers/nielsen.pdf. J. Nocedal and S. J. Wright. Numerical optimization. Springer, 2006. doi: 10.1007/978-0-387-40065-5. D. Pflüger. Spatially Adaptive Sparse Grids for High-Dimensional Problems. Dr. rer. nat., Technische Universität München, Aug. 2010. https://www5.in.tum.de/pub/pflueger10spatially.pdf. M. F. Rehme, F. Franzelin, and D. Pflüger. B-splines on sparse grids for surrogates in uncertainty quantification. Reliab. Eng. Sys. Saf. 209 (2021), p. 107430. doi: 10.1016/j.ress.2021.107430. M. F. Rehme and D. Pflüger. Stochastic collocation with hierarchical extended B-splines on Sparse Grids. Approximation Theory XVI, AT 2019. Springer Proc. Math. Stats. Vol. 336. Springer, 2020. doi: 10.1007/978-3-030-57464-2_12. S Roberts, O. Nielsen, D. Gray, J. Sexton, and G. Davies. ANUGA. Geoscience Australia. 2015. doi: 10.13140/RG.2.2.12401.99686. I. J. Schoenberg and A. Whitney. On Pólya frequence functions. III. The positivity of translation determinants with an application to the interpolation problem by spline curves. Trans. Am. Math. Soc. 74.2 (1953), pp. 246–259. doi: 10.2307/1990881. W. Sickel and T. Ullrich. Spline interpolation on sparse grids. Appl. Anal. 90.3–4 (2011), pp. 337–383. doi: 10.1080/00036811.2010.495336. C. E. Synolakis, E. N. Bernard, V. V. Titov, U. Kânoğlu, and F. I. González. Standards, criteria, and procedures for NOAA evaluation of tsunami numerical models. NOAA/Pacific Marine Environmental Laboratory. 2007. https://nctr.pmel.noaa.gov/benchmark/. J. Valentin and D. Pflüger. Hierarchical gradient-based optimization with B-splines on sparse grids. Sparse Grids and Applications—Stuttgart 2014. Lecture Notes in Computational Science and Engineering. Vol. 109. Springer, 2016, pp. 315–336. doi: 10.1007/978-3-319-28262-6_13. D. Xiu and G. E. Karniadakis. The Wiener–Askey polynomial chaos for stochastic differential equations. SIAM J. Sci. Comput. 24.2 (2002), pp. 619–644. doi: 10.1137/S1064827501387826.

Sparse Grid Adaptive Interpolation in Problems of Modeling Dynamic Systems with Interval Parameters

The paper is concerned with the issues of modeling dynamic systems with interval parameters. In previous works, the authors proposed an adaptive interpolation algorithm for solving interval problems; the essence of the algorithm is the dynamic construction of a piecewise polynomial function that interpolates the solution of the problem with a given accuracy. The main problem of applying the algorithm is related to the curse of dimension, i.e., exponential complexity relative to the number of interval uncertainties in parameters. The main objective of this work is to apply the previously proposed adaptive interpolation algorithm to dynamic systems with a large number of interval parameters. In order to reduce the computational complexity of the algorithm, the authors propose using adaptive sparse grids. This article introduces a novelty approach of applying sparse grids to problems with interval uncertainties. The efficiency of the proposed approach has been demonstrated on representative interval problems of nonlinear dynamics and computational materials science.

Solving High-Dimensional Dynamic Portfolio Choice Models with Hierarchical B-Splines on Sparse Grids

Discrete time dynamic programming to solve dynamic portfolio choice models has three immanent issues: firstly, the curse of dimensionality prohibits more than a handful of continuous states. Secondly, in higher dimensions, even regular sparse grid discretizations need too many grid points for sufficiently accurate approximations of the value function. Thirdly, the models usually require continuous control variables, and hence gradient-based optimization with smooth approximations of the value function is necessary to obtain accurate solutions to the optimization problem. For the first time, we enable accurate and fast numerical solutions with gradient-based optimization while still allowing for spatial adaptivity using hierarchical B-splines on sparse grids. When compared to the standard linear bases on sparse grids or finite difference approximations of the gradient, our approach saves an order of magnitude in total computational complexity for a representative dynamic portfolio choice model with varying state space dimensionality, stochastic sample space, and choice variables.