Year: 2017
Numerical Mathematics: Theory, Methods and Applications, Vol. 10 (2017), Iss. 4 : pp. 775–797
Abstract
In this paper we consider the algorithm for recovering sparse orthogonal polynomials using stochastic collocation via ℓq minimization. The main results include: 1) By using the norm inequality between ℓq and ℓ2 and the square root lifting inequality, we present several theoretical estimates regarding the recoverability for both sparse and non-sparse signals via ℓq minimization; 2) We then combine this method with the stochastic collocation to identify the coefficients of sparse orthogonal polynomial expansions, stemming from the field of uncertainty quantification. We obtain recoverability results for both sparse polynomial functions and general non-sparse functions. We also present various numerical experiments to show the performance of the ℓq algorithm. We first present some benchmark tests to demonstrate the ability of ℓq minimization to recover exactly sparse signals, and then consider three classical analytical functions to show the advantage of this method over the standard ℓ1 and reweighted ℓ1 minimization. All the numerical results indicate that the ℓq method performs better than standard ℓ1 and reweighted ℓ1 minimization.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/10.4208/nmtma.2017.0001
Numerical Mathematics: Theory, Methods and Applications, Vol. 10 (2017), Iss. 4 : pp. 775–797
Published online: 2017-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 23
Keywords: Uncertainty quantification stochastic collocation ℓ$_q$-minimization polynomial chaos expansions.