Computing the smallest eigenvalue of large ill-conditioned Hankel matrices

Details Computing the smallest eigenvalue of large ill-conditioned Hankel matrices Computing the smallest eigenvalue of large ill-conditioned Hankel matrices

2009-02-05

arxiv.org/abs/0902.0852v1

Mathematics

Numerical Analysis

13 pages, 2 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Computing the smallest eigenvalue of large ill-conditioned Hankel matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing the smallest eigenvalue of large ill-conditioned Hankel matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing the smallest eigenvalue of large ill-conditioned Hankel matrices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-25571