A multi-fidelity polynomial chaos-greedy Kaczmarz approach for resource-efficient uncertainty quantification on limited budget
type: Item
instance of: scholarly article
title: A multi-fidelity polynomial chaos-greedy Kaczmarz approach for resource-efficient uncertainty quantification on limited budget
author: Negin Alemazkoor
author: Arghavan Louhghalam
author: Mazdak Tootkaboni
published in: Computer Methods in Applied Mechanics and Engineering
publication date: 2022-01-26T00:00:00Z
Mathematics Subject Classification ID: 65C20
Mathematics Subject Classification ID: 62-08
Mathematics Subject Classification ID: 65C05
zbMATH DE Number: 7464481
zbMATH Keywords: multi-fidelity modeling
zbMATH Keywords: Kaczmarz updating scheme
zbMATH Keywords: polynomial chaos expansion
zbMATH Keywords: uncertainty quantification on limited budget
MaRDI profile type: Publication
full work available at URL: j.cma.2021.114290
OpenAlex ID: W3217167255
cites work: Monte Carlo strategies in scientific computing.
cites work: Q4215355
cites work: The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
cites work: Q3583848
cites work: Spectral Methods for Uncertainty Quantification
cites work: Adaptive Smolyak Pseudospectral Approximations
cites work: High dimensional polynomial interpolation on sparse grids
cites work: Constructing Least-Squares Polynomial Approximations
cites work: Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression
cites work: Active Subspace Methods in Theory and Practice: Applications to Kriging Surfaces
cites work: Basis adaptation in homogeneous chaos spaces
cites work: On a near optimal sampling strategy for least squares polynomial regression
cites work: Nonadaptive quasi-optimal points selection for least squares linear regression
cites work: An adaptive hierarchical sparse grid collocation algorithm for the solution of stochastic differential equations
cites work: Multi-element probabilistic collocation method in high dimensions
cites work: A non-adapted sparse approximation of PDEs with stochastic inputs
cites work: A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions
cites work: STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATION
cites work: Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
cites work: A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions
cites work: Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
cites work: Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
cites work: A preconditioning approach for improved estimation of sparse polynomial chaos expansions
cites work: Multi-fidelity Gaussian process regression for prediction of random fields
cites work: A stochastic collocation algorithm with multifidelity models
cites work: Computational Aspects of Stochastic Collocation with Multifidelity Models
cites work: Multi-fidelity non-intrusive polynomial chaos based on regression
cites work: An efficient multifidelity \(\ell_1\)-minimization method for sparse polynomial chaos
cites work: Sparse grids
cites work: Optimal weighted least-squares methods
cites work: Stochastic model reduction for chaos representations
cites work: A Randomized Algorithm for Multivariate Function Approximation
cites work: A hybrid potential of mean force approach for simulation of fracture in heterogeneous media
DOI: 10.1016/J.CMA.2021.114290
description: scientific article; zbMATH DE number 7464481