Constructing Least-Squares Polynomial Approximations
From MaRDI portal
Publication:5113170
DOI10.1137/18M1234151zbMath1450.41001OpenAlexW3020831715MaRDI QIDQ5113170
Ling Guo, Tao Zhou, Akil C. Narayan
Publication date: 3 June 2020
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/18m1234151
Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximations to statistical distributions (nonasymptotic) (62E17) Approximation by polynomials (41A10) Rate of convergence, degree of approximation (41A25)
Related Items (14)
Optimal design for kernel interpolation: applications to uncertainty quantification ⋮ Stochastic gradient descent for semilinear elliptic equations with uncertainties ⋮ Normalizing field flows: solving forward and inverse stochastic differential equations using physics-informed flow models ⋮ Sparse Online Variational Bayesian Regression ⋮ A stochastic Galerkin method with adaptive time-stepping for the Navier-Stokes equations ⋮ A Normalizing Field Flow Induced Two-Stage Stochastic Homogenization Method for Random Composite Materials ⋮ Bi-Orthogonal fPINN: A Physics-Informed Neural Network Method for Solving Time-Dependent Stochastic Fractional PDEs ⋮ Level Set Learning with Pseudoreversible Neural Networks for Nonlinear Dimension Reduction in Function Approximation ⋮ An adaptive ANOVA stochastic Galerkin method for partial differential equations with high-dimensional random inputs ⋮ Towards optimal sampling for learning sparse approximation in high dimensions ⋮ Non-intrusive framework of reduced-order modeling based on proper orthogonal decomposition and polynomial chaos expansion ⋮ Flow-driven spectral chaos (FSC) method for long-time integration of second-order stochastic dynamical systems ⋮ A multi-fidelity polynomial chaos-greedy Kaczmarz approach for resource-efficient uncertainty quantification on limited budget ⋮ A multi-element non-intrusive polynomial chaos method using agglomerative clustering based on the derivatives to study irregular and discontinuous quantities of interest
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- On the stability and accuracy of least squares approximations
- High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs
- A non-adapted sparse approximation of PDEs with stochastic inputs
- Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
- User-friendly tail bounds for sums of random matrices
- Uniform approximation by discrete least squares polynomials
- A randomized Kaczmarz algorithm with exponential convergence
- A set of orthogonal polynomials induced by a given orthogonal polynomial
- Bernstein-Walsh theory associated to convex bodies and applications to multivariate approximation theory
- Computation of induced orthogonal polynomial distributions
- Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression
- A distribution-free theory of nonparametric regression
- Data-driven polynomial chaos expansions: a weighted least-square approximation
- Least squares polynomial chaos expansion: a review of sampling strategies
- Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets
- Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension
- Weighted discrete least-squares polynomial approximation using randomized quadratures
- A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
- Sequential function approximation with noisy data
- Monte Carlo and quasi-Monte Carlo sampling
- Universal algorithms for learning theory. II: Piecewise polynomial functions
- Nonadaptive Quasi-Optimal Points Selection for Least Squares Linear Regression
- Approximation of Quantities of Interest in Stochastic PDEs by the Random Discrete $L^2$ Projection on Polynomial Spaces
- Stochastic Collocation Methods on Unstructured Grids in High Dimensions via Interpolation
- On Discrete Least-Squares Projection in Unbounded Domain with Random Evaluations and its Application to Parametric Uncertainty Quantification
- Multivariate Discrete Least-Squares Approximations with a New Type of Collocation Grid
- Stochastic Collocation Methods via $\ell_1$ Minimization Using Randomized Quadratures
- A Christoffel function weighted least squares algorithm for collocation approximations
- Stochastic Spectral Galerkin and Collocation Methods for PDEs with Random Coefficients: A Numerical Comparison
- Computing Multivariate Fekete and Leja Points by Numerical Linear Algebra
- Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points
- Weighted Approximate Fekete Points: Sampling for Least-Squares Polynomial Approximation
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- Weighted pluripotential theory in C N
- Optimal weighted least-squares methods
- A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials
- Adaptive Leja Sparse Grid Constructions for Stochastic Collocation and High-Dimensional Approximation
- Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs
- Adaptive Polynomial Approximation by Means of Random Discrete Least Squares
- A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions
- Multivariate polynomial approximation in the hypercube
- Stochastic Collocation on Unstructured Multivariate Meshes
- STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATION
- A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
This page was built for publication: Constructing Least-Squares Polynomial Approximations
