Gradient Descent-based D-optimal Design for the Least-Squares Polynomial Approximation

06/18/2018
by   V. P. Zankin, et al.
0

In this work, we propose a novel sampling method for Design of Experiments. This method allows to sample such input values of the parameters of a computational model for which the constructed surrogate model will have the least possible approximation error. High efficiency of the proposed method is demonstrated by its comparison with other sampling techniques (LHS, Sobol sequence sampling, and Maxvol sampling) on the problem of least-squares polynomial approximation. Also, numerical experiments for the Lebesgue constant growth for the points sampled by the proposed method are carried out.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/12/2023

Randomized least-squares with minimal oversampling and interpolation in general spaces

In approximation of functions based on point values, least-squares metho...
research
09/27/2021

On Kosloff Tal-Ezer least-squares quadrature formulas

In this work, we study a global quadrature scheme for analytic functions...
research
03/18/2021

Optimal soil sampling design based on the maxvol algorithm

Spatial soil sampling is an integral part of a soil survey aimed at crea...
research
08/04/2019

Optimal sampling strategies for multivariate function approximation on general domains

In this paper, we address the problem of approximating a multivariate fu...
research
05/28/2018

Sequential sampling for optimal weighted least squares approximations in hierarchical spaces

We consider the problem of approximating an unknown function u∈ L^2(D,ρ)...
research
12/29/2017

Sparse Polynomial Chaos Expansions via Compressed Sensing and D-optimal Design

In the field of uncertainty quantification, sparse polynomial chaos (PC)...
research
01/02/2022

Least-Squares Method for Inverse Medium Problems

We present a two-stage least-squares method to inverse medium problems o...

Please sign up or login with your details

Forgot password? Click here to reset