Chebyshev Accelerated Subspace Eigensolver for Pseudo-hermitian Hamiltonians
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911597064093696 |
|---|---|
| author | Di Napoli, Edoardo Richefort, Clément Wu, Xinzhe |
| author_facet | Di Napoli, Edoardo Richefort, Clément Wu, Xinzhe |
| contents | Studying the optoelectronic structure of materials can require the computation of several thousands of the smallest positive eigenpairs of a pseudo-hermitian Hamiltonian. Iterative eigensolvers may be preferred over direct methods for this task since their complexity is a function of the desired fraction of the spectrum. In addition, they generally rely on highly optimized and scalable kernels such as matrix-vector multiplications that leverage the massive parallelism and the computational power of modern exascale systems. The Chebyshev Accelerated Subspace iteration Eigensolver (ChASE) is able to compute several thousands of the most extreme eigenpairs of dense hermitian matrices with proven scalability over massive parallel accelerated clusters. This work presents an extension of ChASE to solve for a portion of the smallest positive eigenpairs of pseudo-hermitian Hamiltonians as they appear in the treatment of excitonic materials. By exploiting the numerical structure and spectral properties of the Hamiltonian matrix, we preserve the characteristic positive-negative symmetry in the treatment of the eigenvectors and propose an oblique variant of Rayleigh-Ritz projection that features quadratic convergence of the Ritz values with no explicit construction of the dual basis. Additionally, we introduce a parallel implementation of the recursive matrix-product operation appearing in the Chebyshev filter with limited amount of global communications. Our development is supported by a full numerical analysis and experimental tests. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_10557 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Chebyshev Accelerated Subspace Eigensolver for Pseudo-hermitian Hamiltonians Di Napoli, Edoardo Richefort, Clément Wu, Xinzhe Numerical Analysis Computational Engineering, Finance, and Science Distributed, Parallel, and Cluster Computing Computational Physics 65F15 G.1.3 Studying the optoelectronic structure of materials can require the computation of several thousands of the smallest positive eigenpairs of a pseudo-hermitian Hamiltonian. Iterative eigensolvers may be preferred over direct methods for this task since their complexity is a function of the desired fraction of the spectrum. In addition, they generally rely on highly optimized and scalable kernels such as matrix-vector multiplications that leverage the massive parallelism and the computational power of modern exascale systems. The Chebyshev Accelerated Subspace iteration Eigensolver (ChASE) is able to compute several thousands of the most extreme eigenpairs of dense hermitian matrices with proven scalability over massive parallel accelerated clusters. This work presents an extension of ChASE to solve for a portion of the smallest positive eigenpairs of pseudo-hermitian Hamiltonians as they appear in the treatment of excitonic materials. By exploiting the numerical structure and spectral properties of the Hamiltonian matrix, we preserve the characteristic positive-negative symmetry in the treatment of the eigenvectors and propose an oblique variant of Rayleigh-Ritz projection that features quadratic convergence of the Ritz values with no explicit construction of the dual basis. Additionally, we introduce a parallel implementation of the recursive matrix-product operation appearing in the Chebyshev filter with limited amount of global communications. Our development is supported by a full numerical analysis and experimental tests. |
| title | Chebyshev Accelerated Subspace Eigensolver for Pseudo-hermitian Hamiltonians |
| topic | Numerical Analysis Computational Engineering, Finance, and Science Distributed, Parallel, and Cluster Computing Computational Physics 65F15 G.1.3 |
| url | https://arxiv.org/abs/2601.10557 |