Adaptive-sparse polynomial dimensional decomposition methods for high-dimensional stochastic computing
From MaRDI portal
Abstract: This article presents two novel adaptive-sparse polynomial dimensional decomposition (PDD) methods for solving high-dimensional uncertainty quantification problems in computational science and engineering. The methods entail global sensitivity analysis for retaining important PDD component functions, and a full- or sparse-grid dimension-reduction integration or quasi Monte Carlo simulation for estimating the PDD expansion coefficients. A unified algorithm, endowed with two distinct ranking schemes for grading component functions, was created for their numerical implementation. The fully adaptive-sparse PDD method is comprehensive and rigorous, leading to the second-moment statistics of a stochastic response that converges to the exact solution when the tolerances vanish. A partially adaptive-sparse PDD method, obtained through regulated adaptivity and sparsity, is economical and is, therefore, expected to solve practical problems with numerous variables. Compared with past developments, the adaptive-sparse PDD methods do not require its truncation parameter(s) to be assigned emph{a priori} or arbitrarily. The numerical results reveal that an adaptive-sparse PDD method achieves a desired level of accuracy with considerably fewer coefficients compared with existing PDD approximations. For a required accuracy in calculating the probabilistic response characteristics, the new bivariate adaptive-sparse PDD method is more efficient than the existing bivariately truncated PDD method by almost an order of magnitude. Finally, stochastic dynamic analysis of a disk brake system was performed, demonstrating the ability of the new methods to tackle practical engineering problems.
Recommendations
- Uncertainty quantification of high-dimensional complex systems by multiplicative polynomial dimensional decompositions
- A polynomial dimensional decomposition for stochastic computing
- A new algorithm for high-dimensional uncertainty quantification based on dimension-adaptive sparse grid approximation and reduced basis methods
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 49187 (Why is no real title available?)
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 2107939 (Why is no real title available?)
- scientific article; zbMATH DE number 914714 (Why is no real title available?)
- scientific article; zbMATH DE number 3315776 (Why is no real title available?)
- A generalized dimension‐reduction method for multidimensional integration in stochastic mechanics
- A polynomial dimensional decomposition for stochastic computing
- Adaptive ANOVA decomposition of stochastic incompressible and compressible flows
- An adaptive high-dimensional stochastic model representation technique for the solution of stochastic partial differential equations
- An adaptive multi-element generalized polynomial chaos method for stochastic differential equations
- Approximation errors in truncated dimensional decompositions
- Dimension-wise integration of high-dimensional functions with applications to finance
- Discrépances de suites associées à un système de numération (en dimension un)
- Fully Symmetric Interpolatory Rules for Multiple Integrals
- Fully symmetric interpolatory rules for multiple integrals over infinite regions with Gaussian weight
- General foundations of high-dimensional model representations
- Global sensitivity indices for nonlinear mathematical models and their Monte Carlo estimates
- Improving the rejection sampling method in quasi-Monte Carlo methods
- Lanczos Algorithms for Large Symmetric Eigenvalue Computations
- On the distribution of points in a cube and the approximate evaluation of integrals
- On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
- Orthogonal polynomial expansions for solving random eigenvalue problems
- Quadrature Error Bounds with Applications to Lattice Rules
- Simple cubature formulas with high polynomial exactness
- Solution of stochastic partial differential equations using Galerkin finite element techniques
- Sparse grid collocation schemes for stochastic natural convection problems
- Sparse grid quadrature in high dimensions with applications in finance and insurance
- Sparse polynomial chaos expansions and adaptive stochastic finite elements using a regression approach
- Stochastic dynamic systems with complex-valued eigensolutions
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- The jackknife estimate of variance
- Uncertainty quantification of high-dimensional complex systems by multiplicative polynomial dimensional decompositions
Cited in
(25)- An adaptive least-squares global sensitivity method and application to a plasma-coupled combustion prediction with parametric correlation
- Improved Moving Least Square-Based Multiple Dimension Decomposition (MDD) Technique for Structural Reliability Analysis
- A polynomial dimensional decomposition for stochastic computing
- An iterative polynomial chaos approach toward stochastic elastostatic structural analysis with non-Gaussian randomness
- Uncertainty quantification by optimal spline dimensional decomposition
- A new adaptive sparse pseudospectral approximation method
- An adaptive spectral Galerkin stochastic finite element method using variability response functions
- Sensitivity-driven adaptive sparse stochastic approximations in plasma microinstability analysis
- Extreme value oriented random field discretization based on an hybrid polynomial chaos expansion -- Kriging approach
- Towards `\(h\)-\(p\) \textit{adaptive}' generalized ANOVA
- An efficient dimension-adaptive uncertainty propagation approach
- A novel maximum volume sampling model for reliability analysis
- Stochastic finite elements of discretely parameterized random systems on domains with boundary uncertainty
- SS-MASVM: an advanced technique for assessing failure probability of high-dimensional complex systems using the multi-class adaptive support vector machine
- Uncertainty quantification under dependent random variables by a generalized polynomial dimensional decomposition
- A new non-intrusive polynomial chaos using higher order sensitivities
- Efficient reliability analysis with a CDA-based dimension-reduction model and polynomial chaos expansion
- Improved Nelder–Mead algorithm in high dimensions with adaptive parameters based on Chebyshev spacing points
- A new sparse grid based method for uncertainty propagation
- A new algorithm for high-dimensional uncertainty quantification based on dimension-adaptive sparse grid approximation and reduced basis methods
- Mathematical properties of polynomial dimensional decomposition
- Enhanced sequential approximate programming using second order reliability method for accurate and efficient structural reliability-based design optimization
- An efficient metamodeling approach for uncertainty quantification of complex systems with arbitrary parameter probability distributions
- Adaptive surrogate modeling by ANOVA and sparse polynomial dimensional decomposition for global sensitivity analysis in fluid simulation
- Kriging-sparse polynomial dimensional decomposition surrogate model with adaptive refinement
This page was built for publication: Adaptive-sparse polynomial dimensional decomposition methods for high-dimensional stochastic computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q459298)
