2013
DOI: 10.1007/s12190-013-0657-1
|View full text |Cite
|
Sign up to set email alerts
|

On the calculation of the finite Hankel transform eigenfunctions

Abstract: In the recent years considerable attention has been focused on the numerical computation of the eigenvalues and eigenfunctions of the finite (truncated) Hankel transform, important for numerous applications. However, due to the very special behavior of the Hankel transform eigenfunctions, their direct numerical calculation often causes an essential loss of accuracy. Here, we discuss several simple, efficient and robust numerical techniques to compute Hankel transform eigenfunctions via the associated singular … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
29
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 22 publications
(31 citation statements)
references
References 26 publications
2
29
0
Order By: Relevance
“…We solved the KK equations (34) and (55) by the matrix method [41] with second-order truncation error in order to attain the complete KK spectra of the GS and string-cigar scenarios. Since the angular number l leads to a degenerate spectrum, we are interested in the l = 0 solutions (which are referred to s waves).…”
Section: Mass Spectrum and Kk Eigenfunctionsmentioning
confidence: 99%
“…We solved the KK equations (34) and (55) by the matrix method [41] with second-order truncation error in order to attain the complete KK spectra of the GS and string-cigar scenarios. Since the angular number l leads to a degenerate spectrum, we are interested in the l = 0 solutions (which are referred to s waves).…”
Section: Mass Spectrum and Kk Eigenfunctionsmentioning
confidence: 99%
“…We mention Initial Value Problems [4], Boundary Value Problems [5,6,11,12] and Sturm-Liouville problems [7][8][9][10]. In all these cases the proposed formulae show good stability properties and the developed codes turn out to be competitive with the existing software, in particular when the problem to be solved is stiff and the solution has a slope different from that of its derivatives.…”
Section: High Order Finite Difference Schemesmentioning
confidence: 99%
“…Matrix M has a band structure (bandwidth depends on the order of the method) with some additional elements on the first and last rows, because of the initial and final methods (see [8,9] for more details).…”
Section: High Order Finite Difference Schemesmentioning
confidence: 99%
See 2 more Smart Citations