On approximating the shape of one dimensional functions

11/08/2019
by   Chaitanya Joshi, et al.
0

Consider an s-dimensional function being evaluated at n points of a low discrepancy sequence (LDS), where the objective is to approximate the one-dimensional functions that result from integrating out (s-1) variables. Here, the emphasis is on accurately approximating the shape of such one-dimensional functions. Approximating this shape when the function is evaluated on a set of grid points instead is relatively straightforward. However, the number of grid points needed increases exponentially with s. LDS are known to be increasingly more efficient at integrating s-dimensional functions compared to grids, as s increases. Yet, a method to approximate the shape of a one-dimensional function when the function is evaluated using an s-dimensional LDS has not been proposed thus far. We propose an approximation method for this problem. This method is based on an s-dimensional integration rule together with fitting a polynomial smoothing function. We state and prove results showing conditions under which this polynomial smoothing function will converge to the true one-dimensional function. We also demonstrate the computational efficiency of the new approach compared to a grid based approach.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/25/2022

An efficient and fast sparse grid algorithm for high-dimensional numerical integration

This paper is concerned with developing an efficient numerical algorithm...
research
08/06/2021

HJB-RBF based approach for the control of PDEs

Semi-lagrangian schemes for discretization of the dynamic programming pr...
research
11/02/2021

Numerical Smoothing with Hierarchical Adaptive Sparse Grids and Quasi-Monte Carlo Methods for Efficient Option Pricing

When approximating the expectation of a functional of a stochastic proce...
research
05/30/2023

Discretization and Optimization using Graphs: One-Dimensional Algorithm

We consider the problem of discretizing one-dimensional, real-valued fun...
research
02/25/2022

Convergence of sparse grid Gaussian convolution approximation for multi-dimensional periodic function

We consider the problem of approximating [0,1]^d-periodic functions by c...
research
06/05/2023

Using R-functions to Control the Shape of Soft Robots

In this paper, we introduce a new approach for soft robot shape formatio...
research
02/14/2022

High-Dimensional Dynamic Stochastic Model Representation

We propose a scalable method for computing global solutions of nonlinear...

Please sign up or login with your details

Forgot password? Click here to reset