Papers › Centrosymmetric Matrices in the Sinc Collocation Method for Sturm-Liouville Problems
Centrosymmetric Matrices in the Sinc Collocation Method for Sturm-Liouville Problems
Philippe Gaudreau, Hassan Safouhi
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Recently, we used the Sinc collocation method with the double exponential transformation to compute eigenvalues for singular Sturm-Liouville problems. In this work, we show that the computation complexity of the eigenvalues of such a differential eigenvalue problem can be considerably reduced when its operator commutes with the parity operator. In this case, the matrices resulting from the Sinc collocation method are centrosymmetric. Utilizing well known properties of centrosymmetric matrices, we transform the problem of solving one large eigensystem into solving two smaller eigensystems. We show that only 1/(N+1) of all components need to be computed and stored in order to obtain all eigenvalues, where (2N+1) corresponds to the dimension of the eigensystem. We applied our result to the Schr\"odinger equation with the anharmonic potential and the numerical results section clearly illustrates the substantial gain in efficiency and accuracy when using the proposed algorithm.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections