| Document Date: 2005-07-06 08:18:48
Open Document File Size: 191,34 KBShare Result on Facebook
Company SIAM Journal / A. V. Goldberg S. A. / / Facility Pennsylvania State University / / IndustryTerm polynomial algorithm / polynomial-time approximation algorithm / parallel algorithms / parallel computing / polynomial time algorithm / natural algorithm / parallel matrix inversion algorithms / deterministic polynomial time algorithm / iterative scaling algorithm / deterministic algorithm / computing / polylogarithmic bipartite matching algorithm / similar algorithm / / Organization National Science Foundation / Mathematical Association of America / Pennsylvania State University / / Person Avi Wigderson / Lorenz / Franklin / Nathan Linial / Alex Samorodnitsky / / / ProvinceOrState North Carolina / / PublishedMedium SIAM Journal on Computing / Theoretical Computer Science / Communications of the ACM / Theory of Computing / / Technology polynomial-time approximation algorithm / Linial-Samorodnitsky-Wigderson algorithm / An algorithm / known scaling algorithm / iterative scaling algorithm / matching algorithm / scaling algorithm / previous scaling algorithm / polynomial time algorithm / LSW algorithm / previously known scaling algorithm / A. The LSW algorithm / similar algorithm / fairly natural algorithm / E. parallel algorithms / approximation algorithms / previous scaling algorithms / polylogarithmic bipartite matching algorithm / second algorithm / previously known algorithm / Main Conjecture Algorithm / previously known scaling algorithms / parallel matrix inversion algorithms / two algorithms / polynomial algorithm / deterministic polynomial time algorithm / /
SocialTag |
Quadratic Convergence for Scaling of Matrices∗ Martin F¨ urer† Abstract Matrix scaling is an operation on nonnegative matrices with nonzero permanent. It multiplies the rows and columns of a