102 citations · 787 across the 61 of their papers we have counts for
4 papers · 2 filters
A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
John D. Jakeman, Akil Narayan, Tao Zhou
In this paper we propose an algorithm for recovering sparse orthogonal polynomials using stochastic collocation. Our approach is motivated by the desire to use generalized polynomi…
Stochastic collocation methods via minimization using randomized quadratures
Ling Guo, Akil Narayan, Tao Zhou +1
In this work, we discuss the problem of approximating a multivariate function via minimization method, using a random chosen sub-grid of the corresponding tensor grid of G…
Effectively Subsampled Quadratures For Least Squares Polynomial Approximations
Pranay Seshadri, Akil Narayan, Sankaran Mahadevan
This paper proposes a new deterministic sampling strategy for constructing polynomial chaos approximations for expensive physics simulation models. The proposed approach, effective…
A goal-oriented RBM-Accelerated generalized polynomial chaos algorithm
Jiahua Jiang, Yanlai Chen, Akil Narayan
The non-intrusive generalized Polynomial Chaos (gPC) method is a popular computational approach for solving partial differential equations (PDEs) with random inputs. The main hurdl…