A non-adapted sparse approximation of PDEs with stochastic inputs
From MaRDI portal
Publication:543721
sparse approximationconvergenceerror boundsnumerical examplesuncertainty quantificationpolynomial chaoscompressive samplingstochastic coefficients
Stochastic partial differential equations (aspects of stochastic analysis) (60H15) PDEs with randomness, stochastic partial differential equations (35R60) Computational methods for stochastic equations (aspects of stochastic analysis) (60H35) Numerical solutions to stochastic differential and integral equations (65C30) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Error bounds for boundary value problems involving PDEs (65N15)
Abstract: We propose a method for the approximation of solutions of PDEs with stochastic coefficients based on the direct, i.e., non-adapted, sampling of solutions. This sampling can be done by using any legacy code for the deterministic problem as a black box. The method converges in probability (with probabilistic error bounds) as a consequence of sparsity and a concentration of measure phenomenon on the empirical correlation between samples. We show that the method is well suited for truly high-dimensional problems (with slow decay in the spectrum).
Recommendations
- An adaptive sparse grid method for elliptic PDEs with stochastic coefficients
- A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
- On the optimal polynomial approximation of stochastic PDEs by Galerkin and collocation methods
- A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
Cites work
- scientific article; zbMATH DE number 4170917 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Sparse Composite Collocation Finite Element Method for Elliptic SPDEs.
- A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
- A generalized spectral decomposition technique to solve a class of linear stochastic partial differential equations
- A least-squares approximation of partial differential equations with high-dimensional random inputs
- A new approach to variable selection in least squares problems
- A stochastic modeling methodology based on weighted Wiener chaos and Malliavin calculus
- Adaptive greedy approximations
- An Anisotropic Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- An adaptive hierarchical sparse grid collocation algorithm for the solution of stochastic differential equations
- An adaptive multi-element generalized polynomial chaos method for stochastic differential equations
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Atomic Decomposition by Basis Pursuit
- Atomic decomposition by basis pursuit
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Compressed Sensing With Cross Validation
- Compressed sensing
- Compressed sensing and best \(k\)-term approximation
- Convergence rates for sparse chaos approximations of elliptic problems with stochastic coefficients
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Galerkin Finite Element Approximations of Stochastic Elliptic Partial Differential Equations
- Generalized spectral decomposition method for solving stochastic finite element equations: invariant subspace problem and dedicated algorithms
- High-Order Collocation Methods for Differential Equations with Random Inputs
- Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
- Iterative hard thresholding for compressed sensing
- Karhunen-Loève approximation of random fields by generalized fast multipole methods
- Least angle regression. (With discussion)
- Multi-resolution analysis of Wiener-type uncertainty propagation schemes
- NESTA: A fast and accurate first-order method for sparse recovery
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Probing the Pareto frontier for basis pursuit solutions
- Quantitative robust uncertainty principles and optimally sparse decompositions
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Signal Recovery by Proximal Forward-Backward Splitting
- Solution of stochastic partial differential equations using Galerkin finite element techniques
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Sparse high order FEM for elliptic sPDEs
- Sparse tensor discretization of elliptic SPDEs
- Sparsity and incoherence in compressive sampling
- Stable recovery of sparse overcomplete representations in the presence of noise
- Stochastic model reduction for chaos representations
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- Uncertainty Quantification in CFD Simulations: A Stochastic Spectral Approach
Cited in
(only showing first 100 items - show all)- Smoothed aggregation algebraic multigrid for stochastic PDE problems with layered materials.
- Global sensitivity analysis for multivariate outputs using polynomial chaos-based surrogate models
- Multi-fidelity stochastic collocation method for computation of statistical moments
- A distributed active subspace method for scalable surrogate modeling of function valued outputs
- On the use of derivatives in the polynomial chaos based global sensitivity and uncertainty analysis applied to the distributed parameter models
- Adaboost-based ensemble of polynomial chaos expansion with adaptive sampling
- Optimal design for kernel interpolation: applications to uncertainty quantification
- Neural network training using \(\ell_1\)-regularization and bi-fidelity data
- Optimal observations-based retrieval of topography in 2D shallow water equations using PC-EnKF
- Data-driven polynomial chaos expansions: a weighted least-square approximation
- Bi-fidelity approximation for uncertainty quantification and sensitivity analysis of irradiated particle-laden turbulence
- Weighted approximate Fekete points: sampling for least-squares polynomial approximation
- Data assimilation for models with parametric uncertainty
- Efficient computation of Sobol' indices for stochastic models
- Nonadaptive quasi-optimal points selection for least squares linear regression
- SDE based regression for linear random PDEs
- Bi-fidelity reduced polynomial chaos expansion for uncertainty quantification
- Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
- A generalized multi-resolution expansion for uncertainty propagation with application to cardiovascular modeling
- Constructing least-squares polynomial approximations
- Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs
- When Bifidelity Meets CoKriging: An Efficient Physics-Informed MultiFidelity Method
- A theoretical study of compressed solving for advection-diffusion-reaction problems
- Learning ``best kernels from data in Gaussian process regression. With application to aerodynamics
- Uncertainty propagation of p-boxes using sparse polynomial chaos expansions
- On the Bayesian calibration of computer model mixtures through experimental data, and the design of predictive models
- Accelerating the Bayesian inference of inverse problems by using data-driven compressive sensing method based on proper orthogonal decomposition
- Variational inference with NoFAS: normalizing flow with adaptive surrogate for computationally expensive models
- Compressed sparse tensor based quadrature for vibrational quantum mechanics integrals
- Cost reduction of stochastic Galerkin method by adaptive identification of significant polynomial chaos bases for elliptic equations
- Sparsity-promoting elastic net method with rotations for high-dimensional nonlinear inverse problem
- A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness
- Spectral methods for nonlinear functionals and functional differential equations
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- Efficient reliability analysis with a CDA-based dimension-reduction model and polynomial chaos expansion
- Model order reduction for random nonlinear dynamical systems and low-dimensional representations for their quantities of interest
- Exploring the locally low dimensional structure in solving random elliptic PDEs
- A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions
- Sliced-Inverse-Regression--Aided Rotated Compressive Sensing Method for Uncertainty Quantification
- A mixed ℓ1 regularization approach for sparse simultaneous approximation of parameterized PDEs
- Near-optimal sampling strategies for multivariate function approximation on general domains
- Sparse approximation using \(\ell_1-\ell_2\) minimization and its application to stochastic collocation
- Stochastic collocation methods via \(\ell_1\) minimization using randomized quadratures
- Data-driven compressive sensing and applications in uncertainty quantification
- Polynomial chaos representation of databases on manifolds
- Efficient uncertainty quantification of stochastic CFD problems using sparse polynomial chaos and compressed sensing
- APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS
- Efficient uncertainty quantification of CFD problems by combination of proper orthogonal decomposition and compressed sensing
- Correcting for unknown errors in sparse high-dimensional function approximation
- A multi-fidelity polynomial chaos-greedy Kaczmarz approach for resource-efficient uncertainty quantification on limited budget
- Sparse approximate solution of partial differential equations
- Bi-fidelity stochastic gradient descent for structural optimization under uncertainty
- Non-intrusive framework of reduced-order modeling based on proper orthogonal decomposition and polynomial chaos expansion
- Polynomial chaos expansions for dependent random variables
- Effectively subsampled quadratures for least squares polynomial approximations
- Stochastic Collocation vial1-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification
- Stochastic variational multiscale analysis of the advection-diffusion equation: advective-diffusive regime and multi-dimensional problems
- Generalization bounds for sparse random feature expansions
- Robust and optimal sparse regression for nonlinear PDE models
- GenMod: a generative modeling approach for spectral representation of PDEs with random inputs
- A sparse FFT approach for ODE with random coefficients
- A dynamically adaptive sparse grids method for quasi-optimal interpolation of multidimensional functions
- An iterative polynomial chaos approach for solution of structural mechanics problem with Gaussian material property
- A Christoffel function weighted least squares algorithm for collocation approximations
- Reduced Wiener chaos representation of random fields via basis adaptation and projection
- Level set methods for stochastic discontinuity detection in nonlinear problems
- Uniqueness conditions for a class of \(\ell_{0}\)-minimization problems
- Gradient-based optimization for regression in the functional tensor-train format
- A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations
- Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression
- An efficient adaptive forward-backward selection method for sparse polynomial chaos expansion
- An efficient multifidelity \(\ell_1\)-minimization method for sparse polynomial chaos
- Quantifying initial and wind forcing uncertainties in the gulf of Mexico
- A rapid and efficient isogeometric design space exploration framework with application to structural mechanics
- Sparse polynomial chaos expansions: literature survey and benchmark
- Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
- A sparse grid stochastic collocation method for elliptic interface problems with random input
- A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
- A new surrogate modeling technique combining Kriging and polynomial chaos expansions - application to uncertainty analysis in computational dosimetry
- A Bayesian mixed shrinkage prior procedure for spatial-stochastic basis selection and evaluation of gPC expansions: applications to elliptic SPDEs
- Compressive sensing adaptation for polynomial chaos expansions
- Reduced chaos expansions with random coefficients in reduced-dimensional stochastic modeling of coupled problems
- Rank adaptive tensor recovery based model reduction for partial differential equations with high-dimensional random inputs
- Sparse multiresolution regression for uncertainty propagation
- A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions
- PLS-based adaptation for efficient PCE representation in high dimensions
- Sensitivity analysis and model order reduction for random linear dynamical systems
- A least-squares approximation of partial differential equations with high-dimensional random inputs
- Sparse polynomial approximations for affine parametric saddle point problems
- A heterogeneous stochastic FEM framework for elliptic PDEs
- Spectral representation of stochastic field data using sparse polynomial chaos expansions
- A preconditioning approach for improved estimation of sparse polynomial chaos expansions
- Uncertainty quantification in computational stochastic multiscale analysis of nonlinear elastic materials
- Sparse polynomial chaos expansions via compressed sensing and D-optimal design
- On stability and monotonicity requirements of finite difference approximations of stochastic conservation laws with random viscosity
- Some greedy algorithms for sparse polynomial chaos expansions
- Multi-fidelity non-intrusive polynomial chaos based on regression
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
- Basis adaptation in homogeneous chaos spaces
- Non-intrusive uncertainty quantification using reduced cubature rules
This page was built for publication: A non-adapted sparse approximation of PDEs with stochastic inputs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q543721)
