PreprintarXiv licencearXiv
Advancements in Spectral Collocation Methods for High-Order Eigenvalue Problems
Abstract
This paper focuses on computing spectral solutions for high-order eigenvalue problems using an efficient discretization method based on Chebfun spectral discretization algorithms and domain truncation. We solve several numerical eigenvalue problems, demonstrating both the accuracy and computational efficiency of the proposed approach.
Related
- Well-Conditioned Birkhoff-Collocation Methods for Elliptic-type Problems in Multiple Dimensions
- Front-pinned spectral collocation for the flame problem and related ignition problems
- Mixed local-nonlocal eigenvalue problems in the Heisenberg group: spectral theory and singular multiplicity
- Multilevel Monte Carlo methods for random nonlinear eigenvalue problems
- p and rp-Spectral Element Methods for Two-dimensional Elliptic Boundary Layer Problems
BibTeX
@misc{gana2026advancements,
title = {{Advancements in Spectral Collocation Methods for High-Order Eigenvalue Problems}},
author = {Sameh Gana},
howpublished = {arXiv},
year = {2026},
month = aug,
doi = {10.48550/arxiv.2608.29932},
eprint = {2608.29932},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2608.29932},
}
RIS
TY - UNPB
TI - Advancements in Spectral Collocation Methods for High-Order Eigenvalue Problems
AU - Sameh Gana
PY - 2026
DA - 2026/08/30
PB - arXiv
DO - 10.48550/arxiv.2608.29932
UR - https://arxiv.org/abs/2608.29932
AB - This paper focuses on computing spectral solutions for high-order eigenvalue problems using an efficient discretization method based on Chebfun spectral discretization algorithms and domain truncation. We solve several numerical eigenvalue problems, demonstrating both the accuracy and computational efficiency of the proposed approach.
ER -