Effectively Subsampled Quadratures For Least Squares Polynomial Approximations release_ox3oalrxjndwhnvsraii7cluii

by Pranay Seshadri, Akil Narayan, Sankaran Mahadevan

Released as a article .

2016  

Abstract

This paper proposes a new deterministic sampling strategy for constructing polynomial chaos approximations for expensive physics simulation models. The proposed approach, effectively subsampled quadratures involves sparsely subsampling an existing tensor grid using QR column pivoting. For polynomial interpolation using hyperbolic or total order sets, we then solve the following square least squares problem. For polynomial approximation, we use a column pruning heuristic that removes columns based on the highest total orders and then solves the tall least squares problem. While we provide bounds on the condition number of such tall submatrices, it is difficult to ascertain how column pruning effects solution accuracy as this is problem specific. We conclude with numerical experiments on an analytical function and a model piston problem that show the efficacy of our approach compared with randomized subsampling. We also show an example where this method fails.
In text/plain format

Archived Files and Locations

application/pdf  1.1 MB
file_caakoft57jcyrgaw5s2schonp4
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2016-01-20
Version   v1
Language   en ?
arXiv  1601.05470v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 0b9497bd-f975-4ad4-bd55-a4d0a7dd57ab
API URL: JSON