A non-adapted sparse approximation of PDEs with stochastic inputs
From MaRDI portal
Publication:543721
DOI10.1016/J.JCP.2011.01.002zbMATH Open1218.65008arXiv1006.2151OpenAlexW2056558085MaRDI QIDQ543721FDOQ543721
Alireza Doostan, Houman Owhadi
Publication date: 17 June 2011
Published in: Journal of Computational Physics (Search for Journal in Brave)
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).
Full work available at URL: https://arxiv.org/abs/1006.2151
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
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)
Cites Work
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Probing the Pareto Frontier for Basis Pursuit Solutions
- Least angle regression. (With discussion)
- Title not available (Why is that?)
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Atomic Decomposition by Basis Pursuit
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Stable recovery of sparse overcomplete representations in the presence of noise
- A new approach to variable selection in least squares problems
- Title not available (Why is that?)
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Compressed sensing
- Signal Recovery by Proximal Forward-Backward Splitting
- Iterative hard thresholding for compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Compressed sensing and best 𝑘-term approximation
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Sparsity and incoherence in compressive sampling
- A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
- Adaptive greedy approximations
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- An adaptive multi-element generalized polynomial chaos method for stochastic differential equations
- Karhunen-Loève approximation of random fields by generalized fast multipole methods
- A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- An Anisotropic Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- Galerkin Finite Element Approximations of Stochastic Elliptic Partial Differential Equations
- High-Order Collocation Methods for Differential Equations with Random Inputs
- A least-squares approximation of partial differential equations with high-dimensional random inputs
- Atomic decomposition by basis pursuit
- Convergence rates for sparse chaos approximations of elliptic problems with stochastic coefficients
- An adaptive hierarchical sparse grid collocation algorithm for the solution of stochastic differential equations
- A Sparse Composite Collocation Finite Element Method for Elliptic SPDEs.
- Solution of stochastic partial differential equations using Galerkin finite element techniques
- A stochastic modeling methodology based on weighted Wiener chaos and Malliavin calculus
- Sparse Tensor Discretization of Elliptic sPDEs
- Compressed Sensing With Cross Validation
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Sparse high order FEM for elliptic sPDEs
- Quantitative robust uncertainty principles and optimally sparse decompositions
- A generalized spectral decomposition technique to solve a class of linear stochastic partial differential equations
- Stochastic model reduction for chaos representations
- Generalized spectral decomposition method for solving stochastic finite element equations: invariant subspace problem and dedicated algorithms
- Uncertainty Quantification in CFD Simulations: A Stochastic Spectral Approach
- Multi-resolution analysis of Wiener-type uncertainty propagation schemes
- Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
Cited In (only showing first 100 items - show all)
- 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
- GenMod: a generative modeling approach for spectral representation of PDEs with random inputs
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- Generalization bounds for sparse random feature expansions
- 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
- Global sensitivity analysis for multivariate outputs using polynomial chaos-based surrogate models
- Efficient uncertainty quantification of CFD problems by combination of proper orthogonal decomposition and compressed sensing
- Bi-fidelity reduced polynomial chaos expansion for uncertainty quantification
- Near-Optimal Sampling Strategies for Multivariate Function Approximation on General Domains
- Optimal observations-based retrieval of topography in 2D shallow water equations using PC-EnKF
- Bi-fidelity approximation for uncertainty quantification and sensitivity analysis of irradiated particle-laden turbulence
- A dynamically adaptive sparse grids method for quasi-optimal interpolation of multidimensional functions
- Optimal design for kernel interpolation: applications to uncertainty quantification
- Sparse Approximation using $\ell_1-\ell_2$ Minimization and Its Application to Stochastic Collocation
- Stochastic Collocation Methods via $\ell_1$ Minimization Using Randomized Quadratures
- An iterative polynomial chaos approach for solution of structural mechanics problem with Gaussian material property
- 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
- Data-driven polynomial chaos expansions: a weighted least-square approximation
- Exploring the Locally Low Dimensional Structure in Solving Random Elliptic PDEs
- Neural network training using \(\ell_1\)-regularization and bi-fidelity data
- Efficient Computation of Sobol' Indices for Stochastic Models
- Efficient uncertainty quantification of stochastic CFD problems using sparse polynomial chaos and compressed sensing
- Compressed Sensing with Sparse Corruptions: Fault-Tolerant Sparse Collocation Approximations
- Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs
- Effectively Subsampled Quadratures for Least Squares Polynomial Approximations
- Correcting for unknown errors in sparse high-dimensional function approximation
- Bi-fidelity stochastic gradient descent for structural optimization under uncertainty
- Accelerating the Bayesian inference of inverse problems by using data-driven compressive sensing method based on proper orthogonal decomposition
- A mixed ℓ1 regularization approach for sparse simultaneous approximation of parameterized PDEs
- A Christoffel function weighted least squares algorithm for collocation approximations
- Stochastic Collocation vial1-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification
- 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
- Weighted Approximate Fekete Points: Sampling for Least-Squares Polynomial Approximation
- Sliced-Inverse-Regression--Aided Rotated Compressive Sensing Method for Uncertainty Quantification
- Data-driven compressive sensing and applications in uncertainty quantification
- Polynomial chaos representation of databases on manifolds
- Global sensitivity analysis based on high-dimensional sparse surrogate construction
- When Bifidelity Meets CoKriging: An Efficient Physics-Informed MultiFidelity Method
- 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
- A distributed active subspace method for scalable surrogate modeling of function valued outputs
- Spectral methods for nonlinear functionals and functional differential equations
- A multi-fidelity polynomial chaos-greedy Kaczmarz approach for resource-efficient uncertainty quantification on limited budget
- \(h\)-\(p\) adaptive model based approximation of moment free sensitivity indices
- Smoothed aggregation algebraic multigrid for stochastic PDE problems with layered materials
- Robust and optimal sparse regression for nonlinear PDE models
- A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions
- Non-intrusive framework of reduced-order modeling based on proper orthogonal decomposition and polynomial chaos expansion
- Nonadaptive quasi-optimal points selection for least squares linear regression
- Learning ``best kernels from data in Gaussian process regression. With application to aerodynamics
- Variational inference with NoFAS: normalizing flow with adaptive surrogate for computationally expensive models
- APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS
- Polynomial chaos expansions for dependent random variables
- The numerical approximation of nonlinear functionals and functional differential equations
- Data assimilation for models with parametric uncertainty
- A new surrogate modeling technique combining Kriging and polynomial chaos expansions - application to uncertainty analysis in computational dosimetry
- Reduced chaos expansions with random coefficientsin reduced-dimensional stochastic modeling of coupled problems
- A preconditioning approach for improved estimation of sparse polynomial chaos expansions
- Sparse pseudo spectral projection methods with directional adaptation for uncertainty quantification
- Sparse Legendre expansions via \(\ell_1\)-minimization
- Compressive sensing adaptation for polynomial chaos expansions
- PLS-based adaptation for efficient PCE representation in high dimensions
- Bayesian Numerical Homogenization
- Gradient-based optimization for regression in the functional tensor-train format
- Some greedy algorithms for sparse polynomial chaos expansions
- An efficient multifidelity \(\ell_1\)-minimization method for sparse polynomial chaos
- Uniqueness Conditions for A Class of ℓ0-Minimization Problems
- On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization
- Reduced basis ANOVA methods for partial differential equations with high-dimensional random inputs
- Infinite-dimensional compressed sensing and function interpolation
- A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
- Sparse polynomial approximations for affine parametric saddle point problems
- A heterogeneous stochastic FEM framework for elliptic PDEs
- On stability and monotonicity requirements of finite difference approximations of stochastic conservation laws with random viscosity
- Partitioned treatment of uncertainty in coupled domain problems: a separated representation approach
- Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
- Spectral representation of stochastic field data using sparse polynomial chaos expansions
- A sparse grid stochastic collocation method for elliptic interface problems with random input
- Practical error bounds for a non-intrusive bi-fidelity approach to parametric/stochastic model reduction
- An offline/online algorithm for a class of stochastic multiple obstacle scattering configurations in the half-plane
- Level set methods for stochastic discontinuity detection in nonlinear problems
- Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data
- Functional approximation and projection of stored energy functions in computational homogenization of hyperelastic materials: a probabilistic perspective
- Efficient uncertainty quantification of stochastic problems in CFD by combination of compressed sensing and POD-kriging
- Multi-fidelity stochastic collocation method for computation of statistical moments
- Polynomial meta-models with canonical low-rank approximations: numerical insights and comparison to sparse polynomial chaos expansions
- Enhancing sparsity of Hermite polynomial expansions by iterative rotations
- Spectral likelihood expansions for Bayesian inference
- Sparse identification of nonlinear dynamical systems via reweighted \(\ell_1\)-regularized least squares
- Exploiting active subspaces to quantify uncertainty in the numerical simulation of the hyshot II scramjet
- Sparse polynomial chaos expansions via compressed sensing and D-optimal design
- Model order reduction and low-dimensional representations for random linear dynamical systems
- Sensitivity analysis and model order reduction for random linear dynamical systems
Uses Software
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)
