2020
DOI: 10.1016/j.jcp.2020.109733
|View full text |Cite
|
Sign up to set email alerts
|

A Jacobi spectral method for computing eigenvalue gaps and their distribution statistics of the fractional Schrödinger operator

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2021
2021
2025
2025

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(6 citation statements)
references
References 60 publications
0
6
0
Order By: Relevance
“…Since it contains at most thirteen non-zero entries in each column of B m and C m , and at most two non-zero entries in each column of D m , only 53M 3 6 + O(M 2 ) operations are required to solve (3.14). In return, the Clenshaw algorithm shares the same order of complexity.…”
Section: Clenshaw Algorithm For Koornwinder Expansionsmentioning
confidence: 99%
See 3 more Smart Citations
“…Since it contains at most thirteen non-zero entries in each column of B m and C m , and at most two non-zero entries in each column of D m , only 53M 3 6 + O(M 2 ) operations are required to solve (3.14). In return, the Clenshaw algorithm shares the same order of complexity.…”
Section: Clenshaw Algorithm For Koornwinder Expansionsmentioning
confidence: 99%
“…To assemble the stiffness matrix, we need to evaluate the integral (∇ϕ ℓ , ∇ϕ k ) T . Indeed, the linear mapping Ψ defined in (4.1) has the following explicit form: (1) x1 + x (2) x2 + x (3) x3 .…”
Section: Stiffness Matrix Assemblingmentioning
confidence: 99%
See 2 more Smart Citations
“…(2.20) and (2.25)). Indeed, the A-GHFs can provide a viable tool for the solutions of fractional Schrödinger problems (see, e.g., [22,47,5,6]).…”
Section: Introductionmentioning
confidence: 99%