A Parallel Matrix Scaling Algorithm

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...

Full description

Saved in:
Bibliographic Details
Published inHigh Performance Computing for Computational Science - VECPAR 2008 pp. 301 - 313
Main Authors Amestoy, Patrick R., Duff, Iain S., Ruiz, Daniel, Uçar, Bora
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2008
SeriesLecture Notes in Computer Science
Subjects
equilibration
matrix scaling
parallel computing
Sparse matrices
Online AccessGet full text
ISBN3540928588
9783540928584
ISSN0302-9743
1611-3349
DOI10.1007/978-3-540-92859-1_27

Cover

More Information
Summary: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.
Bibliography:This work was supported by “Agence Nationale de la Recherche” through Solstice project ANR-06-CIS6-010.
ISBN:3540928588
9783540928584
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-92859-1_27