A multi-fidelity polynomial chaos-greedy Kaczmarz approach for resource-efficient uncertainty quantification on limited budget

DOI10.1016/j.cma.2021.114290OpenAlexW3217167255MaRDI QIDQ2072434

Arghavan Louhghalam, Negin Alemazkoor, Mazdak Tootkaboni

Publication date: 26 January 2022

Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cma.2021.114290

zbMATH Keywords

polynomial chaos expansionmulti-fidelity modelingKaczmarz updating schemeuncertainty quantification on limited budget

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Probabilistic models, generic numerical methods in probability and statistics (65C20) Monte Carlo methods (65C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Basis adaptation in homogeneous chaos spaces
• Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
• A non-adapted sparse approximation of PDEs with stochastic inputs
• Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
• Multi-element probabilistic collocation method in high dimensions
• An adaptive hierarchical sparse grid collocation algorithm for the solution of stochastic differential equations
• Stochastic model reduction for chaos representations
• On a near optimal sampling strategy for least squares polynomial regression
• Multi-fidelity Gaussian process regression for prediction of random fields
• Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression
• High dimensional polynomial interpolation on sparse grids
• A preconditioning approach for improved estimation of sparse polynomial chaos expansions
• A hybrid potential of mean force approach for simulation of fracture in heterogeneous media
• Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
• An efficient multifidelity \(\ell_1\)-minimization method for sparse polynomial chaos
• Multi-fidelity non-intrusive polynomial chaos based on regression
• A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions
• Monte Carlo strategies in scientific computing.
• Nonadaptive Quasi-Optimal Points Selection for Least Squares Linear Regression
• A Stochastic Collocation Algorithm with Multifidelity Models
• Active Subspace Methods in Theory and Practice: Applications to Kriging Surfaces
• Computational Aspects of Stochastic Collocation with Multifidelity Models
• Spectral Methods for Uncertainty Quantification
• The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
• Optimal weighted least-squares methods
• Constructing Least-Squares Polynomial Approximations
• A Randomized Algorithm for Multivariate Function Approximation
• A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions
• Sparse grids
• Adaptive Smolyak Pseudospectral Approximations
• STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATION