2009/02/05 by Niall Emmart, Emmart, Niall, Charles Weems +3
Computer Science · Physics and Astronomy · #Electromagnetic Scattering and Analysis #FOS: Mathematics #Matrix Theory and Algorithms #Numerical Analysis (math.NA) #Polynomial and algebraic computation
paper · pdf · doi:10.48550/arxiv.0902.0852
openalex publication_date 2009/02/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper presents a parallel algorithm for finding the smallest eigenvalue of a particular form of ill-conditioned Hankel matrix, which requires the use of extremely high precision arithmetic. Surprisingly, we find that commonly-used approaches that are designed for high efficiency are actually less efficient than a direct approach under these conditions. We then develop a parallel implementation of the algorithm that takes into account the unusually high cost of individual arithmetic operations. Our approach combines message passing and shared memory, achieving near-perfect scalability and high tolerance for network latency. We are thus able to find solutions for much larger matrices than has been previously possible, with the potential for extending this work to systems with greater levels of parallelism.