Abstract
We recently proposed an iterative procedure which asymptotically scales the rows and columns of a given matrix to one in a given norm. In this work, we briefly mention some of the properties of that algorithm and discuss its efficient parallelization. We report on a parallel performance study of our implementation on a few computing environments. © 2008 Springer Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Amestoy, P. R., Duff, I. S., Ruiz, D., & Uçar, B. (2008). A parallel matrix scaling algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5336 LNCS, pp. 301–313). https://doi.org/10.1007/978-3-540-92859-1_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
