Sampling bessel functions and bessel sampling

Author

Masirevic, Dragana Jankov ; Pogany, Tibor K. ; Bariez, Arpad ; Galantai, Aurel

Author_Institution

Dept. of Math., Univ. of Osijek, Osijek, Croatia

fYear

2013

fDate

23-25 May 2013

Firstpage

79

Lastpage

84

Abstract

The main aim of this article is to establish summation formulae in form of sampling expansion series for Bessel functions Y_v, I_v; and K_v, and obtain sharp truncation error upper bounds occurring in the Y-Bessel sampling series approximation. The principal derivation tools are the famous sampling theorem by Kramer and various properties of Bessel and modified Bessel functions which lead to the so-called Bessel sampling when the sampling nodes of the initial signal function coincide with a set of zeros of different cylinder functions.

Keywords

Bessel functions; approximation theory; signal sampling; Bessel function sampling; Y-Bessel sampling series approximation; cylinder functions; initial signal function sampling nodes; principal derivation tools; sampling expansion series; sharp truncation error upper bounds; summation formulae; Approximation methods; Computational intelligence; Educational institutions; Finite wordlength effects; Informatics; Kernel; Upper bound; Bessel functions of the first and second kind Jv, Yv; K v; Kramer´s sampling theorem; Y- Bessel sampling; modified Bessel functions of the first and second kind Iv; sampling series expansions; sampling series truncation error upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Applied Computational Intelligence and Informatics (SACI), 2013 IEEE 8th International Symposium on

Conference_Location

Timisoara

Print_ISBN

978-1-4673-6397-6

Type

conf

DOI

10.1109/SACI.2013.6608942

Filename

6608942