Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions (Q2309799): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2474787018 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1606.06611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte Carlo strategies in scientific computing. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4433869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3583848 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4379953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: High dimensional polynomial interpolation on sparse grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse grid collocation schemes for stochastic natural convection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5708033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimension-adaptive tensor-product quadrature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-element probabilistic collocation method in high dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive high-dimensional stochastic model representation technique for the solution of stochastic partial differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-adapted sparse approximation of PDEs with stochastic inputs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Compressed Sensing Approach for Partial Differential Equations with Random Input Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive sparse polynomial chaos expansion based on least angle regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing sparsity of Hermite polynomial expansions by iterative rotations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Active Subspace Methods in Theory and Practice: Applications to Kriging Surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Galerkin Finite Element Approximations of Stochastic Elliptic Partial Differential Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of stochastic partial differential equations using Galerkin finite element techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse pseudospectral approximation method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On compressive sensing applied to radar / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Decomposition by Basis Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ <sup>1</sup> minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse representations in unions of bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of $\ell_{1-2}$ for Compressed Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable recovery of sparse overcomplete representations in the presence of noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Bounds for Restricted Isometry Constants / rank
 
Normal rank
Property / cites work
 
Property / cites work: $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probing the Pareto Frontier for Basis Pursuit Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing with coherent and redundant dictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: DIMENSIONALITY REDUCTION FOR COMPLEX MODELS VIA BAYESIAN COMPRESSIVE SENSING / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global sensitivity indices for nonlinear mathematical models and their Monte Carlo estimates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing sparsity by reweighted \(\ell _{1}\) minimization / rank
 
Normal rank

Latest revision as of 05:54, 22 July 2024

scientific article
Language Label Description Also known as
English
Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
scientific article

    Statements

    Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions (English)
    0 references
    0 references
    0 references
    6 April 2020
    0 references
    compressive sampling
    0 references
    polynomial chaos expansion
    0 references
    uncertainty quantification
    0 references
    sparse approximation
    0 references
    Legendre polynomials
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers