Limiting behaviour of the generalized simplex gradient as the number of points tends to infinity on a fixed shape in R^n

04/01/2021
by   Warren Hare, et al.
0

This work investigates the asymptotic behaviour of the gradient approximation method called the generalized simplex gradient (GSG). This method has an error bound that at first glance seems to tend to infinity as the number of sample points increases, but with some careful construction, we show that this is not the case. For functions in finite dimensions, we present two new error bounds ad infinitum depending on the position of the reference point. The error bounds are not a function of the number of sample points and thus remain finite.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/01/2020

Error bounds for overdetermined and underdetermined generalized centred simplex gradients

Using the Moore–Penrose pseudoinverse, this work generalizes the gradien...
research
09/12/2023

On the asymptotic behaviour of the quantiles in the gamma distribution

The asymptotic behaviour of the quantiles in the gamma distribution is i...
research
04/03/2019

Error bounds for the normal approximation to the length of a Ewens partition

Let K(=K_n,θ) be a positive integer-valued random variable whose distrib...
research
05/21/2019

Lonely Points in Simplices

Given a lattice L in Z^m and a subset A of R^m, we say that a point in A...
research
06/06/2018

On the limiting distribution of sample central moments

We investigate the limiting behavior of sample central moments, examinin...
research
12/11/2018

Bounding the Error From Reference Set Kernel Maximum Mean Discrepancy

In this paper, we bound the error induced by using a weighted skeletoniz...
research
10/11/2022

Critical Points at Infinity for Hyperplanes of Directions

Analytic combinatorics in several variables (ACSV) analyzes the asymptot...

Please sign up or login with your details

Forgot password? Click here to reset