Matrix Balancing in Lp Norms: Bounding the Convergence Rate of Osborne's Iteration

DOI10.1137/1.9781611974782.11zbMath1412.65025arXiv1606.08083OpenAlexW4240059086MaRDI QIDQ4575746

Yuval Rabani, Rafail Ostrovsky, Arman Yousefi

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.08083

Mathematics Subject Classification ID

Numerical computation of matrix norms, conditioning, scaling (65F35) Preconditioners for iterative methods (65F08)

Related Items (3)

Approximating Min-Mean-Cycle for Low-Diameter Graphs in Near-Optimal Time and Memory ⋮ Near-linear convergence of the random Osborne algorithm for matrix balancing ⋮ Unnamed Item

This page was built for publication: Matrix Balancing in L_p Norms: Bounding the Convergence Rate of Osborne's Iteration