Calculating the divided differences of the exponential function by addition and removal of inputs

12/27/2019
by   Lalit Gupta, et al.
0

We introduce a method for calculating the divided differences of the exponential function by means of addition and removal of items from the input list to the function. Our technique exploits a new identity related to divided differences recently derived by F. Zivcovich [Dolomites Research Notes on Approximation 12, 28-42 (2019)]. We show that upon adding an item to or removing an item from the input list of an already evaluated exponential, the re-evaluation of the divided differences can be done with only O(s n) floating point operations and O(s n) bytes of memory, where [z_0,...,z_n] are the inputs and s ∝max_i,j |z_i - z_j|. We demonstrate our algorithm's ability to deal with input lists that are orders-of-magnitude longer than the maximal capacities of the current state-of-the-art. We discuss in detail one practical application of our method: the efficient calculation of weights in the off-diagonal series expansion quantum Monte Carlo algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/29/2021

Calculating elements of matrix functions using divided differences

We introduce a method for calculating individual elements of matrix func...
research
01/19/2023

Introducing memory to a family of multi-step multidimensional iterative methods with weight function

In this paper, we construct a derivative-free multi-step iterative schem...
research
08/30/2020

Beyond Next Item Recommendation: Recommending and Evaluating List of Sequences

Recommender systems (RS) suggest items-based on the estimated preference...
research
12/30/2019

A Hierarchical Self-Attentive Model for Recommending User-Generated Item Lists

User-generated item lists are a popular feature of many different platfo...
research
04/02/2023

FANS: Fast Non-Autoregressive Sequence Generation for Item List Continuation

User-curated item lists, such as video-based playlists on Youtube and bo...
research
02/15/2018

List Heaps

This paper presents a simple extension of the binary heap, the List Heap...
research
12/27/2016

Monte Carlo Sort for unreliable human comparisons

Algorithms which sort lists of real numbers into ascending order have be...

Please sign up or login with your details

Forgot password? Click here to reset