A fast procedure for the construction of quadrature formulas for bandlimited functions

07/28/2023
by   Abinand Gopal, et al.
0

We introduce an efficient scheme for the construction of quadrature rules for bandlimited functions. While the scheme is predominantly based on well-known facts about prolate spheroidal wave functions of order zero, it has the asymptotic CPU time estimate O(n log n) to construct an n-point quadrature rule. Moreover, the size of the “n log n” term in the CPU time estimate is small, so for all practical purposes the CPU time cost is proportional to n. The performance of the algorithm is illustrated by several numerical examples.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/15/2021

On the numerical evaluation of the prolate spheroidal wave functions of order zero

We describe a method for the numerical evaluation of the angular prolate...
research
01/03/2020

Monte-Carlo cubature construction

In numerical integration, cubature methods are effective, in particular ...
research
11/15/2021

An 𝒪(1) algorithm for the numerical evaluation of the Sturm-Liouville eigenvalues of the spheroidal wave functions of order zero

In addition to being the eigenfunctions of the restricted Fourier operat...
research
01/06/2020

Numerical evaluation of Airy-type integrals arising in uniform asymptotic analysis

We describe a method to evaluate integrals that arise in the asymptotic ...
research
11/22/2022

On a reduced digit-by-digit component-by-component construction of lattice point sets

In this paper, we study an efficient algorithm for constructing point se...
research
12/10/2018

Disciplined Geometric Programming

We introduce log-log convex programs, which are optimization problems wi...
research
05/28/2021

An efficient hybrid hash based privacy amplification algorithm for quantum key distribution

Privacy amplification (PA) is an essential part in a quantum key distrib...

Please sign up or login with your details

Forgot password? Click here to reset