A Parallel Algorithm for Calculation of Large Determinants with High Accuracy for GPUs and MPI clusters
School of Information Technology, Deakin University, 221 Burwood Hwy, Burwood 3125, Australia
arXiv:1308.1536 [cs.DC], (8 Aug 2013)
@article{2013arXiv1308.1536B,
author={Beliakov}, G. and {Matiyasevich}, Y.},
title={"{A Parallel Algorithm for Calculation of Large Determinants with High Accuracy for GPUs and MPI clusters}"},
journal={ArXiv e-prints},
archivePrefix={"arXiv"},
eprint={1308.1536},
primaryClass={"cs.DC"},
keywords={Computer Science – Distributed, Parallel, and Cluster Computing, Computer Science – Mathematical Software, Computer Science – Numerical Analysis, Mathematics – Numerical Analysis, Mathematics – Number Theory, 65F40, 68W10, 11M26, D.1.3, G.1.0, G.1.3},
year={2013},
month={aug},
adsurl={http://adsabs.harvard.edu/abs/2013arXiv1308.1536B},
adsnote={Provided by the SAO/NASA Astrophysics Data System}
}
We present a parallel algorithm for calculating very large determinants with arbitrary precision on computer clusters. This algorithm minimises data movements between the nodes and computes not only the determinant but also all minors corresponding to a particular row or column at a little extra cost, and also the determinants and minors of all submatrices in the top left corner at no extra cost. We implemented the algorithm in arbitrary precision arithmetic, suitable for very ill conditioned matrices, and empirically estimated the loss of precision. The algorithm was applied to studies of Riemann’s zeta function.
August 12, 2013 by hgpu
Your response
You must be logged in to post a comment.
