Fast spherical Bessel transform via fast Fourier transform and recurrence formula

نویسندگان

  • Masayuki Toyoda
  • Taisuke Ozaki
چکیده

We propose a new method for the numerical evaluation of the spherical Bessel transform. A formula is derived for the transform by using an integral representation of the spherical Bessel function and by changing the integration variable. The resultant algorithm consists of a set of the Fourier transforms and numerical integrations over a linearly spaced grid of variable k in Fourier space. Because the k-dependence appears in the upper limit of the integration range, the integrations can be performed effectively in a recurrence formula. Several types of atomic orbital functions are transformed with the proposed method to illustrate its accuracy and efficiency, demonstrating its applicability for transforms of general order with high accuracy.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Experimental Study on Blinking and Eye Movement Detection via EEG Signals for Human-Robot Interaction Purposes Based on a Spherical 2-DOF Parallel Robot

Blinking and eye movement are one of the most important abilities that most people have, even people with spinal cord problem. By using this ability these people could handle some of their activities such as moving their wheelchair without the help of others. One of the most important fields in Human-Robot Interaction is the development of artificial limbs working with brain signals. The purpos...

متن کامل

A Fast Analysis-Based Discrete Hankel Transform Using Asymptotic Expansions

A fast and numerically stable algorithm is described for computing the discrete Hankel transform of order 0 as well as evaluating Schlömilch and Fourier–Bessel expansions in O(N(logN)2/ loglogN) operations. The algorithm is based on an asymptotic expansion for Bessel functions of large arguments, the fast Fourier transform, and the Neumann addition formula. All the algorithmic parameters are se...

متن کامل

Pathologies cardiac discrimination using the Fast Fourir Transform (FFT) The short time Fourier transforms (STFT) and the Wigner distribution (WD)

This paper is concerned with a synthesis study of the fast Fourier transform (FFT), the short time Fourier transform (STFT and the Wigner distribution (WD) in analysing the phonocardiogram signal (PCG) or heart cardiac sounds.     The FFT (Fast Fourier Transform) can provide a basic understanding of the frequency contents of the heart sounds. The STFT is obtained by calculating the Fourier tran...

متن کامل

Oscillatory Data Analysis and Fast Algorithms for Integral Operators a Dissertation Submitted to the Department of Mathematics and the Committee on Graduate Studies of Stanford University in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy

This dissertation consists of two independent parts: oscillatory data analysis (Part I) and fast algorithms for integral operators in computational harmonic analysis (Part II). The first part concentrates on developing theory and efficient tools in applied and computational harmonic analysis for oscillatory data analysis. In modern data science, oscillatory data analysis aims at identifying and...

متن کامل

Fast Edge Corrected Measurement of the Two-point Correlation Function and the Power Spectrum

We present two related techniques to measure the two-point correlation function and the power spectrum with edge correction in any spatial dimensions. The underlying algorithm uses fast Fourier transforms for calculating the two-point function with an heuristically weighted edge corrected estimator. Once the correlation function is measured, we estimate the power spectrum via numerical integrat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Physics Communications

دوره 181  شماره 

صفحات  -

تاریخ انتشار 2010