Smallest Eigenvalue of Large Hankel Matrices at Critical Point: Comparing Conjecture With Parallelised Computation
Yang Chen, Jakub Sikorowski, Mengkun Zhu

TL;DR
This paper introduces a parallel numerical algorithm to compute the smallest eigenvalues of large, ill-conditioned Hankel matrices, confirming conjectures about their asymptotic behavior with high precision computations.
Contribution
A novel parallel algorithm based on LDLT decomposition for eigenvalue computation of large Hankel matrices, enabling high-precision analysis and validation of theoretical conjectures.
Findings
Algorithm achieves good scalability on high performance clusters.
Numerical results match theoretical predictions for eigenvalue behavior.
Confirmed conjecture about eigenvalue tending to zero for specific matrix families.
Abstract
We propose a novel parallel numerical algorithm for calculating the smallest eigenvalues of highly ill-conditioned matrices. It is based on the {\it LDLT} decomposition and involves finding a sub-matrix of the inverse of the original Hankel matrix . The computation involves extremely high precision arithmetic, message passing interface, and shared memory parallelisation. We demonstrate that this approach achieves good scalability on a high performance computing cluster (HPCC) which constitute a major improvement of the earlier approaches. We use this method to study a family of Hankel matrices generated by the weight supported on and Such weight generates Hankel determinant, a fundamental object in random matrix theory. In the situation where the smallest eigenvalue tend to 0,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMolecular spectroscopy and chirality · Random Matrices and Applications · Matrix Theory and Algorithms
