Stochastic collocation algorithms using _1-minimization
From MaRDI portal
Stochastic collocation algorithms using \(\ell 1\)-minimization
\(\ell_1\)-minimizationLegendre polynomialsmulti-dimensional interpolationnumerical teststochastic collocation
PDEs with randomness, stochastic partial differential equations (35R60) Stochastic partial differential equations (aspects of stochastic analysis) (60H15) Computational methods for stochastic equations (aspects of stochastic analysis) (60H35) Numerical solutions to stochastic differential and integral equations (65C30) Spectral, collocation and related methods for initial value and initial-boundary value problems involving PDEs (65M70)
Recommendations
- Sparse approximation using _1-_2 minimization and its application to stochastic collocation
- Stochastic collocation methods via \(\ell_1\) minimization using randomized quadratures
- Stochastic collocation methods via minimisation of the transformed \(L_1\)-penalty
- A weighted _1-minimization approach for sparse polynomial chaos expansions
- Stochastic Collocation vial1-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification
Cited in
(67)- Infinite-dimensional compressed sensing and function interpolation
- Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression
- Sparse polynomial chaos expansions via compressed sensing and D-optimal design
- A preconditioning approach for improved estimation of sparse polynomial chaos expansions
- 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
- An efficient adaptive forward-backward selection method for sparse polynomial chaos expansion
- Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs
- Structure exploiting methods for fast uncertainty quantification in multiphase flow through heterogeneous media
- A multi-fidelity polynomial chaos-greedy Kaczmarz approach for resource-efficient uncertainty quantification on limited budget
- Bi-fidelity reduced polynomial chaos expansion for uncertainty quantification
- nPINNs: nonlocal physics-informed neural networks for a parametrized nonlocal universal Laplacian operator. Algorithms and applications
- Optimal design for kernel interpolation: applications to uncertainty quantification
- Polynomial chaos expansions for dependent random variables
- Adaptive weighted least-squares polynomial chaos expansion with basis adaptivity and sequential adaptive sampling
- Data assimilation for models with parametric uncertainty
- Regression-based sparse polynomial chaos for uncertainty quantification of subsurface flow models
- Probabilistic modeling and global sensitivity analysis for CO\(_2\) storage in geological formations: a spectral approach
- Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
- Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements
- Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data
- Weighted discrete least-squares polynomial approximation using randomized quadratures
- Simplex-stochastic collocation method with improved scalability
- On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization
- Reduced basis ANOVA methods for partial differential equations with high-dimensional random inputs
- A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
- 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
- Nonadaptive quasi-optimal points selection for least squares linear regression
- Simplex stochastic collocation with random sampling and extrapolation for nonhypercube probability spaces
- A sparse grid stochastic collocation method for elliptic interface problems with random input
- Subsampled Gauss quadrature nodes for estimating polynomial chaos expansions
- Sparse approximation using _1-_2 minimization and its application to stochastic collocation
- Stochastic collocation methods via \(\ell_1\) minimization using randomized quadratures
- Constructing surrogate models of complex systems with enhanced sparsity: quantifying the influence of conformational uncertainty in biomolecular solvation
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
- A weighted _1-minimization approach for sparse polynomial chaos expansions
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- Weighted approximate Fekete points: sampling for least-squares polynomial approximation
- 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
- Sequential Design of Experiment for Sparse Polynomial Chaos Expansions
- Stochastic collocation methods via minimisation of the transformed \(L_1\)-penalty
- Sparse polynomial chaos expansions: literature survey and benchmark
- A general framework of rotational sparse approximation in uncertainty quantification
- APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS
- Constructing least-squares polynomial approximations
- Multiscale model reduction method for Bayesian inverse problems of subsurface flow
- A mixed ℓ1 regularization approach for sparse simultaneous approximation of parameterized PDEs
- Stochastic collocation algorithms using \(l_1\)-minimization for Bayesian solution of inverse problems
- A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
- Stochastic Collocation vial1-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification
- Exploring the locally low dimensional structure in solving random elliptic PDEs
- Sequential active learning of low-dimensional model representations for reliability analysis
- High-order spectral method of density estimation for stochastic differential equation driven by multivariate Gaussian random variables
- Challenges of order reduction techniques for problems involving polymorphic uncertainty
- Analysis of sparse recovery for Legendre expansions using envelope bound
- Towards optimal sampling for learning sparse approximation in high dimensions
- Identification of corrupted data via k-means clustering for function approximation
- Surrogate models for diffusion on graphs via sparse polynomials
- Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
- Enhancing sparsity of Hermite polynomial expansions by iterative rotations
- Spectral likelihood expansions for Bayesian inference
- Rank adaptive tensor recovery based model reduction for partial differential equations with high-dimensional random inputs
- Gaussian process regression and conditional polynomial chaos for parameter estimation
This page was built for publication: Stochastic collocation algorithms using \(\ell_1\)-minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5412285)
