Least squares polynomial chaos expansion: a review of sampling strategies (Q2310855)

scientific article

Language	Label	Description	Also known as
English	Least squares polynomial chaos expansion: a review of sampling strategies	scientific article

Statements

instance of

scholarly article

0 references

title

Least squares polynomial chaos expansion: a review of sampling strategies (English)

0 references

0 references

0 references

Computer Methods in Applied Mechanics and Engineering

0 references

publication date

7 April 2020

0 references

full work available at URL

https://arxiv.org/abs/1706.07564

0 references

zbMATH Keywords

polynomial chaos

0 references

least squares approximation

0 references

optimal sampling

0 references

optimal design of experiments

0 references

coherence-optimal

0 references

describes a project that uses

NetQuest

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

The orthogonal development of non-linear functionals in series of Fourier-Hermite functionals

0 references

Q3997987

0 references

Q3583848

0 references

Uncertainty Quantification and Polynomial Chaos Techniques in Computational Fluid Dynamics

0 references

A non-adapted sparse approximation of PDEs with stochastic inputs

0 references

Stochastic finite elements: Computational approaches to stochastic partial differential equations

0 references

Galerkin methods for linear and nonlinear elliptic stochastic partial differential equations

0 references

Galerkin Finite Element Approximations of Stochastic Elliptic Partial Differential Equations

0 references

The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations

0 references

Spectral Methods for Uncertainty Quantification

0 references

Q4215355

0 references

Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression

0 references

Stochastic finite element: a non intrusive approach by regression

0 references

Sparse pseudospectral approximation method

0 references

A Christoffel function weighted least squares algorithm for collocation approximations

0 references

Weighted discrete least-squares polynomial approximation using randomized quadratures

0 references

Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets

0 references

Multivariate Discrete Least-Squares Approximations with a New Type of Collocation Grid

0 references

Model-oriented design of experiments

0 references

Q4680350

0 references

Optimal Design of Experiments

0 references

Q3445852

0 references

An Efficient Sampling Method for Regression-Based Polynomial Chaos Expansion

0 references

Nonadaptive Quasi-Optimal Points Selection for Least Squares Linear Regression

0 references

On the stability and accuracy of least squares approximations

0 references

Q3078293

0 references

Analysis of discrete $L^2$ projection on polynomial spaces with random evaluations

0 references

Approximation of Quantities of Interest in Stochastic PDEs by the Random Discrete $L^2$ Projection on Polynomial Spaces

0 references

Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies

0 references

High-Order Collocation Methods for Differential Equations with Random Inputs

0 references

Worst case scenario analysis for elliptic problems with uncertainty

0 references

A hybrid collocation/Galerkin scheme for convective heat transfer problems with stochastic boundary conditions

0 references

On the Choice of Design Points for Least Square Polynomial Approximations with Application to Uncertainty Quantification

0 references

A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data

0 references

Q5600030

0 references

A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data

0 references

Q3711436

0 references

Minimizing the Condition Number of a Gram Matrix

0 references

Minimizing the Condition Number to Construct Design Points for Polynomial Regression Models

0 references

A new approach to the construction of optimal designs

0 references

Q3618870

0 references

Response surface design evaluation and comparison

0 references

Q3844024

0 references

Optimal designs for two-level factorial experiments with binary response

0 references

$E$-optimal designs for second-order response surface models

0 references

Q2799905

0 references

A Comparison of Algorithms for Constructing Exact D-Optimal Designs

0 references

An Algorithm for the Construction of "D-Optimal" Experimental Designs

0 references

The Sequential Generation of $D$-Optimum Experimental Designs

0 references

Some Guidelines for Constructing Exact D-Optimal Designs on Convex Design Spaces

0 references

The construction of exact <i>D</i>-optimum experimental designs with application to blocking response surface designs

0 references

The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs

0 references

A review of some exchange algorithms for constructing discrete $D$-optimal designs

0 references

Optimal experimental design and some related control problems

0 references

The Application of the Annealing Algorithm to the Construction of Exact Optimal Designs for Linear-Regression Models

0 references

Constructing Exact D-Optimal Experimental Designs by Simulated Annealing

0 references

Application of genetic algorithms to the construction of exact D-optimal designs

0 references

Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming

0 references

Optimal design of multi-response experiments using semi-definite programming

0 references

`` Direct Search'' Solution of Numerical and Statistical Problems

0 references

Design and analysis of simulation experiments

0 references

Design of computer experiments: space filling and beyond

0 references

Low discrepancy sequences in high dimensions: how well are their projections distributed?

0 references

Q3160669

0 references

Quasi-Monte Carlo methods and pseudo-random numbers

0 references

Q3426055

0 references

Discrepancy estimates based on Haar functions

0 references

Q3928080

0 references

Uniform Design: Theory and Application

0 references

Q4326423

0 references

Q4369801

0 references

A note on construction of nearly uniform designs with large number of runs.

0 references

Majorization framework for balanced lattice designs

0 references

Q4267681

0 references

A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code

0 references

Large Sample Properties of Simulations Using Latin Hypercube Sampling

0 references

Latin supercube sampling for very high-dimensional simulations

0 references

Orthogonal Column Latin Hypercubes and Their Application in Computer Experiments

0 references

Algorithmic construction of optimal symmetric Latin hypercube designs.

0 references

Optimal and orthogonal Latin hypercube designs for computer experiments

0 references

A construction method for orthogonal Latin hypercube designs

0 references

Sliced Latin Hypercube Designs

0 references

Q3498633

0 references

A distribution-free approach to inducing rank correlation among input variables

0 references

Maximum projection designs for computer experiments

0 references

An adaptive multi-element generalized polynomial chaos method for stochastic differential equations

0 references

Identifiers

zbMATH Open document ID

1440.65007

0 references

DOI

10.1016/j.cma.2017.12.019

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2310855