Effectively Subsampled Quadratures for Least Squares Polynomial Approximations
From MaRDI portal
Publication:4636415
DOI10.1137/16M1057668zbMath1384.93159arXiv1601.05470MaRDI QIDQ4636415
Sankaran Mahadevan, Pranay Seshadri, Akil C. Narayan
Publication date: 19 April 2018
Published in: SIAM/ASA Journal on Uncertainty Quantification (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.05470
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Stable high-order cubature formulas for experimental data ⋮ Polynomial chaos expansions for dependent random variables ⋮ Active Operator Inference for Learning Low-Dimensional Dynamical-System Models from Noisy Data ⋮ Optimized Sampling for Multiscale Dynamics ⋮ Sparse polynomial chaos expansions via compressed sensing and D-optimal design ⋮ Generating Nested Quadrature Rules with Positive Weights based on Arbitrary Sample Sets ⋮ Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements ⋮ Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- On the stability and accuracy of least squares approximations
- Analysis of discrete \(L^2\) projection on polynomial spaces with random evaluations
- On the low-rank approximation by the pivoted Cholesky decomposition
- A non-adapted sparse approximation of PDEs with stochastic inputs
- Adaptive sparse polynomial chaos expansion based on least angle regression
- Sparse pseudospectral approximation method
- Numerical integration using sparse grids
- A modified Gram-Schmidt algorithm with iterative orthogonalization and column pivoting
- Weighted discrete least-squares polynomial approximation using randomized quadratures
- Modeling multibody systems with uncertainties. I: Theoretical and computational aspects
- A class of orthogonal polynomials
- Principal submatrices. IX: Interlacing inequalities for singular values of submatrices
- On the convergence of generalized polynomial chaos expansions
- Approximation of Quantities of Interest in Stochastic PDEs by the Random Discrete $L^2$ Projection on Polynomial Spaces
- Subsampled Gauss Quadrature Nodes for Estimating Polynomial Chaos Expansions
- A Christoffel function weighted least squares algorithm for collocation approximations
- Computing Multivariate Fekete and Leja Points by Numerical Linear Algebra
- Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points
- Impossibility of Fast Stable Approximation of Analytic Functions from Equispaced Samples
- APPROXIMATION OF PERIODIC FUNCTIONS OF SEVERAL VARIABLES WITH BOUNDED MIXED DIFFERENCE
- On Rank-Revealing Factorisations
- A BLAS-3 Version of the QR Factorization with Column Pivoting
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs
- Sparse grids
- Modern Industrial Statistics
- Numerical Methods in Matrix Computations
- A Cardinal Function Algorithm for Computing Multivariate Quadrature Points
This page was built for publication: Effectively Subsampled Quadratures for Least Squares Polynomial Approximations
