Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
From MaRDI portal
Publication:347862
DOI10.1016/j.jcp.2013.04.004zbMath1349.60113OpenAlexW2171971725MaRDI QIDQ347862
Xiu Yang, George Em. Karniadakis
Publication date: 5 December 2016
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcp.2013.04.004
Stochastic partial differential equations (aspects of stochastic analysis) (60H15) Computational methods for stochastic equations (aspects of stochastic analysis) (60H35)
Related Items
Feasibility of DEIM for retrieving the initial field via dimensionality reduction, Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data, Weighted discrete least-squares polynomial approximation using randomized quadratures, On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization, A General Framework of Rotational Sparse Approximation in Uncertainty Quantification, Constructing Surrogate Models of Complex Systems with Enhanced Sparsity: Quantifying the Influence of Conformational Uncertainty in Biomolecular Solvation, Efficient uncertainty quantification of stochastic CFD problems using sparse polynomial chaos and compressed sensing, Infinite-dimensional compressed sensing and function interpolation, Selection of polynomial chaos bases via Bayesian model uncertainty methods with applications to sparse approximation of PDEs with stochastic inputs, A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions, Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies, Multi-level multi-fidelity sparse polynomial chaos expansion based on Gaussian process regression, Adaptive weighted least-squares polynomial chaos expansion with basis adaptivity and sequential adaptive sampling, A theoretical study of COmpRessed SolvING for advection-diffusion-reaction problems, Robust recovery of a kind of weighted l1-minimization without noise level, On the Bayesian calibration of computer model mixtures through experimental data, and the design of predictive models, Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations, An active sparse polynomial chaos expansion approach based on sequential relevance vector machine, Correcting for unknown errors in sparse high-dimensional function approximation, Basis adaptive sample efficient polynomial chaos (BASE-PC), A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions, APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS, Polynomial approximation via compressed sensing of high-dimensional functions on lower sets, Compressed Sensing with Sparse Corruptions: Fault-Tolerant Sparse Collocation Approximations, Sliced-Inverse-Regression--Aided Rotated Compressive Sensing Method for Uncertainty Quantification, Optimal observations-based retrieval of topography in 2D shallow water equations using PC-EnKF, Some greedy algorithms for sparse polynomial chaos expansions, Physics-informed cokriging: a Gaussian-process-regression-based multifidelity method for data-model convergence, Towards optimal sampling for learning sparse approximation in high dimensions, A Compressive Spectral Collocation Method for the Diffusion Equation Under the Restricted Isometry Property, Probability and Cumulative Density Function Methods for the Stochastic Advection-Reaction Equation, Sparse polynomial chaos expansions via compressed sensing and D-optimal design, 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, Efficient uncertainty quantification of CFD problems by combination of proper orthogonal decomposition and compressed sensing, Data fusion for uncertainty quantification with non-intrusive polynomial chaos, Sparse identification of nonlinear dynamical systems via reweighted \(\ell_1\)-regularized least squares, Nonadaptive Quasi-Optimal Points Selection for Least Squares Linear Regression, Using automatic differentiation for compressive sensing in uncertainty quantification, A Bayesian mixed shrinkage prior procedure for spatial-stochastic basis selection and evaluation of gPC expansions: applications to elliptic SPDEs, Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection, Enhancing sparsity of Hermite polynomial expansions by iterative rotations, Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs, When Bifidelity Meets CoKriging: An Efficient Physics-Informed MultiFidelity Method, A mixed ℓ1 regularization approach for sparse simultaneous approximation of parameterized PDEs, 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, New conditions on stable recovery of weighted sparse signals via weighted \(l_1\) minimization, Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark, Sparse polynomial chaos expansions using variational relevance vector machines, Gaussian process regression and conditional polynomial chaos for parameter estimation, GenMod: a generative modeling approach for spectral representation of PDEs with random inputs, Physics Information Aided Kriging using Stochastic Simulation Models, Bi-fidelity reduced polynomial chaos expansion for uncertainty quantification, A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions
Uses Software
Cites Work
- Unnamed Item
- Sparse Legendre expansions via \(\ell_1\)-minimization
- Adaptive ANOVA decomposition of stochastic incompressible and compressible flows
- A non-adapted sparse approximation of PDEs with stochastic inputs
- Iterative hard thresholding for compressed sensing
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Multi-element probabilistic collocation method in high dimensions
- The restricted isometry property and its implications for compressed sensing
- The multi-element probabilistic collocation method (ME-PCM): Error analysis and applications
- An adaptive high-dimensional stochastic model representation technique for the solution of stochastic partial differential equations
- A note on guaranteed sparse recovery via \(\ell_1\)-minimization
- Sparse high order FEM for elliptic sPDEs
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- An adaptive hierarchical sparse grid collocation algorithm for the solution of stochastic differential equations
- Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries
- Some remarks on greedy algorithms
- Weak greedy algorithms
- An adaptive multi-element generalized polynomial chaos method for stochastic differential equations
- Error Estimates for the ANOVA Method with Polynomial Chaos Interpolation: Tensor Product Functions
- Compressed Sensing: How Sharp Is the Restricted Isometry Property?
- Convergence rates for sparse chaos approximations of elliptic problems with stochastic coefficients
- Multi-Element Generalized Polynomial Chaos for Arbitrary Probability Measures
- Stochastic low-dimensional modelling of a random laminar wake past a circular cylinder
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- Probing the Pareto Frontier for Basis Pursuit Solutions
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- 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
- Adaptive Generalized Polynomial Chaos for Nonlinear Random Oscillators
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATION
- High-Order Collocation Methods for Differential Equations with Random Inputs