Journal
MATHEMATICS
Volume 10, Issue 15, Pages -Publisher
MDPI
DOI: 10.3390/math10152782
Keywords
symmetric tridiagonal matrix; eigenvalue solver; matrix division; parallel algorithm
Categories
Funding
- Talent Team Project of Zhangjiang City
- R&D and industrialization project of the offshore aquaculture cage nets system of Guangdong Province of China [2021E05034]
- Huazhong University of Science and Technology funds the APC
Ask authors/readers for more resources
This paper presents a new approach to parallelize the Bisection iteration algorithm, achieving efficient computation of eigenvalues while reducing the time cost by over 35-70% compared to the traditional Bisection algorithm.
The embarrassingly parallel nature of the Bisection Algorithm makes it easy and efficient to program on a parallel computer, but with an expensive time cost when all symmetric tridiagonal eigenvalues are wanted. In addition, few methods can calculate a single eigenvalue in parallel for now, especially in a specific order. This paper solves the issue with a new approach that can parallelize the Bisection iteration. Some pseudocodes and numerical results are presented. It shows our algorithm reduces the time cost by more than 35-70% compared to the Bisection algorithm while maintaining its accuracy and flexibility.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
