Classifier-based adaptive polynomial chaos expansion for high-dimensional uncertainty quantification
From MaRDI portal
Publication:6125488
DOI10.1016/j.cma.2024.116829OpenAlexW4391708020WikidataQ128142041 ScholiaQ128142041MaRDI QIDQ6125488
Subham Gupta, Sameer B. Mulani, Mishal Thapa, Achyut Paudel, Robert W. Walters
Publication date: 11 April 2024
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.2024.116829
high-dimensionalityuncertainty quantificationsupport vector machine classifieradaptive polynomial chaos expansionstochastic nonlinear buckling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Grid and basis adaptive polynomial chaos techniques for sensitivity and uncertainty analysis
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- Adaptive sparse polynomial chaos expansion based on least angle regression
- Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
- Efficient global optimization of expensive black-box functions
- Least angle regression. (With discussion)
- An efficient and robust adaptive sampling method for polynomial chaos expansion in sparse Bayesian learning framework
- Polynomial (chaos) approximation of maximum eigenvalue functions. Efficiency and limitations
- Adaboost-based ensemble of polynomial chaos expansion with adaptive sampling
- Adaptive weighted least-squares polynomial chaos expansion with basis adaptivity and sequential adaptive sampling
- Data-driven polynomial chaos expansion for machine learning regression
- Variance-based adaptive sequential sampling for polynomial chaos expansion
- A hybrid sequential sampling strategy for sparse polynomial chaos expansion based on compressive sampling and Bayesian experimental design
- A new non-intrusive polynomial chaos using higher order sensitivities
- Basis adaptive sample efficient polynomial chaos (BASE-PC)
- Polynomial Chaos in Stochastic Finite Elements
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Spectral Methods for Uncertainty Quantification
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Automatic selection of basis-adaptive sparse polynomial chaos expansions for engineering applications
- Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
- Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
- For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution
- On the distribution of points in a cube and the approximate evaluation of integrals
