Name
Title | ||
|---|---|---|
A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions. |
Abstract | ||
|---|---|---|
We propose an algorithm for recovering sparse orthogonal polynomial expansions via collocation. A standard sampling approach for recovering sparse polynomials uses Monte Carlo sampling, from the density of orthogonality, which results in poor function recovery when the polynomial degree is high. Our proposed approach aims to mitigate this limitation by sampling with respect to the weighted equilibrium measure of the parametric domain and subsequently solves a preconditioned l(1)-minimization problem, where the weights of the diagonal preconditioning matrix are given by evaluations of the Christoffel function. Our algorithm can be applied to a wide class of orthogonal polynomial families on bounded and unbounded domains, including all classical families. We present theoretical analysis to motivate the algorithm and numerical results that show our method is superior to standard Monte Carlo methods in many situations of interest. Numerical examples are also provided to demonstrate that our proposed algorithm leads to comparable or improved accuracy even when compared with Legendre- and Hermite-specific algorithms. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1137/16M1063885 | SIAM JOURNAL ON SCIENTIFIC COMPUTING |
Keywords | Field | DocType |
uncertainty quantification,polynomial chaos,compressed sensing | Mathematical optimization,Monte Carlo method,Orthogonal polynomials,Polynomial,Mathematical analysis,Sparse approximation,Degree of a polynomial,Algorithm,Polynomial chaos,Sampling (statistics),Matrix polynomial,Mathematics | Journal |
Volume | Issue | ISSN |
39 | 3 | 1064-8275 |
Citations | PageRank | References |
8 | 0.50 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| John D. Jakeman | 1 | 52 | 7.65 |
| Akil Narayan | 2 | 77 | 12.59 |
| Tao ZHOU | 3 | 85 | 15.92 |